On a conjecture of Erdös and Heilbronn

DOI10.4064/aa-17-3-227-229zbMath0222.10055OpenAlexW971488519WikidataQ122935097 ScholiaQ122935097MaRDI QIDQ5626786

Endre Szemerédi

Publication date: 1970

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/204952

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01) Special sequences and polynomials (11B83)

Related Items (14)

Zero-sum problems in finite Abelian groups: a survey ⋮ An addition theorem on the integers modulo \(n\) ⋮ Olson's constant for the group \(\mathbb Z_p\oplus\mathbb Z_p\) ⋮ Zero-sum subsets in vector spaces over finite fields ⋮ On the Olson and the strong Davenport constants ⋮ A characterization of incomplete sequences in vector spaces ⋮ Long arithmetic progressions in sumsets: Thresholds and bounds ⋮ A polynomial method approach to zero-sum subsets in $\mathbb {F}_{p}^{2}$ ⋮ Some additive applications of the isoperimetric approach ⋮ An addition theorem and maximal zero-sum free sets in \(\mathbb{Z}/p\mathbb{Z}\) ⋮ Ordered sums of group elements ⋮ Zero sums in restricted sequences ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Greedy algorithm, arithmetic progressions, subset sums and divisibility

This page was built for publication: On a conjecture of Erdös and Heilbronn