English
Related papers

Related papers: On Lattice Coverings by Simplices

200 papers

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…

Number Theory · Mathematics 2024-10-07 Camilla Hollanti , Guillermo Mantilla-Soler , Niklas Miller

We consider the problem of identifying the worst point-symmetric shape for covering n-dimensional Euclidean space with lattice translates. Here we focus on the dimensions where the thinnest lattice covering with balls is known and ask…

Metric Geometry · Mathematics 2017-08-11 Yoav Kallus

We prove lower bounds on the density of regular minimal cones of dimension less than seven provided the complements of the cones are topologically nontrivial.

Differential Geometry · Mathematics 2025-07-23 Jacob Bernstein , Lu Wang

We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…

Number Theory · Mathematics 2007-07-08 Philippe Gaborit , Gilles Zemor

We derive an explicit formula for the volume of a regular simplex in the hyperbolic space of any dimension.

Metric Geometry · Mathematics 2025-11-18 Zakhar Kabluchko , Philipp Schange

We study flat metrics arising from right regular $n$-prisms by viewing them as $n$-differentials and analyzing their associated unfoldings. We show that the unfolding of a right regular $n$-prism is never a lattice surface unless $n=4$, in…

Geometric Topology · Mathematics 2026-05-11 Xun Gong , Zuo Lin , Anthony Sanchez

An empty simplex is a lattice simplex in which vertices are the only lattice points. We show two constructions leading to the first known empty simplices of width larger than their dimension: - We introduce cyclotomic simplices and…

Combinatorics · Mathematics 2025-02-05 Joseph Doolittle , Lukas Katthän , Benjamin Nill , Francisco Santos

1) We present new lattice sphere packings in Euclid spaces of many dimensions in the range 3332-4096, which are denser than known densest Mrodell-Weil lattice sphere packings in these dimensions. Moreover it is proved that if there were…

Number Theory · Mathematics 2012-06-01 Hao Chen

We give a lower bound for the degree of a finite cover of a hyperbolic 3-manifold which fibers over the circle, in terms of volume, the diameter of the manifold and other new invariants.

Geometric Topology · Mathematics 2021-09-23 Inkang Kim , Hongbin Sun

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 $ B_h $ set (or Sidon set of order $ h $) in an Abelian group $ G $ is any subset $ \{b_0, b_1, \ldots,b_{n}\} $ of $ G $ with the property that all the sums $ b_{i_1} + \cdots + b_{i_h} $ are different up to the order of the summands.…

Combinatorics · Mathematics 2020-08-13 Mladen Kovačević , Vincent Y. F. Tan

I give a brief introduction to lattice QCD for non-specialists.

High Energy Physics - Lattice · Physics 2015-01-20 Christian Hoelbling

This note presents an interesting counterexample to a basic covering problem.

Metric Geometry · Mathematics 2014-02-21 Fei Xue , Chuanming Zong

In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…

Information Theory · Computer Science 2015-06-17 Srikanth B. Pai , B. Sundar Rajan

In this note we show that the volume of axis-parallel boxes in $\mathbb{R}^d$ which do not intersect an admissible lattice $\mathbb{L}\subset\mathbb{R}^d$ is uniformly bounded. In particular, this implies that the dispersion of the dilated…

Computational Geometry · Computer Science 2021-08-16 Mario Ullrich

The goal of the article is to provide different explicit quantifications of the non density of simple closed geodesics on hyperbolic surfaces. In particular, we show that within any embedded metric disk on a surface, lies a disk of radius…

Geometric Topology · Mathematics 2018-06-05 Peter Buser , Hugo Parlier

The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform very well under iterative decoding algorithm. In this work, we…

Information Theory · Computer Science 2012-04-12 Mohammad-Reza Sadeghi , Amin Sakzad

The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…

Number Theory · Mathematics 2026-01-26 Chahat Ahuja

Random simplices and more general random convex bodies of dimension $p$ in $\mathbb{R}^n$ with $p\leq n$ are considered, which are generated by random vectors having an elliptical distribution. In the high-dimensional regime, that is, if…

Probability · Mathematics 2023-08-17 Anna Gusakova , Johannes Heiny , Christoph Thäle

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
‹ Prev 1 3 4 5 6 7 10 Next ›