Complexité de suites engendrées par des récurrences unipotentes

Pierre Arnoux; Christian Mauduit

Acta Arithmetica (1996)

  • Volume: 76, Issue: 1, page 85-97
  • ISSN: 0065-1036

How to cite

top

Pierre Arnoux, and Christian Mauduit. "Complexité de suites engendrées par des récurrences unipotentes." Acta Arithmetica 76.1 (1996): 85-97. <http://eudml.org/doc/206888>.

@article{PierreArnoux1996,
author = {Pierre Arnoux, Christian Mauduit},
journal = {Acta Arithmetica},
keywords = {block complexity; Sturmian sequences},
language = {fre},
number = {1},
pages = {85-97},
title = {Complexité de suites engendrées par des récurrences unipotentes},
url = {http://eudml.org/doc/206888},
volume = {76},
year = {1996},
}

TY - JOUR
AU - Pierre Arnoux
AU - Christian Mauduit
TI - Complexité de suites engendrées par des récurrences unipotentes
JO - Acta Arithmetica
PY - 1996
VL - 76
IS - 1
SP - 85
EP - 97
LA - fre
KW - block complexity; Sturmian sequences
UR - http://eudml.org/doc/206888
ER -

References

top
  1. [A] J.-P. Allouche, Sur la complexité des suites infinies, Bull. Belg. Math. Soc. 1 (1994), 133-143. 
  2. P. Arnoux, C. Mauduit, I. Shiokawa and J. I. Tamura, Complexity of sequences defined by billiards in the cube, Bull. Soc. Math. France 122 (1994), 1-12. Zbl0791.58034
  3. [AR] P. Arnoux et G. Rauzy, Représentation géométrique de suites de complexité 2n+1, Bull. Soc. Math. France 119 (1991), 199-215. Zbl0789.28011
  4. [CH] E. M. Coven and G. A. Hedlund, Sequences with minimal block growth, Math. Systems Theory 7 (1973), 138-153. Zbl0256.54028
  5. [F] H. Furstenberg, Strict ergodicity and transformation of the torus, Amer. J. Math. 83 (1961), 573-601. Zbl0178.38404
  6. [GKP] R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, 1988. 
  7. [H] G. A. Hedlund, Sturmian minimal sets, Amer. J. Math. 66 (1944), 605-620. Zbl0063.01982
  8. [HM] G. A. Hedlund and M. Morse, Symbolic dynamics II. Sturmian trajectories, Amer. J. Math. 62 (1940), 1-42. Zbl0022.34003
  9. [Hu] P. Hubert, Complexité de suites définies par des billards rationnels, Bull. Soc. Math. France 123 (1995), 257-270. 
  10. [M] G. Meigniez, communication personnelle. 
  11. [MF] M. Mendès-France, Nombres normaux. Applications aux fonctions pseudo-aléatoires, J. Anal. Math. 20 (1967), 1-56. 
  12. [Mo1] B. Mossé, Reconnaissabilité des substitutions et complexité des suites automatiques, Bull. Soc. Math. France 124 (1996), 101-118. 
  13. [Mo2] B. Mossé, On the complexity of fixed points of substitutions, Institut de Mathématiques de Luminy, prétirage 96-06, 1996. 
  14. [P] M. Paul, Minimal symbolic flows having minimal block growth, Math. Systems Theory 8 (1974), 309-315. Zbl0306.54056
  15. [R] G. Rauzy, Suites à termes dans un alphabet fini, Séminaire Théorie des Nombres de Bordeaux, t. 25, 1982-1983, 2501-2516. Zbl0547.10048

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.