English
Related papers

Related papers: Some constructions for the higher-dimensional thre…

200 papers

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Misha Rudnev

We are concerned with describing the structure of the set of points in the unit interval which, when subjected to rotation by irrational alpha modulo one, for all finite portions of the orbit contain at least as many points in the bottom…

Dynamical Systems · Mathematics 2011-06-06 David Ralston

Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…

Combinatorics · Mathematics 2023-09-28 Jack Anderson , Cristian Cobeli , Alexandru Zaharescu

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

Combinatorics · Mathematics 2024-07-08 Krishnendu Bhowmick

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…

Combinatorics · Mathematics 2016-09-06 Herbert Edelsbrunner , Ernst Mücke

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

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…

General Physics · Physics 2007-05-23 M. Akbari , M. T. Darvishi

We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…

Dynamical Systems · Mathematics 2013-03-20 Bing Li , Tomas Persson , Baowei Wang , Jun Wu

Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…

Computational Geometry · Computer Science 2019-03-08 Boris Aronov , Edward Y. Miller , Micha Sharir

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

Combinatorics · Mathematics 2023-03-21 Toby Aldape , Jingyi Liu , Gregory Pylypovych , Adam Sheffer , Minh-Quan Vo

Let $\Theta = (\theta_1,\theta_2,\theta_3)\in \mathbb{R}^3$. Suppose that $1,\theta_1,\theta_2,\theta_3$ are linearly independent over $\mathbb{Z}$. For Diophantine exponents $$ \alpha(\Theta) = \sup \{\gamma >0:\,\,\, \limsup_{t\to…

Number Theory · Mathematics 2010-12-09 Nikolay Moshchevitin

Let $\mathbb{F}_q$ be an arbitrary finite field, and $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Let $\Delta(\mathcal{E})$ be the set of distances determined by pairs of points in $\mathcal{E}$. By using the Kloosterman sums,…

Combinatorics · Mathematics 2020-07-31 Thang Pham , Le Anh Vinh

Let $S$ be a set of $n$ points in Euclidean $3$-space. Assign to each $x\in S$ a distance $r(x)>0$, and let $e_r(x,S)$ denote the number of points in $S$ at distance $r(x)$ from $x$. Avis, Erd\H{o}s and Pach (1988) introduced the extremal…

Combinatorics · Mathematics 2019-07-22 Konrad J. Swanepoel

In the literature, there have been several methods and definitions for working out if two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide means to measure distances (and explore…

Logic · Mathematics 2020-08-12 Michèle Friend , Mohamed Khaled , Koen Lefever , Gergely Székely

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 Euclidean distance matrix $D(\alpha)$ is defined by $D_{ij}=(\alpha_i-\alpha_j)^2$, where $\alpha=(\alpha_1,\ldots,\alpha_n)$ is a real vector. We prove that $D(\alpha)$ cannot be written as a sum of $\left[2\sqrt{n}-2\right]$ nonnegative…

Combinatorics · Mathematics 2016-07-28 Yaroslav Shitov

Given a set $X\subseteq\mathbb{R}^2$ of $n$ points and a distance $d>0$, the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$. Let $a_1(X) \geq a_2(X) \geq \cdots \geq a_m(X)$ denote the…

Combinatorics · Mathematics 2026-02-04 Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

We construct a class of real-valued nonnegative binary functions on a set of jointly distributed random variables, which satisfy the triangle inequality and vanish at identical arguments (pseudo-quasi-metrics). These functions are useful in…

Probability · Mathematics 2016-02-12 Ehtibar N. Dzhafarov , Janne V. Kujala

We estimate the number of incidences in a configuration of $m$ lines and $n$ points in dimension 3. The main term is $mn^{1/3}$ if we work over the real or complex numbers but $mn^{2/5}$ over finite fields. Both of these are optimal, aside…

Combinatorics · Mathematics 2014-12-05 János Kollár
‹ Prev 1 3 4 5 6 7 10 Next ›