Related papers: Orbits of antichains in certain root posets

One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice $2^{[n]}$ has size $\Theta\big(\frac{2^n}{\sqrt{n}}\big)$. Motivated by an old problem of Erd\H{o}s…

We relate Reiner, Tenner, and Yong's coincidental down-degree expectations (CDE) property of posets to the minuscule doppelg\"{a}nger pairs studied by Hamaker, Patrias, Pechenik, and Williams. Via this relation, we put forward a series of…

Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…

Motivated by the paper of Axenovich and Walzer [2], we study the Ramsey-type problems on the Boolean lattices. Given posets $P$ and $Q$, we look for the smallest Boolean lattice $\mathcal{B}_N$ such that any coloring on elements of…

Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…

Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a…

Let $V$ be a projective variety defined over a number field $K$, let $S$ be a polarized set of endomorphisms of $V$ all defined over $K$, and let $P\in V(K)$. For each prime $\mathfrak{p}$ of $K$, let $m_{\mathfrak{p}}(S,P)$ denote the…

We study rowmotion dynamics on interval-closed sets. Our first main result proves a simplification of the global definition of interval-closed set rowmotion from (Elder, Lafreni\`ere, McNicholas, Striker, and Welch 2024). We then completely…

Let $n\geqslant 4$ be a natural number, and let $K$ be a set $K\subseteq [n]:={1,2,...,n}$. We study the problem to find the smallest possible size of a maximal family $\mathcal{A}$ of subsets of $[n]$ such that $\mathcal{A}$ contains only…

We study a min-max relation conjectured by Saks and West: For any two posets $P$ and $Q$ the size of a maximum semiantichain and the size of a minimum unichain covering in the product $P\times Q$ are equal. For positive we state conditions…

An action on order ideals of posets considered by Fon-Der-Flaass is analyzed in the case of posets arising from minuscule representations of complex simple Lie algebras. For these minuscule posets, it is shown that the Fon-Der-Flaass action…

We continue our study of the inclusion posets of diagonal $SL(n)$-orbit closures in a product of two partial flag varieties. We prove that, if the diagonal action is of complexity one, then the poset is isomorphic to one of the 28 posets…

Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…

The Hermean average perihelion rate $\dot\omega^\mathrm{2PN}$, calculated to the second post-Newtonian (2PN) order with the Gauss perturbing equations and the osculating Keplerian orbital elements, ranges from $-18$ to $-4$ microarcseconds…

Let $N$ be an integral operator of the form $\bigl(Nu\bigr)(x)=\int_{\mathbb R^c}n(x,x-y)\,u(y)\,dy$ acting in $L_p(\mathbb R^c)$ with a measurable kernel $n$ satisfying the estimate $|n(x,y)|\le\beta(y)$, where $\beta\in L_1$. It is proved…

In this paper we study the reverse mathematics of two theorems by Bonnet about partial orders. These results concern the structure and cardinality of the collection of the initial intervals. The first theorem states that a partial order has…

Let $P(n)$ be the set of all posets with $n$ elements. Let $P^{(j)}(n)$, $1\leq j\leq 2^n,$ be the number of all posets with $n$ elements possessing exactly $j$ antichains. We have determined the numbers $P^{(j)}(7),$ $1\leq j\leq 128$, and…

Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define…

For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from…