An official website of the United States government
Let X =G/Γ, where G is a connected Lie group and Γ is a lattice in G. Let O be an open subset of X, and let F = {g_t : t ≥ 0} be a one-parameter subsemigroup of G. Consider the set of points in X whose F-orbit misses O; it has measure zero if the flow is ergodic. It has been conjectured that, assuming ergodicity, this set has Hausdorff dimension strictly smaller than the dimension of X. This conjecture has been proved when X is compact or when G is a simple Lie group of real rank 1, or, most recently, for certain flows on the space of lattices. In this paper we prove this conjecture for arbitrary Addiagonalizable flows on irreducible quotients of semisimple Lie groups. The proof uses exponential mixing of the flow together with the method of integral inequalities for height functions on G/Γ. We also derive an application to jointly Dirichlet-Improvable systems of linear forms.
more »
« less
This content will become publicly available on January 1, 2026
Dimension bounds for escape on average in homogeneous spaces
Let X = G/Γ, where G is a Lie group and Γ is a uniform lattice in G, and let O be an open subset of X. We give an upper estimate for the Hausdorff dimension of the set of points whose trajectories escape O on average with frequency δ, where 0 < δ ≤ 1.
more »
« less
- Award ID(s):
- 2155111
- PAR ID:
- 10612003
- Publisher / Repository:
- AIMS
- Date Published:
- Journal Name:
- Discrete and Continuous Dynamical Systems
- Volume:
- 45
- Issue:
- 5
- ISSN:
- 1078-0947
- Page Range / eLocation ID:
- 1653 to 1671
- Subject(s) / Keyword(s):
- Birkhoff’s Ergodic Theorem deviations from ergodic averages exponential mixing horospherical subgroups Hausdorff dimension.
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract May the triforce be the 3-uniform hypergraph on six vertices with edges {123′, 12′3, 1′23}. We show that the minimum triforce density in a 3-uniform hypergraph of edge density δ is δ 4– o (1) but not O ( δ 4 ). Let M ( δ ) be the maximum number such that the following holds: for every ∊ > 0 and $$G = {\mathbb{F}}_2^n$$ with n sufficiently large, if A ⊆ G × G with A ≥ δ | G | 2 , then there exists a nonzero “popular difference” d ∈ G such that the number of “corners” ( x , y ), ( x + d , y ), ( x , y + d ) ∈ A is at least ( M ( δ )–∊)| G | 2 . As a corollary via a recent result of Mandache, we conclude that M ( δ ) = δ 4– o (1) and M ( δ ) = ω ( δ 4 ). On the other hand, for 0 < δ < 1/2 and sufficiently large N , there exists A ⊆ [ N ] 3 with | A | ≥ δN 3 such that for every d ≠ 0, the number of corners ( x , y , z ), ( x + d , y , z ), ( x , y + d , z ), ( x , y , z + d ) ∈ A is at most δ c log(1/ δ ) N 3 . A similar bound holds in higher dimensions, or for any configuration with at least 5 points or affine dimension at least 3.more » « less
-
Let 𝑋=𝐺/Γ, where G is a Lie group and Γ is a lattice in G, and let U be a subset of X whose complement is compact. We use the exponential mixing results for diagonalizable flows on X to give upper estimates for the Hausdorff dimension of the set of points whose trajectories miss U. This extends a recent result of Kadyrov et al. (Dyn Syst 30(2):149–157, 2015) and produces new applications to Diophantine approximation, such as an upper bound for the Hausdorff dimension of the set of weighted uniformly badly approximable systems of linear forms, generalizing an estimate due to Broderick and Kleinbock (Int J Number Theory 11(7):2037–2054, 2015).more » « less
-
For finitely generated groups G and H equipped with word metrics, a translation-like action of H on G is a free action where each element of H moves elements of G a bounded distance. Translation-like actions provide a geometric generalization of subgroup containment. Extending work of Cohen, we show that cocompact lattices in a general semisimple Lie group G that is not isogenous to SL(2,ℝ) admit translation-like actions by ℤ2. This result follows from a more general result. Namely, we prove that any cocompact lattice in the unipotent radical N of the Borel subgroup AN of G acts translation-like on any cocompact lattice in G. We also prove that for noncompact simple Lie groups G,H with Hmore » « less
-
Kumar, Amit; Ron-Zewi, Noga (Ed.)We study the Matrix Multiplication Verification Problem (MMV) where the goal is, given three n × n matrices A, B, and C as input, to decide whether AB = C. A classic randomized algorithm by Freivalds (MFCS, 1979) solves MMV in Õ(n²) time, and a longstanding challenge is to (partially) derandomize it while still running in faster than matrix multiplication time (i.e., in o(n^ω) time). To that end, we give two algorithms for MMV in the case where AB - C is sparse. Specifically, when AB - C has at most O(n^δ) non-zero entries for a constant 0 ≤ δ < 2, we give (1) a deterministic O(n^(ω-ε))-time algorithm for constant ε = ε(δ) > 0, and (2) a randomized Õ(n²)-time algorithm using δ/2 ⋅ log₂ n + O(1) random bits. The former algorithm is faster than the deterministic algorithm of Künnemann (ESA, 2018) when δ ≥ 1.056, and the latter algorithm uses fewer random bits than the algorithm of Kimbrel and Sinha (IPL, 1993), which runs in the same time and uses log₂ n + O(1) random bits (in turn fewer than Freivalds’s algorithm). Our algorithms are simple and use techniques from coding theory. Let H be a parity-check matrix of a Maximum Distance Separable (MDS) code, and let G = (I | G') be a generator matrix of a (possibly different) MDS code in systematic form. Our deterministic algorithm uses fast rectangular matrix multiplication to check whether HAB = HC and H(AB)^T = H(C^T), and our randomized algorithm samples a uniformly random row g' from G' and checks whether g'AB = g'C and g'(AB)^T = g'C^T. We additionally study the complexity of MMV. We first show that all algorithms in a natural class of deterministic linear algebraic algorithms for MMV (including ours) require Ω(n^ω) time. We also show a barrier to proving a super-quadratic running time lower bound for matrix multiplication (and hence MMV) under the Strong Exponential Time Hypothesis (SETH). Finally, we study relationships between natural variants and special cases of MMV (with respect to deterministic Õ(n²)-time reductions).more » « less
