English
Related papers

Related papers: On the Maximum Flatness Factor over Unimodular Lat…

200 papers

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…

Number Theory · Mathematics 2023-06-22 Lenny Fukshansky , David Kogan

Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…

High Energy Physics - Theory · Physics 2026-04-30 Madhav Sinha , Thiago Silva Tavares , Hubert Saleur , Ananda Roy

After recalling the notion of higher roots (or hyper-roots) associated with "quantum modules" of type $(G, k)$, for $G$ a semi-simple Lie group and $k$ a positive integer, following the definition given by A. Ocneanu in 2000, we study the…

Quantum Algebra · Mathematics 2024-09-06 Robert Coquereaux

Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai's construction of a collision resistant Hash function (see \cite{M1}…

Information Theory · Computer Science 2021-12-28 Zhiyong Zheng , Fengxia Liu , Yunfan Lu , Kun Tian

An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is…

Exactly Solvable and Integrable Systems · Physics 2017-01-27 J. Frauendiener , C. Jaber , C. Klein

In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard to solve unless…

Cryptography and Security · Computer Science 2017-10-09 Zhe Li , San Ling , Chaoping Xing , Sze Ling Yeo

In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory…

Information Theory · Computer Science 2025-04-18 Zhiyong Zheng , Fengxia Liu , Kun Tian

Two classical upper bounds on the Shannon capacity of graphs are the $\vartheta$-function due to Lov\'asz and the minrank parameter due to Haemers. We provide several explicit constructions of $n$-vertex graphs with a constant…

Data Structures and Algorithms · Computer Science 2018-02-22 Ishay Haviv

Lattice-based cryptography relies on generating random bases which are difficult to fully reduce. Given a lattice basis (such as the private basis for a cryptosystem), all other bases are related by multiplication by matrices in…

Cryptography and Security · Computer Science 2021-05-20 Tamar Lichter Blanks , Stephen D. Miller

We study the error of the number of points of a unimodular lattice that fall in a strictly convex and analytic set having the origin and that is dilated by a factor $t$. The aim is to generalize the result of a previous article. We first…

Probability · Mathematics 2022-11-08 Julien Trevisan

Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…

Information Theory · Computer Science 2015-10-28 Cong Ling

The Hlawka Zeta Function is a Dirichlet series defined geometrically which provides an integral representation of the number of lattice points contained in the dilation $tD$ for some star shaped region $D\subset \mathbb{R}^{2}$ and some…

Number Theory · Mathematics 2020-07-01 Michael Montoro

In this paper we investigate the elastic properties of the vortex lattice for a superconducting film of finite thickness. We derive an analytic expression for the compression modulus. The shear modulus is evaluated numerically by using both…

Superconductivity · Physics 2007-05-23 Edson Sardella

The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some…

Algebraic Geometry · Mathematics 2026-03-30 András Némethi , Gergő Schefler

Modulated symmetries are internal symmetries that are not invariant under spacetime symmetry actions. We propose a general way to describe the lattice translation modulated symmetries in 1+1D, including the non-invertible ones, via the…

Strongly Correlated Electrons · Physics 2025-12-09 Ching-Yu Yao

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

Number Theory · Mathematics 2013-04-30 Fabrizio Barroero , Martin Widmer

Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…

Computational Complexity · Computer Science 2025-11-21 Antoine Joux

In this article, we study the relation between lattice basis and successive minima and give an estimate for the measure-theoretical distribution of successive minima. As consequences, we also discuss some logarithm laws associated to higher…

Number Theory · Mathematics 2023-01-02 Hao Xing

We consider a periodic lattice structure in $d=2$ or $3$ dimensions with unit cell comprising $Z$ thin elastic members emanating from a similarly situated central node. A general theoretical approach provides an algebraic formula for the…

Materials Science · Physics 2014-10-09 Andrew N. Norris

We present the results of a high-statistics Monte Carlo simulation of a phantom crystalline (fixed-connectivity) membrane with free boundary. We verify the existence of a flat phase by examining lattices of size up to $128^2$. The…

Condensed Matter · Physics 2009-10-28 M. Bowick , S. Catterall , M. Falcioni , G. Thorleifsson , K. Anagnostopoulos