English
Related papers

Related papers: Stirling Posets

200 papers

We define piecewise-linear and birational analogues of the toggle-involutions on order ideals of posets studied by Striker and Williams and use them to define corresponding analogues of rowmotion and promotion that share many of the…

Combinatorics · Mathematics 2018-09-06 David Einstein , James Propp

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

Combinatorics · Mathematics 2023-06-22 János Balogh , Cosmin Bonchiş , Diana Diniş , Gabriel Istrate , Ioan Todinca

We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.

Combinatorics · Mathematics 2015-06-10 Oleg Ogievetsky , Senya Shlosman

Let $I_n$ be the set of involutions in the symmetric group $S_n$, and for $A \subseteq \{0,1,\ldots,n\}$, let \[ F_n^A=\{\sigma \in I_n \mid \text{$\sigma$ has $a$ fixed points for some $a \in A$}\}. \] We give a complete characterisation…

Combinatorics · Mathematics 2015-02-13 Mikael Hansson

We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…

Combinatorics · Mathematics 2025-12-08 Jérémie Bettinelli , Dimitri Korkotashvili

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

Combinatorics · Mathematics 2008-02-12 Hansheng Diao

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…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…

Rings and Algebras · Mathematics 2022-08-23 Paolo Lipparini

For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.

We study two different objects attached to an arbitrary quadrangulation of a regular polygon. The first one is a poset, closely related to the Stokes polytopes introduced by Baryshnikov. The second one is a set of some paths configurations…

Representation Theory · Mathematics 2015-05-25 Frédéric Chapoton

In this paper, we show that the Bruhat order on any sect of a symmetric variety of type $AIII$ is lexicographically shellable. Our proof proceeds from a description of these posets as rook placements in a partition shape which fits in a $p…

Combinatorics · Mathematics 2025-05-27 Aram Bingham , Néstor Díaz Morera

In 2022, Defant and Kravitz introduced extended promotion (denoted $\partial$), a map that acts on the set of labelings of a poset. Extended promotion is a generalization of Sch\"{u}tzenberger's promotion operator, a well-studied map that…

Combinatorics · Mathematics 2022-08-19 Eliot Hodges

Given an ordered set partition, when one insert a number of bars in-between the blocks of the ordered set partition the result is a barred preferential arrangement. In this study, using the notion of barred preferential arrangements we…

Combinatorics · Mathematics 2025-10-24 Funani Sinethemba , Ndiweni Odilo , Nkonkobe Sithembele

A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…

Combinatorics · Mathematics 2023-08-21 Xuexing Lu

We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different…

Combinatorics · Mathematics 2023-06-02 Ming Xiao

We study the so-called closed and splitting subsemimodules and submodules of a given semimodule or module, respectively. We describe lattices of subsemimodules and of closed subsemimodules and posets of splitting subsemimodules and…

Rings and Algebras · Mathematics 2019-07-16 Ivan Chajda , Helmut Länger

We generalize the concept of combinatorial nested set complexes to posets and exhibit the topological relationship between the arising nested set complexes and the order complex of the underlying poset. In particular, a sufficient condition…

Combinatorics · Mathematics 2008-02-04 Juliane Lehmann

We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these…

Number Theory · Mathematics 2014-12-12 Chris Jennings-Shaffer

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Combinatorics · Mathematics 2015-03-03 Thomas Gobet , Nathan Williams

We consider the restrictions of Shi arrangements to Weyl cones, their relations to antichains in the root poset, and their intersection posets. For any Weyl cone, we provide bijections between regions, flats intersecting the cone, and…

Combinatorics · Mathematics 2025-10-14 Galen Dorpalen-Barry , Christian Stump