Let $P$ be a graded poset of rank $r$ and let $\mathbf{c}$ be a $c$-element chain. For an order ideal $I$ of $P \times \mathbf{c}$, its rowmotion $\psi(I)$ is the smallest ideal containing the minimal elements of the complementary filter of $I$. The map $\psi$ defines invertible dynamics on the set of ideals. We say that $P$ has NRP ("not relatively prime") rowmotion if no $\psi$-orbit has cardinality relatively prime to $r+c+1$. In work with R. Patrias (2020), we proved a 1995 conjecture of P. Cameron and D. Fon-Der-Flaass by establishing NRP rowmotion for the product $P = \mathbf{a} \times \mathbf{b}$ of two chains, the poset whose order ideals correspond to the Schubert varieties of a Grassmann variety $\mathrm{Gr}_a(\mathbb{C}^{a+b})$...
We study a birational map associated to any finite poset P. This map is a far-reaching generalizatio...
For a class of posets we establish that the f-vector of the chain polytope dominates the f-vector of...
AbstractWe show how to construct sparse polynomial systems that have non-trivial lower bounds on the...
Let \(P\) be a graded poset of rank \(r\) and let \(\mathbf{c}\) be a \(c\)-element chain. A plane p...
Let \(P\) be a graded poset of rank \(r\) and let \(\mathbf{c}\) be a \(c\)-element chain. A plane p...
Consider a plane partition $P$ as an order ideal in the product $[a] \times [b] \times [c]$ of thre...
Consider a plane partition $P$ as an order ideal in the product $[a] \times [b] \times [c]$ of thre...
One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conject...
We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distribut...
Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspi...
Various authors have studied a natural operation (under various names) on the order ideals (equivale...
Birational rowmotion — a birational map associated to any finite poset P — has been introduced by Ei...
We study a birational map associated to any finite poset P. This map is a far-reaching generalizatio...
The Bruhat posets (arising from Weyl groups) which are lattices are classified. Seshadri's standard ...
Introduced by Kodama and Williams, Bruhat interval polytopes are generalized permutohedra closely co...
We study a birational map associated to any finite poset P. This map is a far-reaching generalizatio...
For a class of posets we establish that the f-vector of the chain polytope dominates the f-vector of...
AbstractWe show how to construct sparse polynomial systems that have non-trivial lower bounds on the...
Let \(P\) be a graded poset of rank \(r\) and let \(\mathbf{c}\) be a \(c\)-element chain. A plane p...
Let \(P\) be a graded poset of rank \(r\) and let \(\mathbf{c}\) be a \(c\)-element chain. A plane p...
Consider a plane partition $P$ as an order ideal in the product $[a] \times [b] \times [c]$ of thre...
Consider a plane partition $P$ as an order ideal in the product $[a] \times [b] \times [c]$ of thre...
One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conject...
We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distribut...
Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspi...
Various authors have studied a natural operation (under various names) on the order ideals (equivale...
Birational rowmotion — a birational map associated to any finite poset P — has been introduced by Ei...
We study a birational map associated to any finite poset P. This map is a far-reaching generalizatio...
The Bruhat posets (arising from Weyl groups) which are lattices are classified. Seshadri's standard ...
Introduced by Kodama and Williams, Bruhat interval polytopes are generalized permutohedra closely co...
We study a birational map associated to any finite poset P. This map is a far-reaching generalizatio...
For a class of posets we establish that the f-vector of the chain polytope dominates the f-vector of...
AbstractWe show how to construct sparse polynomial systems that have non-trivial lower bounds on the...