On the congruence subgroup problem
We show a connection between a recent conjecture of Shallit and an older conjecture of Rauzy for infinite words on a finite alphabet. More precisely we show that a Rauzy-like conjecture is equivalent to Shallit's. In passing we correct a misprint in Rauzy's conjecture.
We consider the problem of constructing dense lattices in with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions , we exhibit a finite set of lattices that come with an automorphisms group of size , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...
We show that for any irrational number α and a sequence of integers such that , there exists a continuous measure μ on the circle such that . This implies that any rigidity sequence of any ergodic transformation is a rigidity sequence for some weakly mixing dynamical system. On the other hand, we show that for any α ∈ ℝ - ℚ, there exists a sequence of integers such that and such that is dense on the circle if and only if θ ∉ ℚα + ℚ.