Small-sum pairs in abelian groups (Q719132): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.5802/jtnb.730 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2330051017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's theorem for upper Banach density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-periodic decompositions and the Kemperman structure theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsets with small sums in abelian groups. I: The Vosper property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsets with a small sum. II: The critical pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small sumsets in an abelian group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Critical Pairs of Subsets of a Group of Prime Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889853 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.5802/JTNB.730 / rank
 
Normal rank

Latest revision as of 01:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Small-sum pairs in abelian groups
scientific article

    Statements

    Small-sum pairs in abelian groups (English)
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    In [``Kneser's theorem for upper Banach density'', J. Théor. Nombres Bordx. 18, No. 2, 323--343 (2006; Zbl 1138.11044)], \textit{P. Bihani} and \textit{R. Jin} asked the following question: Let \(A\), \(B\) be subsets in an abelian group \(G\) such that \(|A|=|B|=k\) and \(|A+A|=|A+B|=2k-1\). Are always \(A\) and \(B\) translates of each other? The goal of this paper is to answer this question in the affirmative under appropriate hypotheses and to provide an explicit description of the counterexamples. If for two subsets \(X\), \(Y\) of \(G\) and \(c\in G\) we denote \(\upsilon _{c}(X,Y) \) the number of pairs \((x,y)\in X\times Y\) such that \(c=x+y\), it is proved that an element \(g\in G\) exists such that \(A=g+B\) if \(A+B\) is aperiodic or if elements \(a\in A\), \(\in B\) exist such that \(\upsilon _{a+b}(A,B)=\upsilon _{a+a}(A,A)=1\). The results heavily rely on on the description of the so-called critical pairs (of subsets) given by \textit{J. H. B. Kemperman} [Acta Math. 103, 63--88 (1960; Zbl 0108.25704)].
    0 references
    small-sum pair
    0 references
    quasi-periodic decomposition
    0 references
    Kemperman pair
    0 references
    aperiodic
    0 references
    Kneser theorem
    0 references

    Identifiers

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