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

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

**9**

votes

**0**answers

82 views

### Ideals in strong Bruhat order

Recall that a (lower) ideal in a poset $(P, \le)$ is a subset $I\subset P$ such that $x\in I \Rightarrow y\in I$ for all $y\le x$. In am interested in ideals in finite Coxeter groups $W$ equipped ...

**9**

votes

**0**answers

120 views

### A family of posets

Consider the family of all (finite) posets that can be obtained by repeatedly applying one of the following three operations (starting e.g. with the empty poset):
(O1) Disjoint union of one or more ...

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

**7**

votes

**0**answers

236 views

### Pattern Avoidance in Poset Permutations

I am not sure if it is appropriate to use MathOverflow to publicize a conjecture, but I think this is an interesting question and I have no real ideas of how to solve it.
A permutation on a $n$-...

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

**7**

votes

**0**answers

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

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

**5**

votes

**0**answers

81 views

### Minimal Hausdorff topologies compatible with a bunch of functions

Let $X$ be an infinite set, let ${\cal F}$ be a set of functions $f: X\to X$. We say that a topology $\tau$ is compatible with ${\cal F}$ if every $f\in {\cal F}$ is a continuous function $f:(X, \tau)\...

**4**

votes

**0**answers

82 views

### Face structures of chain polytopes

For a finite poset $P$ the chain polytope $\mathscr C(P)\subset\mathbb{R}^P$ consists of such $g$ that $g(p)\ge 0$ for all $p\in P$ and $$g(p_1)+\ldots+g(p_n)\le 1$$ for any chain $p_1<\ldots<...

**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

**0**answers

45 views

### Matroid Representation of the Antichains of a Poset

Introduction
I am studying a problem in which the antichains of a poset are of key importance. They are naturally geometrically embedded as vectors in the space $\mathbb{R}^P$, where $P$ is the poset,...

**3**

votes

**0**answers

83 views

### Weighted maximal number of disjoint singly-generated ideals in the divisibility poset for $\{1,2,\ldots,n\}$

In the mathoverflow question here the asymptotic growth of antichains in the divisibility poset ${\cal P}_n$ of the set of natural numbers $\{1,\ldots,n\}$ is considered. I have a somewhat dual ...

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

**3**

votes

**0**answers

396 views

### a poset with small “cycles”

(a followup to this recent question)
I noticed the following curious property of a poset (which I strongly believe to be a lattice, I'm still trying to prove that...):
Suppose that $z$ is covered by ...

**2**

votes

**0**answers

44 views

### Decidability of first order theory of subclasses of posets

Is the first order theory of finite posets known to be undecidable?
Does anyone know a survey about such results?

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

**2**

votes

**0**answers

126 views

### non-degenarete tools to calculate a derived functor on a model category which is a poset?

Are there theorems (esp. computational tools) on model categories which survive and do not trivialise when its underlying category is a (quasi-)poset ? Are there tools
that may help to calculate a ...

**1**

vote

**0**answers

32 views

### Form of binary function over poset that is monotone over first and antitone over second argument

if I have a partially ordered set $P$, and I have a function $f: P \times P \to \mathbb{R}$ that is monotone over the first and antitone over the second argument, i.e. for any $a,b,c \in P$
$a ≤ b \...

**1**

vote

**0**answers

73 views

### reconstructing a linear order corrupted by noise

Suppose we have a partial order (efficiently computable), $\leq$, on $\mathbb{R}^n$, a set $S \subset \mathbb{R}^n$, and let $\rho$ be the standard Euclidean metric. We want to find a set $S^\prime = ...

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

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

**0**

votes

**0**answers

56 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

57 views

### Quick way to compute Ehrhart polynomial of Young diagram posets?

Using the hook formula, it is easy to compute the volume of order polytopes obtained from posets with partition shape, since this is the same as the number of linear extensions.
To my knowledge, ...

**0**

votes

**0**answers

67 views

### An equality for the trace of the join of a non-degenerate indecomposable system of projections in a finite factor

Let $M \subset B(H)$ be a finite factor (see for example here p2, or there) with a trace $tr$.
The subset of projections of $M$ is naturally a lattice, noted $(\mathcal{P}(M), \wedge, \vee)$.
A ...

**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}$...

**0**

votes

**0**answers

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