Related papers: Multi-dimensional Kronecker Sequences with a Small…
The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…
The three distance theorem states that for any given irrational number $\alpha$ and a natural number $n$, when the interval $( 0, 1 )$ is divided into $n+1$ subintervals by integer multiples of $\alpha$, namely, $\{0\}, \{ \alpha \}, \{…
The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…
A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…
The classical Erd\H{o}s-Szekeres theorem dating back almost a hundred years states that any sequence of $(n-1)^2+1$ distinct real numbers contains a monotone subsequence of length $n$. This theorem has been generalised to higher dimensions…
We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…
In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…
The Three Gap Theorem, also known as the Steinhaus Conjecture, is a classical result on the combinatorics of the fractional part function, and has since been generalized in many ways. In this paper, we pose a new problem related to these…
Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
The codimension-three conjecture states that any regular holonomic module extends uniquely beyond an analytic subset with codimension equal to or larger than three. We give a proof of this conjecture.
Dean conjectured that for each integer $k \ge 3$, every graph with minimum degree at least $k$ has a cycle whose length is divisible by $k$; this conjecture is known to be true for all $k\neq 5$. For $k\in\{3,4\}$, stronger statements are…
Various upper and lower bounds are provided for the (angular) Kronecker constants of sets of integers. Some examples are provided where the bounds are attained. It is proved that 5=16 bounds the angular Kronecker constants of 3-element sets…
In this article we introduce the notion of badly approximable matrices of higher order using higher sucessive minima in $\mathbb R^d$. We prove that for order less than $d$, they have Lebesgue measure zero and the gaps between them still…
Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…
We present a method to obtain sets of vectors proving the Bell-Kochen-Specker theorem in dimension $n$ from a similar set in dimension $d$ ($3\leq d<n\leq 2d$). As an application of the method we find the smallest proofs known in dimension…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
We prove that any increasing sequence of real numbers with average gap $1$ and Poisson pair correlations has some gap that is at least $3/2+10^{-9}$. This improves upon a result of Aistleitner, Blomer, and Radziwill.
We define a dimension for a triangulated category. We prove a representabilityTheorem for a certain class of functors on finite dimensional triangulatedcategories. We study the dimension of the boundedderived category of an algebra or a…
In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong…