About: Kemnitz's conjecture     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Theorem106752293, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/c/8xQHJzFMVZ

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. The exact formulation of this conjecture is as follows: Let be a natural number and a set of lattice points in plane. Then there exists a subset with points such that the centroid of all points from is also a lattice point.

AttributesValues
rdf:type
rdfs:label
  • Kemnitz-Vermutung (de)
  • Conjecture de Kemnitz (fr)
  • Kemnitz's conjecture (en)
rdfs:comment
  • Die Kemnitz-Vermutung ist ein inzwischen bewiesenes Theorem der additiven Zahlentheorie. Sie besagt, dass jede Menge von Gitterpunkten in der Ebene eine große Teilmenge hat, deren Schwerpunkt wieder ein Punkt des Gitters ist. (de)
  • 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. The exact formulation of this conjecture is as follows: Let be a natural number and a set of lattice points in plane. Then there exists a subset with points such that the centroid of all points from is also a lattice point. (en)
  • La conjecture de Kemnitz est aujourd'hui un théorème de théorie additive des nombres d'après lequel, pour tout entier n > 0, parmi 4n – 3 éléments du groupe abélien fini (ℤ/nℤ)2, il en existe toujours n de somme nulle. (fr)
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Die Kemnitz-Vermutung ist ein inzwischen bewiesenes Theorem der additiven Zahlentheorie. Sie besagt, dass jede Menge von Gitterpunkten in der Ebene eine große Teilmenge hat, deren Schwerpunkt wieder ein Punkt des Gitters ist. (de)
  • 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. The exact formulation of this conjecture is as follows: Let be a natural number and a set of lattice points in plane. Then there exists a subset with points such that the centroid of all points from is also a lattice point. Kemnitz's conjecture was formulated in 1983 by Arnfried Kemnitz as a generalization of the Erdős–Ginzburg–Ziv theorem, an analogous one-dimensional result stating that every integers have a subset of size whose average is an integer. In 2000, Lajos Rónyai proved a weakened form of Kemnitz's conjecture for sets with lattice points. Then, in 2003, Christian Reiher proved the full conjecture using the Chevalley–Warning theorem. (en)
  • La conjecture de Kemnitz est aujourd'hui un théorème de théorie additive des nombres d'après lequel, pour tout entier n > 0, parmi 4n – 3 éléments du groupe abélien fini (ℤ/nℤ)2, il en existe toujours n de somme nulle. Arnfried Kemnitz avait formulé en 1983 cette conjecture comme une généralisation du théorème d'Erdős-Ginzburg-Ziv et l'avait réduite au cas où n est premier. En 2000, (hu) l'a démontrée pour 4n – 2 éléments si n est premier et en 2001, Gao a étendu ce résultat partiel au cas où n est une puissance d'un nombre premier. La conjecture complète a été démontrée à l'automne 2003, indépendamment, par Christian Reiher (en utilisant le théorème de Chevalley-Warning) et Carlos di Fiore. (fr)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is known for of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git147 as of Sep 06 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 69 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software