12 citations · 34 across the 20 of their papers we have counts for
6 papers · 1 filter
Normal Numbers and the Borel Hierarchy
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
We show that the set of absolutely normal numbers is -complete in the Borel hierarchy of subsets of real numbers. Similarly, the set of absolutely normal numbers is…
On the Normality of Numbers to Different Bases
Verónica Becher, Theodore A. Slaman
We prove independence of normality to different bases We show that the set of real numbers that are normal to some base is Sigma^0_4 complete in the Borel hierarchy of subsets of r…
On Simply Normal Numbers to Different Bases
Verónica Becher, Yann Bugeaud, Theodore A. Slaman
Let s be an integer greater than or equal to 2. A real number is simply normal to base s if in its base-s expansion every digit 0, 1, ..., s-1 occurs with the same frequency 1/s. L…
Wadge Hardness in Scott Spaces and Its Effectivization
Verónica Becher, Serge Grigorieff
We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating dec…
Borel and Hausdorff Hierarchies in Topological Spaces of Choquet Games and Their Effectivization
Verónica Becher, Serge Grigorieff
What parts of classical descriptive set theory done in Polish spaces still hold for more general topological spaces, possibly T0 or T1, but not T2 (i.e. not Hausdorff)? This questi…
Efficient repeat finding via suffix arrays
Veronica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
We solve the problem of finding interspersed maximal repeats using a suffix array construction. As it is well known, all the functionality of suffix trees can be handled by suffix…