All Questions
Tagged with order-theory reference-request
21 questions with no upvoted or accepted answers
9
votes
0
answers
205
views
Reference for sparseness of incomparability graphs implying sparseness of covering graphs
If a partial order on $n$ elements has $m$ incomparable pairs, then its covering graph (aka Hasse diagram aka transitive reduction, the graph of pairs of elements that are comparable but are not the ...
9
votes
0
answers
309
views
Higher-order dimension in posets: a reference request
Let $P = (X, \le)$ be a partially-ordered set. Then the dimension of $P$ is the minimum number of total orders over $X$ whose intersection yields $P$. Alternately, the dimension of $P$ is the minimum ...
8
votes
0
answers
227
views
Is there a 'local' version of Near Coherence of Filters?
The axiom Near Coherence of Filters (NCF) is known to be independent of ZFC.
Axiom (NCF I): For any two free ultrafilters $\mathcal D$ and $\mathcal E$ on $\mathbb N$, there exist finite-to-one ...
7
votes
0
answers
118
views
Dimension of a union of downsets
We have established the following result regarding the Dushnik–Miller dimension of posets.
Let $P$ be a poset with downsets $C, D \subseteq P$. If the dimensions of $C$ and $D$ are $m$ and $n$, ...
5
votes
0
answers
201
views
Is this "trimming" of a supersolvable semimodular lattice known?
Let $L$ be a finite (upper) semimodular lattice. Recall that this means $L$ is graded and its rank function $\rho\colon L \to \mathbb{N}$ satisfies
$$ \rho(x) + \rho(y) \geq \rho(x\vee y)+\rho(x \...
5
votes
0
answers
109
views
Reference request: a survey of (linear) Krein-Rutman theory
I'm looking for a survey article or book chapter where a rather exhaustive treatment of the Krein-Rutman theory of positive linear operators an ordered Banach spaces is given.
Motivation. Some ...
5
votes
0
answers
64
views
Characters on monotone functions
Characters on the semigroup $(C_{+}^{b}(\mathbb{R}^{d}),+)$, i.e. on bounded positive continuous functions with the ususal pointwise addition, are known to be of the form $C_{+}^{b}(\mathbb{R}^{d})\ni ...
4
votes
0
answers
234
views
To whom is the classification of atomic, modular finite lattices due?
Here lattice means a poset with meets and joins. A lattice is called atomic if every element is a join of atoms. There are a few different ways to define modular for finite lattices: one is that the ...
3
votes
0
answers
95
views
When is it possible to extend several linear orders defined "locally" into a single linear order defined "globally"?
This is a somewhat fuzzy question, so I will try my best to give a formulation which includes everything relevant while excluding everything else. I would like to find out if anyone else has studied ...
3
votes
0
answers
132
views
Duality for continuous lattices based on [0, 1]
A continuous lattice may be defined as a complete lattice in which arbitrary meets distribute over directed joins. A continuous lattice is naturally regarded as an algebraic structure where the ...
3
votes
0
answers
119
views
Generalizing disjointness
The following definition generalizes set-theoretic disjointess:
Definition 0. (Autonomy). Given a Lawvere theory $\mathsf{T}$, a $\mathsf{T}$-algebra $X$, and an indexed family $S$ of subalgebras ...
2
votes
0
answers
97
views
References discussing the category of ordered commutative rings
Is there a reference anywhere discussing the category of ordered commutative rings?
I'm thinking of ordered commutative rings and ring homomorphisms preserving the order, but I would also be ...
2
votes
0
answers
116
views
Isomorphic subcategories of directed graphs and presets
For the purposes of this post, a digraph (directed graph) has neither loops nor multiple parallel edges, and a preset is an ordered pair consisting of a set $S$ and a preorder (viz., a reflexive and ...
2
votes
0
answers
417
views
An equivariant Hahn embedding theorem?
The Hahn Embedding Theorem asserts that for any (linearly) ordered abelian group $\Lambda$, there exists a linearly ordered indexing set $\Omega$ such that $\Lambda$ admits an order-preserving group ...
2
votes
0
answers
95
views
A specific notion between the notions of transversal and system of distinct representatives.
Let $X$ be a set, let $\mathcal{C}$ be a collection of subsets of $X$, and let $x_1, \dots , x_k \in X$. Say that the sequence $\{x_i\}_{i=1\dots k}$ is a sequential transversal (of length $k$) ...
1
vote
0
answers
95
views
Reference request: Time and proofs of shared pasts
Is there research about structures for notions of time with distributed systems of information, as with blockchains?
I am thinking of tuples $(I, T, P, A, \prec, s, \eta, u)$ where
$I$, $T$ and $P$ ...
1
vote
0
answers
98
views
Continuous dcpos are $\omega_1$-algebraic
Recall that a poset is directed if every finite subset has an upper bound, and directed-complete (a dcpo) if every directed subset has a join (supremum). In a dcpo, $x \ll y$ is defined to mean that ...
1
vote
0
answers
731
views
"Downward closed" relation on a poset
I say that a relation $R$ on a poset $P$ is downward closed if for each $(x,y)\in R$, and $x'\le x$, then $(x',y)\in R$.
Is there a reference where this thing is studied, maybe under a different name?
...
0
votes
0
answers
75
views
Conditions for logarithmic upper bound on size of antichains in a partial order
Suppose I have a partial order $(P,\le)$ (in practice I have a very specific one, but let's start with a generic question).
Are there known conditions that would imply that the size of any antichain ...
0
votes
0
answers
131
views
terminology: monotone maps of posets such that the image of a lower set is a lower set
How are called in combinatorics
monotone maps of partially ordered sets such that the image of a lower set is a lower set, i.e. closed (or open) maps of finite topologies? Is there a classification ...
0
votes
0
answers
206
views
Vector-valued valuations on lattices
There's a fair amount of work on valuations on (modular) lattices, by which I mean functions $v : \mathcal{L} \rightarrow R$ that satisfy the modular expression
$$v(x) + v(y) = v(x \wedge y) + v(x \...