**2**

votes

**1**answer

327 views

### When is the homomorphism poset between posets a lattice?

Let $P,Q$ be partially ordered sets (posets). We consider the set $\text{Hom}(P,Q)$ of order-preserving functions $f:P\to Q$. There is a natural ordering relation on $\text{Hom}(P,Q)$ given by $f\leq ...

**12**

votes

**1**answer

320 views

### Fastest algorithm to compute the width of a poset

An colleague recently came to me with a problem concerning the scheduling of tasks in the presence of constraints (of the kind: task $x$ can't begin until task $y$ has been completed). It turned out ...

**1**

vote

**1**answer

182 views

### Does the category of posets have pushouts and pullbacks? [duplicate]

Let $\mathbf{Poset}$ be the category of partially ordered sets with order-preserving maps. Does $\mathbf{Poset}$ have both pushouts and pullbacks?

**1**

vote

**2**answers

192 views

### Question on Posets and open sets [closed]

i'm sorry if my question is really trivial but this one is really bugging me out..
So let's have a partially ordered set $I$ with the topology in which the open sets are the increasing ones: $i\in U$ ...

**2**

votes

**0**answers

57 views

### Computing basis of a lower set given basis of complementary upper set

In a poset $P$, $U\subseteq P$ is an upper set when for all $x\in U$, we have $y\ge x$ implies $y\in U$. Any subset of $P$ generates an upper set, and the basis of an upper set $U$ is the smallest ...

**4**

votes

**3**answers

333 views

### Classification of countable posets?

Is there a classification of countable posets where between each two comparable elements there is a third element between them?

**8**

votes

**0**answers

164 views

### Fixed points and universal maps for posets

In a recent post about f.p.p. for poset products, @M.Mirabi brought back an old-standing problem about the fixed point property of the product of two arbitrary posets which already enjoy the fixed ...

**34**

votes

**3**answers

1k views

### Is the fixed point property for posets preserved by products?

Recall that a partially ordered set (poset) $P$ has the fixed point property (FPP) if any order preserving function $f:P\longrightarrow P$ has a fixed point.
Theorem. Suppose $P$ and $Q$ are posets ...

**0**

votes

**2**answers

116 views

### a dcpo seen as a category: when does a dcpo map induce a functor with an adjoint?

Take two posets $A, B$ (partially ordered sets). Now consider these posets to be categories $Cat(A), Cat(B)$ respectively. Consider a map from $A$ to $B$, $f: A \rightarrow B$. This can be seen as ...

**3**

votes

**2**answers

189 views

### Directed subposet of a poset containing the minimal elements

The following appears naturally in a certain context:
Let $P$ be a graded partially ordered set. Let $M$ be the subset of minimal elements of $P$. Define subsets $E_i$ inductively as follows: First, ...

**7**

votes

**1**answer

310 views

### The category of categories and adjunctions

What is known about the category that has small categories as objects and adjunctions as morphisms? Obviously, it has neither terminal nor initial objects. But what about other kinds of limits? Are ...

**10**

votes

**2**answers

312 views

### Principal Order Ideals in the Weak Bruhat Order

Let $\sigma\in S_n$ be a permutation on $n$ elements, and $\mathrm{Inv}(\sigma):=\{(i,j) : 1\leq i<j\leq n\text{ and }\sigma(i)>\sigma(j)\}$ be its set of inversions. In the weak order on ...

**1**

vote

**1**answer

103 views

### Krull dimension of dense extensions

Let $A$ be a boolean algebra and let $B\leq A$ be a boolean sub-algebra which is dense (for all $0\neq a\in A$, there is a $0\neq b\in B$ such that $b\leq a$). We suppose also that $B$, as a partially ...

**2**

votes

**1**answer

139 views

### Galois Connections: algorithmic generation

Given two finite posets $P,Q$, is it known any algorithm to count and/or generate every Galois Connection between $P$ and $Q$ ?
I'm looking for references about this problem.

**2**

votes

**1**answer

236 views

### Maximal number of antichains of a connected poset

Assume we have a connected poset $P$ of $n$ elements, I am searching to know what is the maximal number of antichains such a poset can have?
$2^n$ is obviously an upper bound, and my feeling is that ...

**3**

votes

**1**answer

120 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 ...

**9**

votes

**1**answer

565 views

### Order homomorphism functions on $\omega_1$

Let $\omega_1$ be the first uncountable ordinal,
same as the set of all countable ordinals.
Let $F$ be the set of all functions
$f$ from $\omega_1$ minus singleton $0$ into $\omega_1$ that
are (a) ...

**4**

votes

**1**answer

200 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 ...

**2**

votes

**2**answers

151 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 ...

**19**

votes

**0**answers

309 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$.
...

**1**

vote

**0**answers

84 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 ...

**7**

votes

**0**answers

167 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: i....

**1**

vote

**0**answers

113 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, i....

**1**

vote

**1**answer

98 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

**1**answer

123 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 ...

**2**

votes

**1**answer

155 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 ...

**6**

votes

**1**answer

233 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

**1**answer

369 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 $1,\dots,n$...

**10**

votes

**2**answers

372 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

**1**answer

448 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 $A\...

**6**

votes

**0**answers

166 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

**2**answers

477 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

**2**answers

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

**1**answer

284 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 ...

**4**

votes

**0**answers

174 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 $f_{-1}=...

**3**

votes

**4**answers

563 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

**0**answers

143 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 ...

**10**

votes

**1**answer

346 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

**3**answers

388 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$ ...

**17**

votes

**1**answer

678 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

**1**answer

275 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 ...

**17**

votes

**6**answers

3k 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 ...

**11**

votes

**0**answers

397 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 $\lfloor\frac{n+1}{2}\rfloor$...

**0**

votes

**3**answers

1k 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

**1**answer

291 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

**1**answer

814 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

**0**answers

108 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 $\mathbb{N}$...

**7**

votes

**0**answers

485 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

**1**answer

1k 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 ...

**8**

votes

**1**answer

508 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 ...