Voronoĭ type criteria for lattice coverings with balls
Peter M. Gruber (2011)
Acta Arithmetica
Similarity:
Peter M. Gruber (2011)
Acta Arithmetica
Similarity:
N. Alon (1991)
Geometric and functional analysis
Similarity:
Temesvári, Ágota H. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
R. Bambah, N. Sloane (1982)
Acta Arithmetica
Similarity:
Jarmila Hedlíková, Sylvia Pulmannová (1991)
Czechoslovak Mathematical Journal
Similarity:
Sándor Radeleczki (2002)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...
Josef Dalík (1979)
Časopis pro pěstování matematiky
Similarity:
Paweł Zwoleński (2011)
Colloquium Mathematicae
Similarity:
Steinhaus' lattice points problem addresses the question of whether it is possible to cover exactly n lattice points on the plane with an open ball for every fixed nonnegative integer n. This paper includes a theorem which can be used to solve the general problem of covering elements of so-called quasi-finite sets in Hilbert spaces. Some applications of this theorem are considered.
Kołodziejczyk, Krzysztof (1999)
Beiträge zur Algebra und Geometrie
Similarity:
Cohn, Henry, Kumar, Abhinav (2004)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity: