Standard paths in another composition poset (Q1773173)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Standard paths in another composition poset |
scientific article |
Statements
Standard paths in another composition poset (English)
0 references
25 April 2005
0 references
Summary: \textit{F. Bergeron}, \textit{M. Bousquet-Mélou} and \textit{S. Duluq} [Ann. Sci. Math. Qué. 19, 139--151 (1995; Zbl 0845.06003)] enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition \(\mu\) covers another composition \(\lambda\) if \(\mu\) can be obtained from \(\lambda\) by adding 1 to one of the parts of \(\lambda\), or by inserting a part of size 1 into \(\lambda\). We employ the methods they developed in order to study the same problem for the following poset, which is of interest because of its relation to non-commutative term orders: the underlying set is the same, but \(\mu\) covers \(\lambda\) if \(\mu\) can be obtained from \(\lambda\) by adding 1 to one of the parts of \(\lambda\), or by inserting a part of size 1 at the left or at the right of \(\lambda\). We calculate generating functions for standard paths of fixed width and for standard paths of height \(\leq 2\).
0 references
enumeration of paths
0 references
composition posets
0 references
Hasse diagram
0 references
standard paths
0 references