An uncertainty inequality and zero subsums (Q753853): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Diophantine problems in variables restricted to the values 0 and 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive group theory—A progress report / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on finite Abelian groups. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on finite Abelian groups. II / rank
 
Normal rank

Latest revision as of 13:31, 21 June 2024

scientific article
Language Label Description Also known as
English
An uncertainty inequality and zero subsums
scientific article

    Statements

    An uncertainty inequality and zero subsums (English)
    0 references
    0 references
    1990
    0 references
    For a finite abelian group G, let s(G) denote the maximal s for which there exists a sequence \(a_ 1,...,a_ s\in G\) such that \(\sum_{i\in I}a_ i\neq 0\) for all \(\emptyset \neq I\subset \{1,...,s\}\). After proving an inequality for the finite Fourier transform, the author proves that \[ s(G)\leq m(1+lg\frac{| G|}{m}), \] where m denotes the maximal order of elements in G. \{The author notes that using another method the same result was independently proved by P. van Emde Boas and D. Kruyswijk.\}
    0 references
    sum sets
    0 references
    zero subsum
    0 references
    finite abelian group
    0 references
    finite Fourier transform
    0 references

    Identifiers