Hajós's theorem

Hajós's theorem

In group theory, Hajós's theorem states that if a finite abelian group is expressed as the Cartesian product of simplexes, that is, sets of the form {e,a,a2,...,as-1} where e is the identity element, then at least one of the factors is a subgroup. The theorem was proved by the Hungarian mathematician György Hajós in 1941 using group rings. Rédei later proved the statement when the factors are only required to contain the identity element and be of prime cardinality.

In this lattice tiling of the plane by congruent squares, the green and violet squares meet edge-to-edge as do the blue and orange squares.

An equivalent statement on homogeneous linear forms was originally conjectured by Hermann Minkowski. A consequence is Minkowski's conjecture on lattice tilings, which says that in any lattice tiling of space by cubes, there are two cubes that meet face to face. Keller's conjecture is the same conjecture for non-lattice tilings, which turns out to be false in high dimensions.

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • György Hajós — György Hajós, auch Georg Hajós zitiert, (* 21. Februar 1912 in Budapest; † 17. März 1972 ebenda) war ein ungarischer Mathematiker, der sich vor allem mit Geometrie beschäftigte. Er studierte an der Péter Pázmány Universität (später in Loránd… …   Deutsch Wikipedia

  • Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

  • Critical graph — In general the notion of criticality can refer to any measure. But in graph theory, when the term is used without any qualification, it almost always refers to the chromatic number of a graph. Critical graphs are interesting because they are the… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Hadwiger–Nelson problem — Unsolved problems in mathematics How many colors are needed to color the plane so that no two points at unit distance are the same color? In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks… …   Wikipedia

  • Tibor Gallai — (eigentlich Tibor Grünwald, * 15. Juli 1912 in Budapest; † 2. Januar 1992 ebenda) war ein ungarischer Mathematiker, der sich insbesondere mit Graphentheorie beschäftigte. Gallai fiel schon als Gymnasiast durch die Lösung mathematischer Probleme… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”