Displaying similar documents to “Voronoĭ type criteria for lattice coverings with balls”

Classification systems and their lattice

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...

Some generalization of Steinhaus' lattice points problem

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.

Dual Lattice of ℤ-module Lattice

Yuichi Futa, Yasunari Shidama (2017)

Formalized Mathematics

Similarity:

In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic...