In mathematics, the Minkowski–Hlawka theorem is a result on the lattice packing of hyperspheres in dimension n > 1. It states that there is a lattice in Euclidean space of dimension n, such that the corresponding best packing of hyperspheres with centres at the lattice points has density Δ satisfying This result was stated without proof by Hermann Minkowski and proved by Edmund Hlawka. The result is related to a linear lower bound for the Hermite constant.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Minkowski–Hlawka theorem (en)
|
rdfs:comment
| - In mathematics, the Minkowski–Hlawka theorem is a result on the lattice packing of hyperspheres in dimension n > 1. It states that there is a lattice in Euclidean space of dimension n, such that the corresponding best packing of hyperspheres with centres at the lattice points has density Δ satisfying This result was stated without proof by Hermann Minkowski and proved by Edmund Hlawka. The result is related to a linear lower bound for the Hermite constant. (en)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
authorlink
| - Hermann Minkowski (en)
- Edmund Hlawka (en)
|
first
| |
last
| - Minkowski (en)
- Hlawka (en)
|
year
| |
loc
| |
has abstract
| - In mathematics, the Minkowski–Hlawka theorem is a result on the lattice packing of hyperspheres in dimension n > 1. It states that there is a lattice in Euclidean space of dimension n, such that the corresponding best packing of hyperspheres with centres at the lattice points has density Δ satisfying with ζ the Riemann zeta function. Here as n → ∞, ζ(n) → 1. The proof of this theorem is indirect and does not give an explicit example, however, and there is still no known simple and explicit way to construct lattices with packing densities exceeding this bound for arbitrary n. In principle one can find explicit examples: for example, even just picking a few "random" lattices will work with high probability. The problem is that testing these lattices to see if they are solutions requires finding their shortest vectors, and the number of cases to check grows very fast with the dimension, so this could take a very long time. This result was stated without proof by Hermann Minkowski and proved by Edmund Hlawka. The result is related to a linear lower bound for the Hermite constant. (en)
|
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is known for
of | |
is known for
of | |
is foaf:primaryTopic
of | |