Related papers: Cyclic and well-rounded lattices

We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum…

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…

This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…

Let $V$ be a complete discrete valuation ring with residue field $\mathbb{F}$. We define a cyclic homology theory for algebras over $\mathbb{F}$, by lifting them to free algebras over $V$, which we enlarge to tube algebras and complete…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…

Lattices with a circulant generator matrix represent a subclass of cyclic lattices. This subclass can be described by a basis containing a vector and its circular shifts. In this paper, we present certain conditions under which the norm…

We classify the polycyclic totally ordered simple dimension groups, i.e. dimension groups given by a dense embedding of n-dimensional lattice into the real line. Our method is based on the geometry of simple geodesics on the hyperbolic…

Formulas about the side lengths, diagonal lengths or radius of the circumcircle of a cyclic polygon in Euclidean geometry, hyperbolic geometry or spherical geometry can be unified.

We give a historical perspective on the role of the cyclic category in the development of cyclic theory. This involves a continuous interplay between the extension in characteristic one and in S-algebras, of the traditional development of…

The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…

In this paper, we study some repeated-root two-dimensional cyclic and constacyclic codes over a finite field $F=\mathbb{F}_q$. We obtain the generator matrices and generator polynomials of these codes and their duals. We also investigate…

In this note, we introduce the notion of an unramified strongly cyclic covering for a cyclic curve, a class that has similar properties to, and contains, unramified double covers of hyperelliptic curves. We determine several of their basic…

We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex or a path, the arithmetical rank equals the projective dimension.

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

In this paper we describe an algorithm for classifying orbits of vectors in Lorentzian lattices. The main point of this is that isomorphism classes of positive definite lattices in some genus often correspond to orbits of vectors in some…

Modular categories are important algebraic structures in a variety of subjects in mathematics and physics. We provide an explicit, motivated and elementary definition of a modular category over a field of characteristic 0 as an equivalence…