相关论文: Constructions of well-rounded algebraic lattices o…
This paper is devoted to the study of lattices generated by finite Abelian groups. Special species of such lattices arise in the exploration of elliptic curves over finite fields. In case the generating group is cyclic, they are also known…
Twisted modules over vertex algebras formalize the relations among twisted vertex operators and have applications to conformal field theory and representation theory. A recent generalization, called twisted logarithmic module, involves the…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…
We study ideal lattices constructed from totally definite quaternion algebras over totally real number fields, and generalize the definition of Arakelov-modular lattices over number fields. In particular, we prove for the case where the…
We review a lattice construction arising from quaternion algebras over number fields and use it to obtain some known extremal and densest lattices in dimensions 8 and 16. The benefit of using quaternion algebras over number fields is that…
It is well-known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice…
We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…
We study algebras encoding stable range branching rules for the pairs of complex classical groups of the same type in the context of toric degenerations of spherical varieties. By lifting affine semigroup algebras constructed from…
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…
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…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…
The main goal of this article is to introduce BL-rings, i.e., commutative rings whose lattices of ideals can be equipped with a structure of BL-algebra. We obtain a description of such rings, and study the connections between the new class…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
An Arakelov-modular lattice of level $\ell$, where $\ell$ is a positive integer, is an $\ell-$modular lattice constructed from a fractional ideal of a CM field such that the lattice can be obtained from its dual by multiplication of an…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
Fix a prime number $p$. We report on some recent developments in algebraic geometry (broadly construed) over $p$-adically complete commutative rings. These developments include foundational advances within the subject as well as external…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with 2^X compact elements. We show that every algebraic lattice with at most 2^X compact elements is a complete sublattice of Cl(X).