Related papers: A Note on Projecting the Cubic Lattice

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

A sublattice of the three-dimensional integer lattice $\mathbb Z^3$ is called cubic sublattice if there exists a basis of the sublattice whose elements are pairwise orthogonal and of equal lengths. We show that for an integer vector…

We implement a proposal made in [arXiv:1107.4388] to determine the lattice spacing by matching the lattice vector correlator at a reference distance scale with the same correlator obtained by a dispersion relation based on the $R$-ratio…

The Closest Vector Problem (CVP) is a computational problem in lattices that is central to modern cryptography. The study of its fine-grained complexity has gained momentum in the last few years, partly due to the upcoming deployment of…

The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…

For $2 < p < p_0 \simeq 26.265$, the hyperplane section of the $l_p^n$-unit ball $B_p^n$ perpendicular to a^(n) = 1/sqrt(n) (1, ... ,1) for large $n$ has larger volume than the one orthogonal to a^(2) = 1/sqrt(2) (1,1,0, ...,0), as shown by…

A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…

We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…

Two lattice points are visible from one another if there is no lattice point on the open line segment joining them. Let $S$ be a finite subset of $\mathbb{Z}^k$. The asymptotic density of the set of lattice points, visible from all points…

We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…

An existence result is presented for the worst-case error of lattice rules for high dimensional integration over the unit cube, in an unanchored weighted space of functions with square-integrable mixed first derivatives. Existing studies…

Additive CA on a cylinder of size $n$ can be represented by 01-string $V$ of length $n$ which is its rule. We study a problem: a class $S$ of rules given, for any $V\in S$ describe all sizes $n', n'>n,$ of cylinders such that extension of…

Let $L$ be any integral lattice in the 2-dimensional Euclidean space. Generalizing the earlier works of Hiroshi Maehara and others, we prove that for every integer $n>0$, there is a circle in the plane $\mathbb{R}^{2}$ that passes through…

If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…

Experimental designs that spread out points apart from each other on projections are important for computer experiments when not necessarily all factors have substantial influence on the response. We provide a theoretical framework to…

Let $\Gamma$ denote a lattice in $SU(1,p)$, with $p$ greater than 1. We show that there exists no Zariski dense maximal representation with target $SU(m,n)$ if $n>m>1$. The proof is geometric and is based on the study of the rigidity…