Related papers: Integral distances from (two) lattice points
A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…
We perform a tree-level O(a) improvement of two-dimensional N=(2,2) supersymmetric Yang-Mills theory on the lattice, motivated by the fast convergence in numerical simulations. The improvement respects an exact supersymmetry Q which is…
In 2021, Hibi et. al. studied lattice points in $\mathbb{N}^2$ that appear as $(\depth R/I,\dim R/I)$ when $I$ is the edge ideal of a graph on $n$ vertices, and showed these points lie between two convex polytopes. When restricting to the…
Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…
Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…
We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…
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…
Consider lattice paths in Z^2 taking unit steps north (N) and east (E). Fix positive integers r,s and put an equivalence relation on points of Z^2 by letting v,w be equivalent if v - w = m (r,s) for some m in Z. Call a lattice path valid if…
We establish sharp lower and upper bounds for the number of integral points near dilations of a space curve with nowhere vanishing torsion.
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
We propose a new method to construct maximin distance designs with arbitrary number of dimensions and points. The proposed designs hold interleaved-layer structures and are by far the best maximin distance designs in four or more…
We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.
In this paper, we prove that two different observers don't equally measure the distance between two points A and B. For this, we introduce some postulates and obtain a new formula to show distance between A and B. In this formula, radius of…
A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…
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…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
We examine the link approach to constructing a lattice theory of N=2 super Yang Mills theory in two dimensions. The goal of this construction is to provide a discretization of the continuum theory which preserves all supersymmetries at…