A finite word poset
The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2
Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank and Röhl [4]) and a BLYM inequality is verified (via the normalized matching property).
DOI :
10.37236/1607
Classification :
06A07, 68R15, 06B25
Mots-clés : automorphisms, words of length at most \(n\), poset of finite sequences
Mots-clés : automorphisms, words of length at most \(n\), poset of finite sequences
@article{10_37236_1607,
author = {P\'eter L. Erd\H{o}s and P\'eter Sziklai and David C. Torney},
title = {A finite word poset},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {2},
doi = {10.37236/1607},
zbl = {0994.06002},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1607/}
}
Péter L. Erdős; Péter Sziklai; David C. Torney. A finite word poset. The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2. doi: 10.37236/1607
Cité par Sources :