A poset or partially ordered set is a set endowed with a partial order, meaning a binary relation $\leq$ which is reflexive ($x \leq x$ for all $x$) and transitive ($x\leq y$ and $y\leq z$ implies $x \leq z$).

learn more… | top users | synonyms

3
votes
0answers
45 views

Matching in the Boolean Algebra

We consider the Boolean Algebra of the set $[n]=\{1,\dots,n\}$ and the matching $\psi$ from the $m+1$ subsets of $[n]$ into the $m$ subsets of $[n]$ for $(n+1)/2\leq m+1\leq n$, which is used to show ...
14
votes
3answers
798 views

Subposets of small Dushnik-Miller dimension

The Dushnik–Miller dimension of a partial order $(P,{\leq})$ is the smallest possible size $d$ for a family ${\leq_1},\ldots,{\leq_d}$ of total orderings of $P$ whose intersection is ${\leq}$, ...
2
votes
4answers
337 views

Minimal (semi)lattice containing a given poset

For a given poset, (I think that) it is easy to construct the minimal join-semilattice containing that poset. I wonder whether the minimal lattice containing that poset is also easy to construct. I ...
3
votes
0answers
120 views

references for properties/examples of breadth in (semi)lattices

This is in some sense following up on my earlier question and the answer given by NN. I am currently revising the paper which used the condition mentioned in my question. It was pointed out in NN's ...
2
votes
2answers
97 views

Representation of Banach spaces partially ordered by solid, normal, minihedral cones

I've been using the representation result below, from Krasnosel'skij/Lifshits/Sobolev; Positive Linear Systems---The Method of Positive Linear Operators. Heldermann Verlag, 1989. Theorem. Let $E$ be ...
4
votes
1answer
160 views

About subposet of Levy collapse

Let $\lambda>\kappa$ and $\operatorname{Coll}(\kappa, \lambda)$ be the poset collapsing $\lambda$ to $\kappa$. Pick a subposet $P$ which is $\lt\kappa$-closed and of size $\lambda$. Can we say that ...
1
vote
0answers
55 views

Suprema and infima in spaces ordered by non-normal cones

Background We shall call a subset $V_+ \subseteq V$ of a Banach space $V$ a cone if $V_+$ is closed, $\alpha V_+ \subseteq V_+$ for all $\alpha \geqslant 0$, and $V_+ \cap (-V_+) = \{0\}$. Cones ...
15
votes
0answers
208 views

Is the Poset of Graphs Automorphism-free?

For $n\geq 5$, let $\mathcal {P}_n$ be the set of all isomorphism classes of graphs with n vertices. Give this set the poset structure given by $G \le H$ if and only if $G$ is a subgraph of $H$. ...
5
votes
0answers
96 views

Strength of claims about extensions of partial preorders and orders to linear ones

Consider these two axioms: Every partial order extends to a linear order. Every partial preorder (reflexive and transitive relation) extends to a linear preorder while preserving strict orderings: ...
2
votes
0answers
49 views

Rank generating functions on a graded poset and a linear extension of it

Let $A$ be a possibly infinite ensemble and let $\leq$ be a partial order between elements of $A$. We denote $P_{\leq}=(A,\leq)$ the corresponding poset. Furthermore, we suppose that $P$ is graded, ...
2
votes
1answer
274 views

Count of lattices on finite set

Let $p(n)$ denote count of lattices on finite set $G$, $|G|=n$ (without isomorphism). It's know closed formula for $p(n)$? It's clear, that $1 \leq p(n)$ and also that $p(n-1) \leq p(n)$ for $n \geq ...
1
vote
1answer
75 views

Generalized connected components decomposition for Priestley spaces

Preliminaries A partially ordered space is both a poset and a topological space. It has connected components both as a topological space, and connected components as a poset, i.e. the maximal ...
2
votes
1answer
129 views

Linear order extensions on (nonabelian) groups

If $G$ is a group with a (left) linear order, does every (left) partial order on $G$ extend to a (left) linear order? The answer is affirmative on abelian groups, where being torsion-free is ...
2
votes
1answer
82 views

Are the connected components of a Priestley space closed?

Preliminaries A Priestley space is both a poset and a topological space. The topologically connected components of the space are trivially closed. (They are just the points of the underlying set.) But ...
6
votes
1answer
192 views

Terminology question for poset maps

Is there a standard name for order-preserving maps $f\colon P\to Q$ of posets with the property that the image of a lower set is a lower set, or equivalently if $q\leq f(p)$ then there exists $p'\leq ...
7
votes
1answer
253 views

Does this lattice have a name (and literature)?

The "lattice" in the title appears to be a lattice. At least it's a poset, which I define now. Fix a partition $\lambda$ of $n$ and consider the set of all standard Young tableaux (each of ...
48
votes
6answers
10k views

How many orders of infinity are there?

Define a growth function to be a monotone increasing function $F: {\bf N} \to {\bf N}$, thus for instance $n \mapsto n^2$, $n \mapsto 2^n$, $n \mapsto 2^{2^n}$ are examples of growth functions. Let's ...
10
votes
2answers
301 views

Do operations generate well-ordered sets only?

I've read   @TauMu's question   about the set of functions   $\mathbb N\rightarrow\mathbb N$   generated from the identity map by repeatedly applying exponentiation of two already ...
9
votes
1answer
400 views

Does this property of a partially ordered set have a name?

What do you call a poset with this property? For any elements $a,b,c,d$ such that $\{a,b\}\le\{c,d\}$, there is an element x such that $\{a,b\}\le x\le\{c,d\}$. (Equivalently, for any finite sets ...
6
votes
0answers
121 views

“Double convolution” with the Mobius function on a poset

Let $f$ and $g$ be arbitrary (say integer-valued) functions on some poset $P$, and say $\mu$ is the Mobius function of $P$. I'm studying a quantity that's a sort of "double convolution" of $f$ and $g$ ...
9
votes
2answers
248 views

How exactly does Schützenberger promotion relate to Striker-Williams promotion?

Schützenberger promotion, studied (for example) in Richard Stanley, Promotion and Evacuation, 2009, is a permutation of the set of all linear extensions of a finite poset. Since one can identify the ...
22
votes
2answers
1k views

Does this poset have a unique minimal element?

Recently I have been thinking about the following poset: the underlying set is $\mathcal{AFT}$ consisting of all (finite) automorphism-free undirected trees (with at least one edge to exclude the ...
7
votes
1answer
235 views

Which of these relations on partial orders allows us to identify forcing equivalence?

Background This question was inspired by Justin Palumbo's excellent question Cantor Bernstein for notions of forcing. In his question, Justin considers a relation $\lhd$ on partial orders (defined ...
3
votes
0answers
152 views

When can we determine an $f$-vector or rank-generating function from its unordered list of coefficients?

Let $f_i$ be the number of $i$-dimensional faces in a $d$-dimensional simplicial complex $\Delta $. Recall that the $f$-vector of $\Delta $ is the vector $(f_{-1},f_0,f_1,\dots ,f_d)$ where ...
10
votes
1answer
279 views

When is the derived category of representations of a finite poset equivalent to its opposite?

If I have a finite partially ordered set $K$, I can look at its derived category of finite dimensional representations $D(K)$. Note that $D(K^{op}) \simeq D(K)^{op}$ by linear duality. But when do ...
2
votes
2answers
299 views

Characterizing Posets by Functions Into Natural Numbers

Let $P$ be a poset and denote by $Hom(P, \mathbb N)$ the set of all monotone functions from $P$ to natural numbers $\mathbb N$. Under what conditions on $P$ Is it possible to recover the order on $P$ ...
14
votes
1answer
474 views

Bruhat order and the Robinson-Schensted correspondence

The Robinson-Schensted correspondence is a bijection between elements of the symmetric group $S_n$ and pairs of standard tableaux of the same shape. The symmetric group is partially ordered by the ...
3
votes
1answer
254 views

Grading a non-graded poset as squeezed as possible

Here is a curiosity question (motivated by the recent revamp of ranked-poset routines in Sage). Let $P$ be a finite poset. We look for a family $\left(a_p\right)_{p\in P}$ of real numbers summing up ...
14
votes
3answers
1k views

Banach and Knaster-Tarski fixed point theorems — are they related?

It there any known way of obtaining the Banach fixed-point theorem from the Tarski fixed-point theorem or vice-versa?
13
votes
6answers
1k views

The category of posets

I am trying to teach myself category theory and, as a begginer, I am looking for examples that I have a hands-on experience with. Almost every introductory text in category theory contains following ...
8
votes
1answer
407 views

Ordered sum of posets

Let $I$ be a poset and for any $i$ let $P_i$ be a poset. Let $P$ be the sum over $I$ of the sets $P_i$, and let $<_P$ be the relation defined on $P$ by $q<_Pr$ iff $q$ and $r$ are members of the ...
9
votes
1answer
298 views

Set of maximal subfields not containing particular elements.

Instead of extending a field, by adjoining a new element, consider what happens if we remove an element or elements. This started as a question on math.SE Field reductions where Pete L. Clark ...
10
votes
0answers
342 views

Asymptotic growth of antichains in divisibility posets

The following question is inspired by a problem that Erdős used to ask epsilons. It asks to prove that if one chooses a subset of $\lbrace 1,\dots,n\rbrace$ with more than ...
0
votes
3answers
664 views

Well-ordered cofinal subsets [closed]

Let $(P, \leq)$ be a total ordering (some of you prefer the name linear order). Can we find a subset $R\subseteq P$ which is well ordered (with respect to $\leq\upharpoonright R$) and cofinal in $P$, ...
2
votes
1answer
261 views

What are $n$-poset?

Yesterday I was wandering for the $n$-lab and I've found the definition of $n$-poset. Following this post it seems that a $n$-poset should be a $(n,n+1)$-category. Now an $(n,r)$-category should be a ...
10
votes
1answer
620 views

What is the size of a largest antichain in this poset?

Let $[n]:=\lbrace 1, \dots, n \rbrace$. We define a partial ordering on the set of subsets of $[n]$ as follows. We say that $X \preceq Y$ if there is an injective map $f:X \to Y$ such that $x \leq ...
0
votes
0answers
105 views

A search for optimal order ideals

At the behest of Gerhard Paseman I'll describe the problem that I alluded to in name for a partial order. Let $M = M(\infty)$ denote the set of all finite subsets of the positive integers ...
7
votes
0answers
389 views

The name for a partial order

In a recent paper of mine, my co-authors found that a partial order that we were using was contained in a paper by Kundgen. In it, he called it "right-shifted partial order". I was curious, and found ...
1
vote
1answer
714 views

What is the number of maximal antichain in a poset?

This is a topic I am recently working on. Given a poset, how many different antichains are there? I find little literature on it. And I am interested whether there is a closed formula, or a tight ...
7
votes
2answers
356 views

A sequence of generic filters that does not come from an iteration

Fix a countable transitive model $M$ of ZFC. In my answer to this question I indicated that there are forcing iterations $((Q_\alpha:\alpha\leq\omega),(\dot P_\alpha:\alpha<\omega))$ in $M$ and ...
6
votes
1answer
343 views

Posets of cosets and contractibility

For this question let $G$ be a group, perhaps infinite, and let $H_i$ for $i\in I$ be a (finite) family of subgroups closed under taking intersections. I am interested in the coset poset ...
3
votes
1answer
269 views

A compactness property of posets

Consider a poset $P$ and suppose that every finite subset admits a supremum. Call an ideal $I$ of $P$ minimal infinite if it is infinite and every ideal properly contained in $I$ is finite. I am ...
0
votes
0answers
169 views

Ordering labellings of a fixed poset.

Let $\{A_1,\ldots, A_m\}$ be a family of sets and $I=\{1, \ldots, m\}$. Assume for any $J\subset I$, $B_J=\bigcap_{i\in J}A_j$ satisfies $1\leq |B_J| \leq m-1$ as long as $|J|>1$. We define a ...
6
votes
2answers
748 views

Is every poset the poset of prime ideals of a ring?

The answer to this question, as it is, is trivially false, for one necessary condition is the existence of maximal element(s), i.e., maximal ideals exist and are prime. My question was inspired from ...
5
votes
1answer
329 views

Minimum set cardinality for a given partially ordered set

Let S be a finite set of cardinality k. I consider subsets of S that I order by set inclusion. For any given k, this defines the partially ordered set S_k. To a given partially ordered set P, I ...
8
votes
2answers
489 views

Statements forced by one condition of a poset, but not the whole thing

In order to get the relative consistency of some statement, it suffices to find a notion of forcing, and a condition $p$ in that forcing, such that $p$ forces the desired statement. It seems to be ...
4
votes
1answer
294 views

On the barycentric subdivision of a poset

Hi everybody, I'm interested in the barycentric subdivision of a poset $P$, defined as the face poset of the corresponding order complex $\mathcal F(\Delta(P))$ (or alternatively, the poset of chains ...
3
votes
1answer
152 views

Decomposing a poset into directed subposets

Let us say that a poset $P$ is $\mathbf{\kappa}$-directed iff every collection of fewer than $\kappa$-many elements in $P$ has an upper bound in $P$. $P$ has the $\mathbf{\kappa}$ chain condition iff ...
8
votes
1answer
315 views

Decomposing posets into countably many chains

A conjecture of Galvin's is that the following is possible (which I take to mean that the consistency of the following can be proven relative to the consistency of something like ZFC, or ZFC plus some ...
7
votes
1answer
482 views

Does ⋄ generate all De Morgan algebras?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM) This question is about De Morgan algebras (see also Wikipedia), which are something like Boolean algebras, but with a different weaker ...