12 citations · 34 across the 20 of their papers we have counts for
31 papers
Rauzy dimension and finite-state dimension
Verónica Becher, Olivier Carton, Santiago Figueira
In 1976, Rauzy studied two complexity functions, and , for infinite sequences over a finite alphabet. The function achieves its maximum prec…
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…
On simply normal numbers with digit dependencies
Verónica Becher, Agustín Marchionna, Gérald Tenenbaum
Given an integer and a set of prime numbers, the set of Toeplitz numbers comprises all elements of whose digits in the base…
The descriptive complexity of the set of Poisson generic numbers
Verónica Becher, Stephen Jackson, Dominik Kwietniak +1
Let be an integer. We show that the set of real numbers that are Poisson generic in base is -complete in the Borel hierarchy of subsets of the real l…
Nested perfect toroidal arrays
Verónica Becher, Olivier Carton
We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given si…
A construction of a - Poisson generic sequence
Verónica Becher, Gabriel Sac Himelfarb
Years ago Zeev Rudnick defined the -Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the init…