English
Related papers

Related papers: Approximate subgroups with bounded VC-dimension

200 papers

We introduce the bounded packing property for a subgroup of a countable discrete group G. This property gives a finite upper bound on the number of left cosets of the subgroup that are pairwise close in G. We establish basic properties of…

Group Theory · Mathematics 2014-11-11 G. Christopher Hruska , Daniel T. Wise

We show that the sets in a family with finite VC dimension can be uniformly approximated within a given error by a finite partition. Immediate corollaries include the fact that VC classes have finite bracketing numbers, satisfy uniform laws…

Probability · Mathematics 2010-07-26 Terrence M. Adams , Andrew B. Nobel

In this article, we give a theorem of reduction of the structure group of a principal bundle P with regular structure group G. Then, when G is in the classes of Lie groups defined by T.Robart [13], we define the closed holonomy group of a…

Differential Geometry · Mathematics 2007-05-23 Jean-Pierre Magnot

For a random subset of a finite group $G$ of cardinality $N$, we consider the VC-dimension of the family of its translates (equivalently the VC-dimension of a random Cayley graph) and prove a law of large numbers as $N\rightarrow\infty$.…

Combinatorics · Mathematics 2025-06-18 Brad Rodgers , Anurag Sahay

We show an analogue of a theorem of An, Ghosh, Guan, and Ly on weighted badly approximable vectors for totally imaginary number fields. We show that for $G=\mathrm{SL}_2(\mathbb{C})\times\dots\times\mathrm{SL}_2(\mathbb{C})$ and $\Gamma<G$…

Dynamical Systems · Mathematics 2023-10-31 Gaurav Sawant

We provide a mathematically rigorous definition of local approximation and demonstrate its applicability to some interesting classes of structures. In particular, we prove that any compact simple Lie group is locally approximated by finite…

Logic · Mathematics 2026-04-02 Boris Zilber

We prove a geometric criterion for the bounded multiplicity property of "small" infinite-dimensional representations of real reductive Lie groupsin both induction and restrictions. Applying the criterion to symmetric pairs, we give a full…

Representation Theory · Mathematics 2021-12-14 Toshiyuki Kobayashi

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

Combinatorics · Mathematics 2015-06-02 Przemysław Mazur

We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…

Logic · Mathematics 2019-10-02 Pantelis E. Eleftheriou , Ayhan Günaydin , Philipp Hieronymi

The subspace structure of Beidleman near-vector spaces is investigated. We characterise finite dimensional Beidleman near-vector spaces and we classify the R-subgroups of finite dimensional Beidleman near-vector spaces. We provide an…

Commutative Algebra · Mathematics 2018-10-18 P Djagba , K-T Howell

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

Group Theory · Mathematics 2016-08-16 Emmanuel Breuillard , Matthew Tointon

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

We investigate a slight weakening of the classical property of strong approximation, which we call almost strong approximation, for connected reductive algebraic groups over global fields with respect to special sets of valuations. While…

Algebraic Geometry · Mathematics 2026-01-13 Andrei S. Rapinchuk , Wojciech Tralle

Through highly non-constructive methods, works by Bestvina, Culler, Feighn, Morgan, Paulin, Rips, Shalen, and Thurston show that if a finitely presented group does not split over a virtually solvable subgroup, then the space of its discrete…

Geometric Topology · Mathematics 2009-02-17 Yvonne Lai

Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with…

Combinatorics · Mathematics 2011-10-24 Matt DeVos , Bojan Mohar

This paper shows that the $\mathrm{VC}_2$-dimension of a subset of $\mathbb{F}_p^n$ known as the 'quadratic Green-Sanders example' is at least 3 and at most 501. The upper bound confirms a conjecture of Terry and Wolf, who introduced this…

Combinatorics · Mathematics 2024-11-11 V. Gladkova

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

Computational Geometry · Computer Science 2026-05-12 Pankaj K. Agarwal , Esther Ezra , Micha Sharir

We develop a version of Freiman's theorem for a class of non-abelian groups, which includes finite nilpotent, supersolvable and solvable A-groups. To do this we have to replace the small doubling hypothesis with a stronger relative…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

This paper gathers four lectures, based on a mini-course at IMA in 2014, whose aim was to discuss the structure of approximate subgroups of an arbitrary group, following the works of Hrushovski and of Green, Tao and the author. Along the…

Group Theory · Mathematics 2015-12-07 Emmanuel Breuillard

Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario is modeled by the extensively studied \textsc{Coalition…

Data Structures and Algorithms · Computer Science 2025-05-29 Foivos Fioravantes , Harmender Gahlawat , Nikolaos Melissinos