Approximate groups and doubling metrics (Q2883234)

From MaRDI portal





scientific article; zbMATH DE number 6033590
Language Label Description Also known as
English
Approximate groups and doubling metrics
scientific article; zbMATH DE number 6033590

    Statements

    Approximate groups and doubling metrics (English)
    0 references
    0 references
    11 May 2012
    0 references
    Freiman's theorem
    0 references
    non-abelian groups
    0 references
    relative polynomial growth hypothesis
    0 references
    0 references
    0 references
    0 references
    0 references
    This is an interesting, and (like all other attempts) only partially successful approach to find the analog of Freiman's theorem in noncommutative groups. Let \(G\) be a hereditarily monomial group (this assumption makes it possible to use some Fourier analysis) and \(A\) a finite symmetric normal set such that \(|A^n | \leq n^d |A| \) for all \(n\). (In commutative groups, an assumption for \(n=2\) suffices.) Then \(A\subset B\) with an \(O(d \log^3 d)\) dimensional ball \(B\) in a translation-invariant pseudometric \(\rho\) such that \( |B| \leq \exp \bigl( O( d \log d) \bigr) |A|\). The \textit{dimension} of a ball is defined as a number \(d\) such that \( |B(\rho, 2\delta)| \leq 2^d |B(\rho, \delta)| \) for sufficiently small \(\delta\).NEWLINENEWLINE NEWLINEThe main difference from other variants is that the covering structure is typically defined synthetically as a properly generalized arithmetic progression, and the structure of the balls as defined here needs to be clarified.NEWLINENEWLINE NEWLINEFor nilpotent groups the assumption can be weakened to \( |A|^3 \leq K |A| \). (A bound on \( |A^2| \) is generally insufficient.)NEWLINENEWLINE\{The article under review changed its title from `From polynomial growth to metric balls in monomial groups' to the present one. See \url{http://arxiv.org/abs/0912.0305}.\}
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references