Related papers: Modular Lattices from a Variation of Construction …

Let $\vartheta := \frac{-1+\sqrt{5}}{2}$ be the golden ratio. A golden lattice is an even unimodular $\Z[\vartheta ]$-lattice of which the Hilbert theta series is an extremal Hilbert modular form. We construct golden lattices from extremal…

The recently introduced Galois symmetries of RCFT are generalized, for the WZW case, to `quasi-Galois symmetries'. These symmetries can be used to derive a large number of equalities and sum rules for entries of the modular matrix S,…

We give an overview of universal quadratic forms and lattices, focusing on the recent developments over the rings of integers in totally real number fields. In particular, we discuss indecomposable algebraic integers as one of the main…

Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is…

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…

There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…

Motivated by the classical studies on transformations of conjugate nets, we develop the general geometric theory of transformations of their discrete analogues: the multidimensional quadrilateral lattices, i.e. lattices x: Z^N -> R^M, whose…

We discuss the following two problems: 1) The properties of the multiple zeta-values and their generalizations, multiple polylogarithms at N-th roots of unity; 2) The action of the absolute Galois group on the pro-l-completion of the…

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…

We study lattices acting on $\mathrm{CAT}(0)$ spaces via their commensurated subgroups. To do this we introduce the notions of a graph of lattices and a complex of lattices giving graph and complex of group splittings of $\mathrm{CAT}(0)$…

This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading…

We initiate the study of general metric lattices in the context of the model theory of metric structures. As an application we develop a theory of pseudo-finite limits of partition lattices and connect this theory with the theory of…

In this paper we study Cartan subalgebras in general and special linear algebras over a field of positive characteristic. We determined the conjugacy classes of Cartan subalgebras under the general linear groups, and count the explicit…

Let $p$ be a prime number and $r$ a non-negative integer. In this paper, we prove that there exists an anti-equivalence between the category of weak $(\varphi,\hat{G})$-modules of height $r$ and a certain subcategory of the category of…

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

We prove a modularity lifting theorem for minimally ramified deformations of two-dimensional odd Galois representations, over an arbitrary number field. The main ingredient is a generalization of the Taylor-Wiles method in which we patch…

We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…

Orders and fractional ideals in number fields provide interesting examples of lattices. We ask: what lattices arise from orders in number fields? We prove that all nontrivial multiplicative constraints on successive minima of orders come…