Related papers: Rowmotion and Increasing Labeling Promotion
Given a Hamiltonian action of a proper symplectic groupoid (for instance, a Hamiltonian action of a compact Lie group), we show that the transverse momentum map admits a natural constant rank stratification. To this end, we construct a…
By using a lattice characterization of continuous projections defined on a topological vector space E arising from a dual pair, we determine the automorphism group of their orthomodular poset Proj(E) by means of automorphisms and…
Partially ordered groups, also known as po-groups, are groups with a compatible partial order. Results from M.I. Zajceva and H.-H. Teh are combined in order to provide a full characterisation of linear order extensions of a given order on a…
Birational toggling on Gelfand-Tsetlin patterns appeared first in the study of geometric crystals and geometric Robinson-Schensted-Knuth correspondence. Based on these birational toggle relations, Einstein and Propp introduced a discrete…
For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…
Nearly all autonomous robotic systems use some form of motion planning to compute reference motions through their environment. An increasing use of autonomous robots in a broad range of applications creates a need for efficient, general…
We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…
We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…
A fence is a poset with elements F = {x_1, x_2, ..., x_n} and covers x_1 < x_2 < ... < x_a > x_{a+1} > ... > x_b < x_{b+1} < ... where a, b, ... are positive integers. We investigate rowmotion on antichains and ideals of F. In particular,…
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…
In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…
We analyse domination between invariant types in o-minimal expansions of ordered groups, showing that the domination poset decomposes as the direct product of two posets: the domination poset of an o-minimal expansion of a real closed…
We introduce (continuous) partial category actions on sets (topological spaces) and show that each such action admits a universal globalization. Thereby, we obtain a simultaneous generalization of corresponding results for groups, by…
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…
Relaxation labelling is an optimization technique used in many fields to solve constraint satisfaction problems. The algorithm finds a combination of values for a set of variables such that satisfies -to the maximum possible degree- a set…