Related papers: Lattice Reduction over Imaginary Quadratic Fields

I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…

We formulate the theory of a 2-form gauge field on a Euclidean spacetime lattice. In this approach, the fundamental degrees of freedom live on the faces of the lattice, and the action can be constructed from the sum over Wilson surfaces…

The full lattice convergence on a locally solid Riesz space is an abstraction of the topological, order, and relatively uniform convergences. We investigate four modifications of a full convergence $\mathbb{c}$ on a Riesz space. The first…

We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied to face lattices of polyhedra and to various generalizations…

Let $E=\mathbb{Q}\big(\sqrt{-d}\big)$ be an imaginary quadratic field for a square-free positive integer $d$, and let $\mathcal{O}$ be its ring of integers. For each positive integer $m$, let $I_m$ be the free Hermitian lattice over…

We study the reduction modulo $l$ of some elliptic representations; for each of these representations, we give a particular lattice naturally obtained by parabolic induction in giving the graph of extensions between its irreducible…

In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role…

In this paper we propose a new algorithm for obtaining the rational integrals of the full Kostant-Toda lattice. This new approach is based on a reduction of a bi-Hamiltonian system on gl(n,R). This system was obtained by reducing the space…

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…

We discuss a proposal for a continued fraction-like algorithm to determine simultaneous rational approximations to $d$ real numbers $\alpha_1,\ldots,\alpha_d$. It combines an algorithm of Hermite and Lagarias with ideas from LLL-reduction.…

We prove tight probabilistic bounds for the shortest vectors in module lattices over number fields using the results of arXiv:2308.15275. Moreover, establishing asymptotic formulae for counts of fixed rank matrices with algebraic integer…

We construct a torsion-free arithmetic lattice in $\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))\times\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))$ arising from a quaternion algebra over $\mathbb{F}_2(z)$. It is the fundamental group of a square complex…

An algorithm for embedding finite dimensional Lie algebras into Lie algebras of vector fields (and Lie superalgebras into Lie superalgebras of vector fields) is offered in a way applicable over ground fields of any characteristic. The…

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…

We show that the transition laws for a 2-connection can be recovered by discretizing the base 2-space of a 2-bundle into an Euclidean hypercubic lattice. The aim of this work is to serve as an example of how important results in higher…

We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…

The recovery of sparse data is at the core of many applications in machine learning and signal processing. While such problems can be tackled using $\ell_1$-regularization as in the LASSO estimator and in the Basis Pursuit approach,…

The Euclidean algorithm in algebra is applied to a class of gravitational lenses for which the lens equation consists of any set of coupled polynomial equations in the image position. In general, this algorithm allows us to reduce an…