On finite sets of small tripling or small alternation in arbitrary groups

DOI10.1017/S0963548320000176zbMath1504.20028arXiv1806.06022MaRDI QIDQ4993110

Gabriel Conant

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.06022

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Classification theory, stability, and related concepts in model theory (03C45) Ultraproducts and related constructions (03C20) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (4)

Structure and regularity for subsets of groups with finite VC-dimension ⋮ Approximate subgroups with bounded VC-dimension ⋮ A model-theoretic note on the Freiman-Ruzsa theorem ⋮ Quantitative structure of stable sets in arbitrary finite groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Product decompositions of quasirandom groups and a Jordan type theorem.
• A probabilistic technique for finding almost-periods of convolutions
• Generalized arithmetical progressions and sumsets
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Groups without faithful transitive permutation representations of small degree
• Amenability, definable groups, and automorphism groups
• The structure of approximate groups.
• On the Bogolyubov-Ruzsa lemma
• On triples in arithmetic progression
• Product set estimates for non-commutative groups
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Remarks on compactifications of pseudofinite groups
• Stable group theory and approximate subgroups
• ON A NONABELIAN BALOG–SZEMERÉDI-TYPE LEMMA
• Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
• Quasirandom Groups
• Some remarks on finitarily approximable groups
• Stable arithmetic regularity in the finite field model
• TYPE-DEFINABILITY, COMPACT LIE GROUPS, AND o-MINIMALITY
• Quantitative structure of stable sets in finite abelian groups
• Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
• A group version of stable regularity
• Freiman's theorem in an arbitrary abelian group
• Regularity lemmas for stable graphs
• Groups, measures, and the NIP
• On Jordan's theorem for complex linear groups
• On approximations of groups, group actions, and Hopf algebras.

This page was built for publication: On finite sets of small tripling or small alternation in arbitrary groups