Kemnitz's conjecture

From testwiki
Revision as of 13:44, 8 November 2024 by imported>Citation bot (Add: issue, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Combinatorics | #UCB_Category 97/188)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In additive number theory, Kemnitz's conjecture states that every set of lattice points in the plane has a large subset whose centroid is also a lattice point. It was proved independently in the autumn of 2003 by Christian Reiher, then an undergraduate student, and Carlos di Fiore, then a high school student.Template:R

The exact formulation of this conjecture is as follows:

Let n be a natural number and S a set of 4n3 lattice points in plane. Then there exists a subset S1S with n points such that the centroid of all points from S1 is also a lattice point.

Kemnitz's conjecture was formulated in 1983 by Arnfried KemnitzTemplate:R as a generalization of the Erdős–Ginzburg–Ziv theorem, an analogous one-dimensional result stating that every 2n1 integers have a subset of size n whose average is an integer.Template:R In 2000, Lajos Rónyai proved a weakened form of Kemnitz's conjecture for sets with 4n2 lattice points.Template:R Then, in 2003, Christian Reiher proved the full conjecture using the Chevalley–Warning theorem.Template:R

References

Template:Reflist

Further reading


Template:Combin-stub