Related papers: Cyclic and well-rounded lattices
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
Let k be an algebraically closed field of characteristic 0. We prove that any division algebra over k(x,y) whose ramification locus lies on a quartic curve is cyclic.
In the present article, we provide examples of fake quadrics, that is, minimal complex surfaces of general type with the same numerical invariants as the smooth quadric in $\PP ^3$ which are quotients of the bidisc by an irreducible lattice…
A lattice-type regularization of the supersymmetric field theories on a supersphere is constructed by approximating the ring of scalar superfields by an integer-valued sequence of finite dimensional rings of supermatrices and by using the…
Periodic lattices are natural generalizations of lattices, which arise naturally in diophantine approximations with rationals of bounded denominators. In this paper, we prove analogues of classical theorems in geometry of numbers for…
By Dirichlet's Unit Theorem, under the log embedding the units in the ring of integers of a number field form a lattice, called the log-unit lattice. We investigate the geometry of these lattices when the number field is a biquadratic or…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
We construct a family of quartic polynomials with cyclic Galois group and show that the roots of the polynomials are fundamental units or generate a subgroup of index 5.
We generalize the definition and properties of root systems to complex reflection groups - roots become rank one projective modules over the ring of integers of a number field k. In the irreducible case, we provide a classification of root…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
We study those Lagrangian surfaces in complex Euclidean space which are foliated by circles or by straight lines. The former, which we call cyclic, come in three types, each one being described by means of, respectively, a planar curve, a…
An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…
We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
In this paper, we investigate the properties of well-rounded twists of a given ideal lattice of an imaginary quadratic field $K$. We show that every ideal lattice $I$ of $K$ has at least one well-rounded twist lattice. Moreover, we provide…
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…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…