The polynomial method in the study of zero-sum theorems
From MaRDI portal
Recommendations
- On a polynomial method of Rónyai in the study of zero-sum theorems
- An addition theorem and maximal zero-sum free sets in \(\mathbb{Z}/p\mathbb{Z}\)
- A compactness argument in the additive theory and the polynomial method.
- The polynomial method and restricted sums of congruence classes
- The polynomial method in additive combinatorics
Cites work
- A combinatorial problem on finite abelian groups
- A combinatorial problem on finite Abelian groups. I
- A combinatorial problem on finite Abelian groups. II
- A lattice point problem and additive number theory
- A nowhere-zero point in linear mappings
- Additive bases of vector spaces over prime fields
- An uncertainty inequality and zero subsums
- Combinatorial Nullstellensatz
- Combinatorial number theory and additive group theory. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse)
- Contributions to zero-sum problems
- Davenport constant with weights and some related questions. II.
- scientific article; zbMATH DE number 1834799 (Why is no real title available?)
- Lower bounds for multidimensional zero sums
- New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants
- On a conjecture of Kemnitz
- On Davenport's constant
- On Kemnitz' conjecture concerning lattice-points in the plane
- On the Erdős-Ginzburg-Ziv constant of finite abelian groups of high rank
- On weighted zero-sum sequences
- Remarks on some zero-sum theorems
- Some combinatorial group invariants and their generalizations with weights
- Some exact values of the Harborth constant and its plus-minus weighted analogue
- Some zero-sum constants with weights
- Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
- There are infinitely many Carmichael numbers
- Two zero-sum invariants on finite abelian groups
- ZERO-SUM PROBLEMS IN FINITE ABELIAN GROUPS AND AFFINE CAPS
- Zero-sum problems in finite Abelian groups: a survey
- Zero-sums of length kq in Zqd
Cited in
(6)- A polynomial-time algorithm for finding zero-sums.
- An elementary analog of the operator method in additive combinatorics
- On a polynomial method of Rónyai in the study of zero-sum theorems
- Weighted Zero-Sums for Some Finite Abelian Groups of Higher Ranks
- Characteristic subsets and the polynomial method
- Pollaczek polynomials and summability methods
This page was built for publication: The polynomial method in the study of zero-sum theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942520)
