Abstract
Let B m,n denote the set of all words obtained from the cyclic word of length n on an alphabet of m letters in by deleting on all possible ways and their natural order. In [Order, 16: 179–194, 1999] Burosch et al. computed the automorphism group of the poset B m,n . In this paper, we apply this result to obtain all of orbits of the natural action of Aut(B m,n ) on B m,n .
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burosch, G., Gronau, H.-D.O.F., Laborde, J.-M.: The automorphism group of the subsequence poset B m,n . Order 16, 179–194 (1999)
Burosch, G., Gronau, H.-D.O.F., Laborde, J.-M., Warnke, I.: On posets of m–ary words. Discrete Math. 152, 69–91 (1996)
Burosch, G., Franke, U., Röhl, S.: Über Ordungen von Binärworten. Rostock. Math. Kolloqu. 39, 53–64 (1990)
Chase, P.J.: Subsequence numbers and logarithmic concavity. Discrete Math. 16, 123–140 (1976)
Greene, C.: Poset of shuffles. J. Comb. Theory, Ser. A. 47, 191–206 (1988)
Jalal-Abadi, M.: Subsequence poset B m,n . MSc Thesis, University of Kashan, Iran (2005)
Waterman, M.S.: General methods of sequence comparison. Bull. Math. Biol. 46, 473–500 (1984)
Waterman, M.S.: Efficient sequence alignment Algorithms. J. Theor. Biol. 108, 333–337 (1984)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ghorbani, M., Jalal-Abadi, M. & Ashrafi, A.R. Computing Orbits of the Automorphism Group of the Subsequence Poset B m,n . Order 23, 163–168 (2006). https://doi.org/10.1007/s11083-006-9038-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-006-9038-9