Related papers: CSLs of the root lattice $\mathbf{A_4}$
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…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
Even though a lattice and its sublattices have the same group of coincidence isometries, the coincidence index of a coincidence isometry with respect to a lattice $\Lambda_1$ and to a sublattice $\Lambda_2$ may differ. Here, we examine the…
In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…
We study the conformal bootstrap for systems of correlators involving non-identical operators. The constraints of crossing symmetry and unitarity for such mixed correlators can be phrased in the language of semidefinite programming. We…
It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…
The groups of (linear) similarity and coincidence isometries of certain modules in d-dimensional Euclidean space, which naturally occur in quasicrystallography, are considered. It is shown that the structure of the factor group of…
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…
Simple cubic lattice (SC lattice) can be viewed as plane triangular lattice (PT lattice) by viewing it along its principle diagonal lines. By viewing thus we establish the exact one-to-one correspondence between the closed graphs on SC…
The relationship between the coincidence indices of a lattice $\Gamma_1$ and a sublattice $\Gamma_2$ of $\Gamma_1$ is examined via the colouring of $\Gamma_1$ that is obtained by assigning a unique colour to each coset of $\Gamma_2$. In…
A linked system of symmetric designs (LSSD) is a $w$-partite graph ($w\geq 2$) where the incidence between any two parts corresponds to a symmetric design and the designs arising from three parts are related. The original construction for…
We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…
Rooted acyclic graphs appear naturally when the phylogenetic relationship of a set $X$ of taxa involves not only speciations but also recombination, horizontal transfer, or hybridization, that cannot be captured by trees. A variety of…
We give a formula for the number of symmetric tilings of hexagons on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent non-opposite sides. We show that for certain families of such regions,…
We study linear relations among correlation functions on a lattice obtained from integration-by-parts identities. We use the framework of twisted cocycles and determine for a scalar theory a basis of correlation functions, in which all…
We present a simple, but efficient, way to calculate connection matrices between sets of independent local solutions, defined at two neighboring singular points, of Fuchsian differential equations of quite large orders, such as those found…
We simulated the fourier transform of the correlation function of the Ising model in two and three dimensions using a single cluster algorithm with improved estimators. The simulations are in agreement with series expansion and the…
We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…
Alignment is a geometric relation between pairs of Weyl-Heisenberg SICs, one in dimension $d$ and another in dimension $d(d-2)$, manifesting a well-founded conjecture about a number-theoretical connection between the SICs. In this paper, we…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…