Densest Packings of Typical Convex Sets Are Not Lattice-Like .
Fejes G. Tóth (1995)
Discrete & computational geometry
Similarity:
Fejes G. Tóth (1995)
Discrete & computational geometry
Similarity:
Cohn, Henry, Kumar, Abhinav (2004)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
Bezdek, Károly (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Werner Georg Nowak (2007)
Acta Arithmetica
Similarity:
Smirnov, Yu.A. (2005)
Journal of Mathematical Sciences (New York)
Similarity:
W. Kuperberg, G. Kuperberg (1990)
Discrete & computational geometry
Similarity:
Werner Georg Nowak (2004)
Acta Arithmetica
Similarity:
Marcin Łazarz (2016)
Bulletin of the Section of Logic
Similarity:
In the paper we investigate Birkhoff’s conditions (Bi) and (Bi*). We prove that a discrete lattice L satisfies the condition (Bi) (the condition (Bi*)) if and only if L is a 4-cell lattice not containing a cover-preserving sublattice isomorphic to the lattice S*7 (the lattice S7). As a corollary we obtain a well known result of J. Jakub´ık from [6]. Furthermore, lattices S7 and S*7 are considered as so-called partially cover-preserving sublattices of a given lattice L, S7 ≪ L and S7...
H. Groemer (1986)
Monatshefte für Mathematik
Similarity:
Wolfgang Müller (2003)
Acta Arithmetica
Similarity:
U. Schnell (1995)
Discrete & computational geometry
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...
J. L. Ericksen (1982)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
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...