English
Related papers

Related papers: On existence of integral point sets and their diam…

200 papers

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

Combinatorics · Mathematics 2025-12-16 N. N. Avdeev , E. A. Lushina

A point set $M$ in the Euclidean plane is called a planar integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on a straight line. A planar integral point set is called to be in…

Combinatorics · Mathematics 2019-07-23 N. N. Avdeev

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

Combinatorics · Mathematics 2019-11-12 Sascha Kurz , Reinhard Laue

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…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz , Alfred Wassermann

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

Combinatorics · Mathematics 2020-07-28 Hiroshi Nozaki , Masashi Shinohara

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…

Combinatorics · Mathematics 2021-03-30 Nikolai Avdeev , Ekaterina Momot , Aleksandr Zvolinskiy

We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…

Combinatorics · Mathematics 2021-11-23 N. N. Avdeev , R. E. Zvolinsky , E. A. Momot

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the…

Combinatorics · Mathematics 2008-04-09 Axel Kohnert , Sascha Kurz

We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…

Combinatorics · Mathematics 2014-01-20 Sascha Kurz , Harald Meyer

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

Combinatorics · Mathematics 2008-04-09 Andrey Radoslavov Antonov , Sascha Kurz

We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper density zero. We are interested in how…

Metric Geometry · Mathematics 2015-03-20 Sascha Kurz , Valery Mishkin

Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Sascha Kurz

Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Sascha Kurz

We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…

Metric Geometry · Mathematics 2009-03-12 Konrad J Swanepoel

The present work considers the properties of generally convex sets in the $n$-dimensional real Euclidean space $\mathbb{R}^n$, $n>1$, known as weakly $m$-convex, $m=1,2,\ldots,n-1$. An open set of $\mathbb{R}^n$ is called weakly $m$-convex…

Metric Geometry · Mathematics 2021-11-03 Tetiana Osipchuk

The midpoint set M(S) of a set S of points is the set of all midpoints of pairs of points in S. We study the largest cardinality of a midpoint set M(S) in a finite-dimensional normed space, such that M(S) is contained in the unit sphere,…

Metric Geometry · Mathematics 2011-08-26 Konrad J. Swanepoel

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

Combinatorics · Mathematics 2011-04-20 Hiroshi Nozaki

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Combinatorics · Mathematics 2025-09-03 Wei-Chun Chen , Wei-Hsuan Yu
‹ Prev 1 2 3 10 Next ›