Equidistribution of Farey sequences on horospheres in covers of and applications

2019 ◽  
Vol 41 (2) ◽  
pp. 471-493
Author(s):  
BYRON HEERSINK

We establish the limiting distribution of certain subsets of Farey sequences, i.e., sequences of primitive rational points, on expanding horospheres in covers $\unicode[STIX]{x1D6E5}\backslash \text{SL}(n+1,\mathbb{R})$ of $\text{SL}(n+1,\mathbb{Z})\backslash \text{SL}(n+1,\mathbb{R})$, where $\unicode[STIX]{x1D6E5}$ is a finite-index subgroup of $\text{SL}(n+1,\mathbb{Z})$. These subsets can be obtained by projecting to the hyperplane $\{(x_{1},\ldots ,x_{n+1})\in \mathbb{R}^{n+1}:x_{n+1}=1\}$ sets of the form $\mathbf{A}=\bigcup _{j=1}^{J}\mathbf{a}_{j}\unicode[STIX]{x1D6E5}$, where for all $j$, $\mathbf{a}_{j}$ is a primitive lattice point in $\mathbb{Z}^{n+1}$. Our method involves applying the equidistribution of expanding horospheres in quotients of $\text{SL}(n+1,\mathbb{R})$ developed by Marklof and Strömbergsson, and more precisely understanding how the full Farey sequence distributes in $\unicode[STIX]{x1D6E5}\backslash \text{SL}(n+1,\mathbb{R})$ when embedded on expanding horospheres as done in previous work by Marklof. For each of the Farey sequence subsets, we extend the statistical results by Marklof regarding the full multidimensional Farey sequences, and solutions by Athreya and Ghosh to Diophantine approximation problems of Erdős–Szüsz–Turán and Kesten. We also prove that Marklof’s result on the asymptotic distribution of Frobenius numbers holds for sets of primitive lattice points of the form $\mathbf{A}$.

Author(s):  
Christopher Lutsko

Abstract The Farey sequence is the set of rational numbers with bounded denominator. We introduce the concept of a generalized Farey sequence. While these sequences arise naturally in the study of discrete and thin subgroups, they can be used to study interesting number theoretic sequences—for example rationals whose continued fraction partial quotients are subject to congruence conditions. We show that these sequences equidistribute and the gap distribution converges and answer an associated problem in Diophantine approximation. Moreover, for one example, we derive an explicit formula for the gap distribution. For this example, we construct the analogue of the Gauss measure, which is ergodic for the Gauss map. This allows us to prove a theorem about the associated Gauss–Kuzmin statistics.


Author(s):  
Reynold Fregoli

Abstract We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve “hyperbolic spikes” and occur naturally in multiplicative Diophantine approximation. We use Wilkie’s o-minimal structure $\mathbb{R}_{\exp }$ and expansions thereof to formulate our counting result in a general setting. We give two different applications of our counting result. The 1st one establishes nearly sharp upper bounds for sums of reciprocals of fractional parts and thereby sheds light on a question raised by Lê and Vaaler, extending previous work of Widmer and of the author. The 2nd application establishes new examples of linear subspaces of Khintchine type thereby refining a theorem by Huang and Liu. For the proof of our counting result, we develop a sophisticated partition method that is crucial for further upcoming work on sums of reciprocals of fractional parts over distorted boxes.


2020 ◽  
Vol 30 (5) ◽  
pp. 1439-1463
Author(s):  
Richard C. H. Webb

AbstractWe prove that almost all arc complexes do not admit a CAT(0) metric with finitely many shapes, in particular any finite-index subgroup of the mapping class group does not preserve such a metric on the arc complex. We also show the analogous statement for all but finitely many disc complexes of handlebodies and free splitting complexes of free groups. The obstruction is combinatorial. These complexes are all hyperbolic and contractible but despite this we show that they satisfy no combinatorial isoperimetric inequality: for any n there is a loop of length 4 that only bounds discs consisting of at least n triangles. On the other hand we show that the curve complexes satisfy a linear combinatorial isoperimetric inequality, which answers a question of Andrew Putman.


2013 ◽  
Vol 156 (1) ◽  
pp. 115-121
Author(s):  
ANITHA THILLAISUNDARAM

AbstractIn a previous paper, Button and Thillaisundaram proved that all finitely presented groups of p-deficiency greater than one are p-large. Here we prove that groups with a finite presentation of p-deficiency one possess a finite index subgroup that surjects onto the integers. This implies that these groups do not have Kazhdan's property (T). Additionally, we show that the aforementioned result of Button and Thillaisundaram implies a result of Lackenby.


2013 ◽  
Vol 34 (3) ◽  
pp. 837-853 ◽  
Author(s):  
YAIR HARTMAN ◽  
YURI LIMA ◽  
OMER TAMUZ

AbstractLet $(G, \mu )$ be a discrete group equipped with a generating probability measure, and let $\Gamma $ be a finite index subgroup of $G$. A $\mu $-random walk on $G$, starting from the identity, returns to $\Gamma $ with probability one. Let $\theta $ be the hitting measure, or the distribution of the position in which the random walk first hits $\Gamma $. We prove that the Furstenberg entropy of a $(G, \mu )$-stationary space, with respect to the action of $(\Gamma , \theta )$, is equal to the Furstenberg entropy with respect to the action of $(G, \mu )$, times the index of $\Gamma $ in $G$. The index is shown to be equal to the expected return time to $\Gamma $. As a corollary, when applied to the Furstenberg–Poisson boundary of $(G, \mu )$, we prove that the random walk entropy of $(\Gamma , \theta )$ is equal to the random walk entropy of $(G, \mu )$, times the index of $\Gamma $ in $G$.


2012 ◽  
Vol 22 (03) ◽  
pp. 1250026
Author(s):  
UZY HADAD

We prove that for any finite index subgroup Γ in SL n(ℤ), there exists k = k(n) ∈ ℕ, ϵ = ϵ(Γ) > 0, and an infinite family of finite index subgroups in Γ with a Kazhdan constant greater than ϵ with respect to a generating set of order k. On the other hand, we prove that for any finite index subgroup Γ of SL n(ℤ), and for any ϵ > 0 and k ∈ ℕ, there exists a finite index subgroup Γ′ ≤ Γ such that the Kazhdan constant of any finite index subgroup in Γ′ is less than ϵ, with respect to any generating set of order k. In addition, we prove that the Kazhdan constant of the principal congruence subgroup Γn(m), with respect to a generating set consisting of elementary matrices (and their conjugates), is greater than [Formula: see text], where c > 0 depends only on n. For a fixed n, this bound is asymptotically best possible.


2014 ◽  
Vol 17 (1) ◽  
pp. 206-208
Author(s):  
Thomas Hamilton ◽  
David Loeffler

AbstractWe give a computationally effective criterion for determining whether a finite-index subgroup of $\mathrm{SL}_2(\mathbf{Z})$ is a congruence subgroup, extending earlier work of Hsu for subgroups of $\mathrm{PSL}_2(\mathbf{Z})$.


Author(s):  
Frédérique Bassino ◽  
Cyril Nicaud ◽  
Pascal Weil

We count the finitely generated subgroups of the modular group [Formula: see text]. More precisely, each such subgroup [Formula: see text] can be represented by its Stallings graph [Formula: see text], we consider the number of vertices of [Formula: see text] to be the size of [Formula: see text] and we count the subgroups of size [Formula: see text]. Since an index [Formula: see text] subgroup has size [Formula: see text], our results generalize the known results on the enumeration of the finite index subgroups of [Formula: see text]. We give asymptotic equivalents for the number of finitely generated subgroups of [Formula: see text], as well as of the number of finite index subgroups, free subgroups and free finite index subgroups. We also give the expected value of the isomorphism type of a size [Formula: see text] subgroup and prove a large deviation statement concerning this value. Similar results are proved for finite index and for free subgroups. Finally, we show how to efficiently generate uniformly at random a size [Formula: see text] subgroup (respectively, finite index subgroup, free subgroup) of [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document