An alternative construction of normal numbers

Edgardo Ugalde

Journal de théorie des nombres de Bordeaux (2000)

  • Volume: 12, Issue: 1, page 165-177
  • ISSN: 1246-7405

Abstract

top
A new class of b -adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one, in such way that the b -adic block determined by the path contains the maximal number of different b -adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. Our recursive construction is an alternative to the several well-known concatenative constructions à la Champernowne.

How to cite

top

Ugalde, Edgardo. "An alternative construction of normal numbers." Journal de théorie des nombres de Bordeaux 12.1 (2000): 165-177. <http://eudml.org/doc/248514>.

@article{Ugalde2000,
abstract = {A new class of $b$-adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one, in such way that the $b$-adic block determined by the path contains the maximal number of different $b$-adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. Our recursive construction is an alternative to the several well-known concatenative constructions à la Champernowne.},
author = {Ugalde, Edgardo},
journal = {Journal de théorie des nombres de Bordeaux},
keywords = {-adic expansion; Eulerian cycles; Hamiltonian paths; -adic normal numbers; de Bruijn digraphs},
language = {eng},
number = {1},
pages = {165-177},
publisher = {Université Bordeaux I},
title = {An alternative construction of normal numbers},
url = {http://eudml.org/doc/248514},
volume = {12},
year = {2000},
}

TY - JOUR
AU - Ugalde, Edgardo
TI - An alternative construction of normal numbers
JO - Journal de théorie des nombres de Bordeaux
PY - 2000
PB - Université Bordeaux I
VL - 12
IS - 1
SP - 165
EP - 177
AB - A new class of $b$-adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one, in such way that the $b$-adic block determined by the path contains the maximal number of different $b$-adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. Our recursive construction is an alternative to the several well-known concatenative constructions à la Champernowne.
LA - eng
KW - -adic expansion; Eulerian cycles; Hamiltonian paths; -adic normal numbers; de Bruijn digraphs
UR - http://eudml.org/doc/248514
ER -

References

top
  1. [Bo] E. Borel, Sur les probabilités dénombrables et leurs applications arithmétiques. Circ. Mat. d. Palermo29 (1909), 247-271. Zbl40.0283.01JFM40.0283.01
  2. [Br] N.G. de Bruijn, A combinatorial problem. Konink. Nederl. Akad. Wetersh. Afd. Naturuk. Eerste Reelss, A49 (1946), 758-764. Zbl0060.02701MR18142
  3. [Be] A.S. Besicovitch, The asymtotic distribution of the numerals in the decimal representation of the squares of the natural numbers. Math. Z.39 (1935), 146-156. Zbl0009.20002MR1545494JFM60.0937.01
  4. [Ch] D.G. Champernowne, The Construction of The Decimals Normal in base Ten. J. Lond. Math. Soc.8 (1933), 254-260. Zbl0007.33701JFM59.0214.01
  5. [CE] A. Copeland, P. Erdös, Note on normal numbers. Bull. Amer. Math. Soc.52 (1946), 857-860. Zbl0063.00962MR17743
  6. [Cs] I. Csiszar, T.M. Coven, B.-S. Choi, Conditional limit theorem under Markov conditioning. IEEE Trans. Inform. TheoryIT-336 (1987), 788-801. Zbl0628.60037MR923237
  7. [DK] M. Denker, K.F. Krämer, Upper and lower class results for subsequences of the Champernowne number. Ergodic theory and related topics III, LNM1541Springer (1992), 83-89. Zbl0761.11032MR1179173
  8. [E1] R.S. Ellis, Entropy, large deviations and statistical mechanics. Springer-Verlag, 1985. Zbl0566.60097MR793553
  9. [Go] I.J. Good, Normal Recurring Decimals. J. Lond. Math. Soc.21 (1946), 167-169. Zbl0060.02702MR19573
  10. [Ma] J.E. Maxfield, Normal k-tuples. Pacif. J. Math.3 (1957), 189-196. Zbl0050.27503MR53978
  11. [Sc] J. Schiffer, Discrepancy of normal numbers. Acta Arith.74 (1986), 175-186. Zbl0556.10036MR867496
  12. [NS] Y.-N. Nakai& I. Shiokawa, Discrepancy estimates for a class of normal numbers. Acta Arith.62 (1992), 271-284. Zbl0773.11050MR1197421
  13. [Tu] R. Tutte, Graph Theory. Encyclopedia of Mathematics and its Applications Vol 21Addison Wesley, 1984. Zbl0554.05001

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.