3 citations · 3 across the 4 of their papers we have counts for
6 papers
On extremal factors of de Bruijn-like graphs
Nicolás Álvarez, Verónica Becher, Martín Mereb +2
In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order is attained by the pure cycling register rule, as conjectured by G…
Poisson generic sequences
Nicolás Álvarez, Verónica Becher, Martín Mereb
Years ago, Zeev Rudnick defined the Poisson generic real numbers by counting the number of occurrences of long blocks of digits in the initial segments of the expansions of the rea…
On normality in shifts of finite type
Nicolás Álvarez, Olivier Carton
In this paper we consider the notion of normality of sequences in shifts of finite type. A sequence is normal if the frequency of each block exists and is equal to the Parry measur…
Finite-state Independence and Normal Sequences
Nicolás Álvarez, Verónica Becher, Olivier Carton
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three…
Perfect Necklaces
Nicolás Álvarez, Verónica Becher, Pablo A. Ferrari +1
We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular w…
M. Levin's construction of absolutely normal numbers with very low discrepancy
Nicolás Alvarez, Verónica Becher
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Levin in 1979 achieves the lowest discrepancy bound. In this work we analyze this c…