Skip to main content

Questions tagged [posets]

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$), antisymmetric ($x\leq y$ and $y\leq x$ implies $x=y$), and transitive ($x\leq y$ and $y\leq z$ implies $x \leq z$).

Filter by
Sorted by
Tagged with
2 votes
1 answer
241 views

Starting point. I was toying around with the following question: If $A, B\subseteq [0,1]$ with $A\cup B = [0,1]$, does $[0,1]$ order-embed into at least one of $A, B$? Quickly I focused on $A = [0,1]\...
Dominic van der Zypen's user avatar
5 votes
1 answer
208 views

A chain $C$ in a poset $P$ with partial ordering $\le$ is a subset such that for all $c,d\in C$, either $c\le d$ or $d\le c$. A chain is maximal if it is not a proper subset of any other chain. A ...
Tri's user avatar
  • 1,979
1 vote
0 answers
470 views

I recently came across a recent paper presenting a proof of Zorn’s Lemma that seems very short and elementary. I found it interesting because the proof does not use transfinite induction or any set ...
Ethan Parker's user avatar
8 votes
1 answer
215 views

Are there some general theorems which govern global structure of posets arising as posets of epimorphisms out of a (unital, associative) ring? One may note that it is always a lattice — it is ...
Denis T's user avatar
  • 6,030
0 votes
1 answer
184 views

I am looking for examples of additively idempotent semirings (which are always join semilattices) that do not have an underlying lattice structure, i.e. either meets do not exist or exist outside the ...
Unshi's user avatar
  • 1
0 votes
2 answers
88 views

On a lattice $\mathcal{L}$, I have a submodular, monotone, real-valued function $\rho$. Submodularity means it satisfies the inequality $$\rho(x)+\rho(y)\ge \rho(x\wedge y)+\rho(x\vee y)$$ for all $x, ...
Bumblebee's user avatar
  • 1,203
2 votes
1 answer
145 views

Consider any finite commutative semigroup $S$. Say that $x \leq y$ iff $x = y$ or $xy = y$. This is a partial order on $S$: the only nontrivial property to check is that $x \leq y$ and $y \leq z$ ...
Fabius Wiesner's user avatar
7 votes
1 answer
388 views

If $(P,\leq)$ is a poset, we say that $C\subseteq P$ is a chain if $a\leq b$ or $b\leq a$ for all $a, b\in C$. Moreover, $A \subseteq P$ is an antichain if $a\not\leq b$ and $b\not\leq a$ whenever $a,...
Dominic van der Zypen's user avatar
18 votes
3 answers
887 views

Let ${\cal P}(\omega)$ denote the power-set of $\omega$. We order it by set inclusion $\subseteq$ and say that ${\cal C}\subseteq {\cal P}(\omega)$ is a chain if for all $A, B\in {\cal C}$ we have $A\...
Dominic van der Zypen's user avatar
2 votes
1 answer
303 views

Let $k\in \mathbb{N}_+$, let $\mathcal{P}_k$ denote the set of directed graphs obtained as Hasse diagrams of posets on $k$ vertices, and let $\mathcal{Dir}_k$ denote the set of connected directed ...
AB_IM's user avatar
  • 4,842
7 votes
0 answers
190 views

Question 1: Is there a classification of finite ordered semigroups (or monoids) with $n$ elements for small $n$? Is there computer algebra software that can generate those algebraic objects? (Here I ...
Mare's user avatar
  • 28.2k
1 vote
0 answers
119 views

For a poset $P$, let $\widetilde P$ be the poset with each element replaced by two twins: to be precise, $\widetilde P:=\{p_0,p_1\mid p\in P\}$ where for $p\in P$, $p_0$ and $p_1$ are incomparable in $...
Tri's user avatar
  • 1,979
4 votes
0 answers
142 views

For a posets $P$ and $Q$ with partial orderings $\le_P$ and $\le_Q$, a function $f:P\to Q$ is order-preserving if for all $p,p'\in P$, $p\le_P p'$ implies $f(p)\le_Q f(p')$. The posets are order-...
Tri's user avatar
  • 1,979
3 votes
1 answer
255 views

Let $L_n$ be the free distributive lattice on $n$-elements, which can be defined for example as the distributive lattice of order ideals of the Boolean lattice an $n$-set. The incidence algebra $A_n=...
Mare's user avatar
  • 28.2k
1 vote
0 answers
79 views

It is an elementary fact, due to P. Hall in 1933, that the number of subgroups of order $k$ of a $p$-group of order $p^n$, $0\leq k\leq n$, is congruent to $1$ modulo $p$. A. Kulakoff, Math. Ann. 104 (...
Richard Stanley's user avatar
21 votes
1 answer
662 views

Say a Hausdorff space $X$ is a topological tree if $X$ is uniquely arcwise connected, $X$ is locally arcwise connected, $X$ does not contain a copy of the long line. Question: Is every topological ...
Jeremy Brazas's user avatar
4 votes
1 answer
175 views

Let $L$ be a finite lattice. Say $L$ has the unique factorisation property, if every element $x$ of $L$ is the join of a unique antichain of join-irreducible elements (or maybe one should use join-...
Mare's user avatar
  • 28.2k
7 votes
1 answer
404 views

I'm wondering if $\mathcal{Pos}$, the category of posets, with arrows being monotone mappings between them, is Locally Cartesian Closed? If so, is there a reference with a proof of this? If not, is ...
Joey Eremondi's user avatar
6 votes
0 answers
188 views

Let ${M} = \{M_1, M_2, \dots, M_N\}$ be the set of all noncrossing perfect matchings on a circle with $2n$ labeled points arranged clockwise. Then $N = \frac{1}{n+1} \binom{2n}{n}$ is the $n$-th ...
Zhaopeng Ding's user avatar
5 votes
0 answers
181 views

Let $L$ be a finite distributive lattice, and let $K$ be a field. Consider the binomial ideal $I_L$ in $S_L=K[x_\alpha:\alpha \in L]$ generated by $x_{\alpha}x_{\beta} -x_{\alpha \wedge \beta}x_{\...
Chess's user avatar
  • 1,365
4 votes
1 answer
335 views

I have the following question. Let $\{C_i\}_{i\in I}$ be an inverse system of complexes with members in some abelian category $\mathcal{A}$ where all small limits exist + some technical conditions. ...
abcd1234's user avatar
8 votes
1 answer
435 views

A multiplicative lattice is a complete lattice $(L, \leq)$ that is endowed with an associative, commutative multiplication that distributes over arbitrary joins and has $1$, the top element of $L$, as ...
Dominic van der Zypen's user avatar
4 votes
1 answer
331 views

In the corollary 3.4 of Ariotta's paper, it's been mentioned that to define a functor from $\mathbb{Z}$ to an $\infty$-category $\mathcal{C}$, it is sufficient to specify the functor on objects and ...
Arash Karimi's user avatar
1 vote
0 answers
179 views

Given a (finite) poset $(P,\leq)$, we can construct the poset $(\mathcal{D}, \subseteq)$ isomorphic to $P$ simply by letting $\mathcal{D}$ be the collection of all "descendant sets" i.e. $\...
Anna Lindeberg's user avatar
3 votes
1 answer
228 views

I would like to find an example of a lattice $L$ with the following properties: it has $q$ coatoms $x_i$, $1 \le i \le q$; for each coatom $x_i$ let $Y_i = \{y \in L :y \le x_i\} = (x_i]$: it is ...
Fabius Wiesner's user avatar
2 votes
1 answer
251 views

Consider a finite lattice $L$ such that each atom has at least $|L|/2$ elements greater than or equal to it. It can be for example a boolean lattice or the following lattice: In the boolean lattice ...
Fabius Wiesner's user avatar
9 votes
0 answers
305 views

An interval order (always assumed to be finite) is a finite poset $P$ that is isomorphic to a set $\{[a_1,b_1],\dots,[a_n,b_n]\}$ of closed intervals on the real line with the ordering $[a_i,b_i]<[...
Richard Stanley's user avatar
0 votes
1 answer
174 views

The post is motivated by the following exercise in Edition 5 of Miklos Bona's "A walk through combinatorics". Exercise 11.28 Let $n>2k$ be positive integers, and let $\binom{[n]}{k}$ ...
Yifeng Huang's user avatar
7 votes
1 answer
255 views

Apologies for the somewhat vague question. Given an abstract simplicial complex $\Delta$, I can create a poset $P$ from $\Delta$: the face poset, where we order the faces of $\Delta$ by containment. ...
Sam Hopkins's user avatar
  • 26k
20 votes
1 answer
1k views

Fix integers $k, m \geq 0$. For each $r=0,1,\ldots,k+m+1$, define $$ a_{k,m,r} = \sum_{j=0}^{\min(k,m)} \binom{k}{j}\binom{m}{j}\sum_{\substack{S \subseteq \{-j,-j+1,\ldots,k+m-j\},\\\#S=k+m+1-r}}\...
Sam Hopkins's user avatar
  • 26k
0 votes
0 answers
73 views

Let $x$ be an element in a complete partial order. What's the accepted terminology, if any, for the following? Any $y\ge x$ such there does not exist any $z\ge y$. A greatest upper bound for $x$, ...
PythonAteMyHamster's user avatar
6 votes
0 answers
159 views

Lately I've been trying to gather more examples of centres and traces, hoping to write a comprehensive treatment on these on Clowder. Another example I've been trying to understand is the following. ...
Emily's user avatar
  • 12.8k
4 votes
1 answer
245 views

If $(P,\leq)$ is a poset and $x\in X$, we let $\downarrow x = \{p\in P: p \leq x\}$, and $\uparrow x$ is defined dually. The collection $$\Big\{P\setminus (\downarrow x): x\in P\Big\} \cup \Big\{P\...
Dominic van der Zypen's user avatar
3 votes
0 answers
367 views

$\newcommand{\Tr}{\mathrm{Tr}}$Lately I've been trying to gather more examples of centres and traces, hoping to write a comprehensive treatment on those on Clowder. One of the examples I've been ...
Emily's user avatar
  • 12.8k
6 votes
1 answer
422 views

Let $X$ be a set and let $(Y_i)_{i \in I}$ be a family of (not necessarily pairwise disjoint) subsets covering $X$, $$ X = \bigcup_{i\in I} Y_i.$$ For any subset $J \subseteq I$, we then define $$ Y_J ...
Matthias Ludewig's user avatar
3 votes
0 answers
150 views

Let $(P,\leq)$ be a partially ordered set. Assume that $(P,\leq)$ is well-founded. Then the levels of the poset are well-defined: $L_{0}$ is the set of minimal elements in $P$, and whenever $\mu$ is ...
Dillon M's user avatar
  • 520
11 votes
2 answers
973 views

Let $(P,\le_P)$ and $(Q,\le_Q)$ be posets. A function $f:Q\to P$ is order-preserving if whenever $q,q'\in Q$ and $q\le_Q q'$, we have $f(q)\le_P f(q')$. If there is a bijective order-preserving map ...
Tri's user avatar
  • 1,979
4 votes
1 answer
224 views

If we remove an edge from the Hasse diagram of a finite lattice, as long as any vertex maintain at least one upward edge and at least one downward edge, do we still always have a lattice from the ...
Fabius Wiesner's user avatar
5 votes
0 answers
148 views

Suppose that $P$ is a poset, $x$ and $y$ are two minimal elements of $P$, and that $e(P)$ denotes the number of linear extensions of $P$. Chan and Pak use their recent combinatorial atlas technology ...
Gjergji Zaimi's user avatar
8 votes
0 answers
242 views

To every poset $P$ it is possible to associate its order complex $\Delta(P)$. The faces of $\Delta(P)$ correspond to chains of elements in $P$. An Eulerian poset is a graded poset such that all of its ...
Luis Ferroni's user avatar
  • 2,288
2 votes
0 answers
94 views

Let $(V,Q)$ be a pair, with $V=\mathbb{F}_2^{2n}$ ($n\geq 2$) and $Q$ a nondegenerate quadratic form on $V.$ We consider the poset $\mathcal{P}_n$ of affine totally isotropic (with respect to $Q$) ...
Antoine's user avatar
  • 287
3 votes
1 answer
142 views

This a follow up question of Chain components and posets. Let $X$ be a compact metric space and $R\subset X^2$ a closed, transitive relation. Denote by $|R|=\{x\in X: xR x\}$ the diagonal of $R$. The ...
Marco Farotti's user avatar
3 votes
1 answer
355 views

Let $(X,\leq)$ be a poset, $X=\{x_1,x_2,\dots,x_n\}$. Preference matrix $\textbf{P}=[p_{ij}]$ (which is known and fixed), satisfies $p_{ij}=1-p_{ji},p_{ii}=\frac{1}{2}$, and $$\forall i \neq j, x_i \...
Mixi Andrew's user avatar
7 votes
2 answers
631 views

If finite lattices $L_1,L_2$ have Hasse diagrams that are isomorphic as undirected graphs, must $L_1$ and $L_2$ be isomorphic? NOTE: Sam Hopkins points out that the answer is “no” because there are ...
James Propp's user avatar
  • 20.1k
2 votes
1 answer
513 views

Take a countably infinite set $S$, say $\mathbb N$. Is it possible for there to be an antichain in $\mathcal P(S)$ (with the inclusion ordering) of continuum cardinality?
E. Z. L.'s user avatar
0 votes
0 answers
93 views

$$ \begin{array}{cccccccccccc} & & \text{A} \\ & \swarrow & & \searrow \\ \text{B} & & & & \text{C} \\ & \searrow & & \swarrow \\ \downarrow & &...
Michael Hardy's user avatar
3 votes
1 answer
156 views

Are there non-isomorphic $T_0$-spaces $(X_i, \tau_i)$ for $i = 1,2$ such that $\tau_1 \cong \tau_2$ when considered as partially ordered sets?
Dominic van der Zypen's user avatar
3 votes
1 answer
201 views

This is perhaps a basic question, but I couldn't find a reference. Let $P = (X,\leq)$ be a poset. Given a probability measure $\mu$ on $P$ (with respect to the Borel $\sigma$-algebra generated by sets ...
Roger Van Peski's user avatar
1 vote
0 answers
98 views

In set-theoretic trees, we have the binary relation $<_T$ (which defines the "ancestor-descendant" ordering). This relation is partial, as children are incomparable in that ordering. ...
mathoverflow-guest's user avatar
2 votes
1 answer
173 views

For definitions, see Section 1 of Chapter 3 of Richard Stanley, Enumerative Combinatorics, Volume I (second edition). Also see Section 8 of Chapter II of Garrett Birkhoff, Lattice Theory (third ...
Tri's user avatar
  • 1,979

1
2 3 4 5
9