Related papers: A complete isometry classification of 3-dimensiona…
We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup.…
Under hypotheses required for the Taylor-Wiles method, we prove for forms of $U(3)$ which are compact at infinity that the lattice structure on upper alcove algebraic vectors or on principal series types given by the $\lambda$-isotypic part…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded…
Lattice universes are spatially closed space-times of spherical topology in the large, containing masses or black holes arranged in the symmetry of a regular polygon or polytope. Exact solutions for such spacetimes are found in 2+1…
It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…
Using the combinatorics of two interpenetrating face centered cubic lattices together with the part of calculus naturally encoded in combinatorial topology, we construct from first principles a lattice model of 3D incompressible…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
In this paper we discuss the classification rank $3$ lattices preserved by finite orthogonal groups of isometries and derive from it the classification of regular polyhedra in the $3$-dimensional torus. This classification is highly related…
Here we briefly discuss lattices in Euclidean spaces and spaces of lattices, which are basic objects that can be described in terms of matrices and are important settings in classical analysis.
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
Lattices and Z-modules in Euclidean space possess an infinitude of subsets that are images of the original set under similarity transformation. We classify such self-similar images according to their indices for certain 4D examples that are…
An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…
We classify simply-connected homogeneous ($D+1$)-dimensional spacetimes for kinematical and aristotelian Lie groups with $D$-dimensional space isotropy for all $D\geq 0$. Besides well-known spacetimes like Minkowski and (anti) de Sitter we…
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…
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…
A collection of vectors in a real vector space is called a unimodular system if any of its maximal linearly independent subsets generates the same free abelian group. This notion is closely connected with totally unimodular matrices: rows…
An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by White in 1964. In dimension four, the same task was started in 1988 by Mori, Morrison, and Morrison,…