English
Related papers

Related papers: On lattices over Fermat function fields

200 papers

We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

Number Theory · Mathematics 2025-11-05 Lenny Fukshansky , Evelyne Knight

Let $\Gamma(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $\mathbb F$ and, for $t\in \mathbb{N}\setminus \{0\}$, let $\Delta_t(n,k)$ be the subgraph of $\Gamma(n,k)$…

Combinatorics · Mathematics 2021-07-13 Ilaria Cardinali , Luca Giuzzi , Mariusz Kwiatkowski

Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…

In the first paper of this series, we constructed a family of lattices in dimensions 2^{n+1} for positive integers n, and proved that the associated lattice packings of spheres equal or exceed the previous records for several values of n.…

Number Theory · Mathematics 2007-05-23 Noam D. Elkies

In this paper we generalize to higher dimensions several types of fermion actions on the hyperdiamond lattice including a two-parameter class of minimal-doubling fermions "Creutz fermion" and a simple fermion with sufficient discrete…

High Energy Physics - Lattice · Physics 2010-04-21 Taro Kimura , Tatsuhiro Misumi

Divergence functions of a metric space estimate the length of a path connecting two points $A$, $B$ at distance $\le n$ avoiding a large enough ball around a third point $C$. We characterize groups with non-linear divergence functions as…

Group Theory · Mathematics 2017-06-14 Cornelia Drutu , Shahar Mozes , Mark Sapir

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

Information Theory · Computer Science 2021-07-27 Lingfei Jin , Liming Ma , Chaoping Xing

Given a family ${\mathcal F}$ of shapes in the plane, we study what is the lowest possible density of a point set $P$ that pierces (``intersects'', ``hits'') all translates of each shape in ${\mathcal F}$. For instance, if ${\mathcal F}$…

Computational Geometry · Computer Science 2025-10-28 Adrian Dumitrescu , Arsenii Sagdeev , Josef Tkadlec

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

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

Combinatorics · Mathematics 2017-08-18 Kai-Uwe Schmidt

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

Number Theory · Mathematics 2024-12-17 Jens Marklof

The rhombus tilings of a simply connected domain of the Euclidean plane are known to form a flip-connected space (a flip is the elementary operation on rhombus tilings which rotates 180{\deg} a hexagon made of three rhombi). Motivated by…

Discrete Mathematics · Computer Science 2011-12-07 Olivier Bodini , Thomas Fernique , Michael Rao , Eric Remila

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

Information Theory · Computer Science 2016-04-07 Xiaolu Hou , Frédérique Oggier

We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice…

Number Theory · Mathematics 2024-10-02 Serge Vlăduţ

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

Information Theory · Computer Science 2012-04-10 D. Kapetanovic , H. V. Cheng , W. H. Mow , F. Rusek

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

Metric Geometry · Mathematics 2023-12-19 Maxwell Forst , Lenny Fukshansky

For integers $0 \leq m \leq l \leq n-m$, the truncated Boolean lattice ${\cal B}_n(m,l)$ is the poset of all subsets of $[n] = \{1, 2, \ldots, n\}$ which have size at least $m$ and at most $l$. ${\cal C} \subseteq {\cal B}_n(m,l)$ is a {\em…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok

Few-body physics plays a central role in many branches of physics, such as nuclear physics and atomic physics. Advances in controlling ultra-cold quantum gases provide an ideal testbed for few-body physics theory. In this work, we study…

Quantum Gases · Physics 2026-01-09 Zihan Li , Son T. Nguyen

We introduce the Symplectic Grassmann codes as projective codes defined by symplectic Grassmannians, in analogy with the orthogonal Grassmann codes introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special class of…

Information Theory · Computer Science 2015-10-05 Ilaria Cardinali , Luca Giuzzi

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