Rationality of the Möbius function of a composition poset
From MaRDI portal
Publication:2503301
DOI10.1016/j.tcs.2006.03.025zbMath1097.68106arXivmath/0510282MaRDI QIDQ2503301
Bruce E. Sagan, Anders Bjoerner
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0510282
hypergeometric series; generating function; composition; rationality; monoid; automaton; subword order
05A15: Exact enumeration problems, generating functions
68R15: Combinatorics on words
68Q45: Formal languages and automata
06A07: Combinatorics of partially ordered sets
11A25: Arithmetic functions; related numbers; inversion formulas
Related Items
Compositions inside a rectangle and unimodality, Avoidance of partitions of a three-element set, Reconstructing compositions, The Möbius function of a composition poset
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for proving terminating hypergeometric identities
- A holonomic systems approach to special functions identities
- Rationality of the Möbius function of subword order
- Standard paths in another composition poset
- The patterns of permutations
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- The theory of well-quasi-ordering: a frequently discovered concept
- Simple permutations and pattern restricted permutations
- Differential Posets