Related papers: Coincidence rotations of the root lattice $A_4$
The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…
In the present paper we study twisted foldings of root systems which generalize usual involutive foldings corresponding to automorphisms of Dynkin diagrams. Our motivating example is the Lusztig projection of the root system of type $E_8$…
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
A root lattice is a finite rank $\mathbb{Z}$-lattice generated by elements $x$ satisfying $x\cdot x=2$. It is well-known that the root lattices have an $ADE$ classification and they play a prominent role in the study of even unimodular…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…
Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. In this paper, we develop a general…
Regular ring lattices (RRLs) are defined as peculiar undirected circulant graphs constructed from a cycle graph, wherein each node is connected to pairs of neighbors that are spaced progressively in terms of vertex degree. This kind of…
A coincidence site lattice is a sublattice formed by the intersection of a lattice $\Gamma$ in $\mathbb{R}^d$ with the image of $\Gamma$ under a linear isometry. Such a linear isometry is referred to as a linear coincidence isometry of…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
We characterise the class of distributions of random stochastic matrices $X$ with the property that the products $X(n)X(n-1) ... X(1)$ of i.i.d. copies $X(k)$ of $X$ converge a.s. as $n \rightarrow \infty$ and the limit is Dirichlet…
For a left artinian ring A, we study the lattice torsA of torsion pairs in the category of finitely generated A-modules by considering an isomorphic lattice formed by certain closed sets in a topological space associated to A, the Ziegler…
We consider the symmetries of coincidence site lattices of 3-dimensional cubic lattices. This includes the discussion of the symmetry groups and the Bravais classes of the CSLs. We derive various criteria and necessary conditions for…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
We present a family of rank symmetric diamond-colored distributive lattices that are naturally related to the Fibonacci sequence and certain of its generalizations. These lattices re-interpret and unify descriptions of some un- or…
In this review, we count and classify certain sublattices of a given lattice, as motivated by crystallography. We use methods from algebra and algebraic number theory to find and enumerate the sublattices according to their index. In…
We classify integral rootless lattices which are sums of pairs of $EE_8$-lattices (lattices isometric to $\sqrt 2$ times the $E_8$-lattice) and which define dihedral groups of orders less than or equal to 12. Most of these may be seen in…
We show that lattice isomorphisms between lattices of slowly oscillating functions on chain-connected proper metric spaces induce coarsely equivalent homeomorphisms. This result leads to a Banach-Stone-like theorem for these lattices.…