Related papers: Generalised Checkerboard Lattices
That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…
We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.
A subalgebra $\mathcal{A}$ of a $C^*$-algebra $\mathcal{M}$ is logmodular (resp. has factorization) if the set $\{a^*a; a\text{ is invertible with }a,a^{-1}\in\mathcal{A}\}$ is dense in (resp. equal to) the set of all positive and…
We classify all the lattices realized as the intersection form of a positive definite four manifold with boundary $S_n^3(K)$ for a knot $K$ in the three sphere and a positive integer $n$ greater than $4g_4(K)+3$. We then use this result to…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…
The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…
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 characterize the order of principal congruences of a bounded lattice (also of a complete lattice and of a lattice of length 5) as a bounded ordered set. We also state a number of open problems in this new field.
The Narain lattice construction of string compactifications is generalized to include spontaneously broken supersymmetry. Consistency conditions from modular invariance and Lorentz symmetry are solved in full generality. This framework…
We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…
This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for…
Conference matrices are used to define complex structures on real vector spaces. Certain lattices in these spaces become modules for rings of quadratic integers. Multiplication of these lattices by non-principal ideals yields simple…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…
Differential-difference integrable exponential type systems are studied corresponding to the Cartan matrices of semi-simple or affine Lie algebras. For the systems corresponding to the algebras $A_2$, $B_2$, $C_2$, $G_2$ the complete sets…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
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…
We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an…