Standard paths in another composition poset
Jan Snellman
Abstract
Bergeron, Bousquet-Melou and Dulucq enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition μcovers another composition λif μcan be obtained from λby adding 1 to one of the parts of λ, or by inserting a part of size 1 into λ. We employ the methods they developed in order to study the same problem for the following poset: the underlying set is the same, but μcovers λif μcan be obtained from λby adding 1 to one of the parts of λ, or by inserting a part of size 1 at the left or at the right of λ. This poset is of interest because of its relation to non-commutative term orders.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell