Related papers: The Optimal Isodual Lattice Quantizer in Three Dim…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the…
We use inverse methods of statistical mechanics and computer simulations to investigate whether an isotropic interaction designed to stabilize a given two-dimensional (2D) lattice will also favor an analogous three-dimensional (3D)…
We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of…
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…
We consider pairwise interaction energies and we investigate their minimizers among lattices with prescribed minimal vectors (length and coordination number), i.e. the one corresponding to the crystal's bonds. In particular, we show the…
We introduce a parameter space for periodic point sets, given as unions of $m$ translates of point lattices. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality.…
We show that the set of all measures on any measurable space is a complete lattice, i.e. every collection of measures has both a greatest lower bound and a least upper bound.
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
This paper studies two topics concerning on the orthogonal complement of one dimensional subspace with respect to a given quadratic form on a vector space over a number field. One is to determine the invariants for the isomorphism class of…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
A sublattice of the three-dimensional integer lattice $\mathbb Z^3$ is called cubic sublattice if there exists a basis of the sublattice whose elements are pairwise orthogonal and of equal lengths. We show that for an integer vector…
In 2010, G\'{a}bor Cz\'{e}dli and E. Tam\'{a}s Schmidt mentioned that the best cover-preserving embedding of a given semimodular lattice is not known yet [A cover-preserving embedding of semimodular lattices into geometric lattices,…
We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell…
We provide a complete classification of well-rounded ideal lattices arising from real quadratic fields. We show that the ideals that give rise to such lattices are precisely the ones that correspond to divisors $a$ of the discriminant $d$…
We establish Schmutz Schaller's conjecture that the hexagonal lattice is `better' than the square lattice. Schmutz Schaller (Bulletin of the AMS 35 (1998), p. 201), motivated by considerations from hyperbolic geometry, conjectured that in…
Body-centered Cubic (BCC) lattice structures demonstrate promising performance for applications that require simultaneous mechanical energy absorption and thermal management. However, current optimization approaches are typically confined…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.
We prove the following result: Theorem. Every algebraic distributive lattice D with at most $\aleph\_1$ compact elements is isomorphic to the ideal lattice of a von Neumann regular ring R. (By earlier results of the author, the $\aleph\_1$…