On posets of \(m\)-ary words

DOI10.1016/0012-365X(94)00256-IzbMath0851.06001OpenAlexW1967642740MaRDI QIDQ1917485

Ingo Warnke, Gustav Burosch, Jean-Marie Laborde, Hans-Dietrich O. F. Gronau

Publication date: 7 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00256-i

zbMATH Keywords

chainsBoolean latticesalphabetcyclic wordHigman ordersKruskal-Katona posetsposet of naturally ordered subwords

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Combinatorics of partially ordered sets (06A07)

Related Items (1)

Computing orbits of the automorphism group of the subsequence poset \(B_{ m, n }\)

Cites Work

• General methods of sequence comparison
• Quotients of Peck posets
• Posets of shuffles
• Subsequence numbers and logarithmic concavity
• On Lexicographically Shellable Posets
• On free monoids partially ordered by embedding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On posets of \(m\)-ary words