Abstract
In this paper we introduce the well distributed occurrences (WDO) combinatorial property for infinite words, which guarantees good behavior (no lattice structure) in some related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WDO property if, for each factor w of u, positive integer m, and vector v \(\in{\mathbb Z}_{m}^{d}\), there is an occurrence of w such that the Parikh vector of the prefix of u preceding such occurrence is congruent to v modulo m. We prove that Sturmian words, and more generally Arnoux-Rauzy words and some morphic images of them, have the WDO property.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexité 2n + 1. Bull. Soc. Math. France 119, 199–215 (1991)
Guimond, L.-S., Patera, J., Patera, J.: Statistical properties and implementation of aperiodic pseudorandom number generators. Applied Numerical Mathematics 46(3-4), 295–318 (2003)
Lothaire, M.: Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press (2002)
Morse, M., Hedlund, G.A.: Symbolic Dynamics II: Sturmian trajectories. Amer. J. Math. 62(1), 1–42 (1940)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balková, Ĺ., Bucci, M., De Luca, A., Puzynina, S. (2013). Infinite Words with Well Distributed Occurrences. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-40579-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40578-5
Online ISBN: 978-3-642-40579-2
eBook Packages: Computer ScienceComputer Science (R0)