English
Related papers

Related papers: Lines Missing Every Random Point

200 papers

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

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

Combinatorics · Mathematics 2020-12-16 Ben Lund , Giorgis Petridis

In this paper, we investigate the existence of a point in the plane of a unit polygon, that is at rational distance from each vertex of the polygon. A negative answer is obtained in almost all cases.

Number Theory · Mathematics 2009-12-16 Roy Barbara

In the present paper we focus on the coherence properties of general random Euclidean distance matrices, which are very closely related to the respective matrix completion problem. This problem is of great interest in several applications…

Information Theory · Computer Science 2013-05-14 Dionysios S. Kalogerias , Athina P. Petropulu

We prove that multidimensional diffusions in random environment have a limiting velocity which takes at most two different values. Further, in the two-dimensional case we show that for any direction, the probability to escape to infinity in…

Probability · Mathematics 2007-05-23 Laurent Goergen

We develop a general theory for percolation in directed random networks with arbitrary two point correlations and bidirectional edges, that is, edges pointing in both directions simultaneously. These two ingredients alter the previously…

Disordered Systems and Neural Networks · Physics 2009-11-11 M. Boguna , M. A. Serrano

Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…

Statistics Theory · Mathematics 2023-01-19 Alexander Heaton , Matthias Himmelmann

A central property of a classical geometry is that the geodesic distance between two events is \emph{additive}. When considering quantum fluctuations in the metric or a quantum or statistical superposition of different spacetimes,…

High Energy Physics - Theory · Physics 2023-09-06 Federico Piazza , Andrew J. Tolley

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…

Combinatorics · Mathematics 2012-06-29 Eiichi Bannai , Tsuyoshi Miezaki

Consider an i.i.d. sample from an unknown density function supported on an unknown manifold embedded in a high dimensional Euclidean space. We tackle the problem of learning a distance between points, able to capture both the geometry of…

Probability · Mathematics 2019-12-30 Pablo Groisman , Matthieu Jonckheere , Facundo Sapienza

Given a finite set of points $C \subseteq \mathbb{R}^d$, we say that an ordering of $C$ is protrusive if every point lies outside the convex hull of the points preceding it. We give an example of a set $C$ of $5$ points in the Euclidean…

Combinatorics · Mathematics 2023-09-25 Adrian Beker

Two damped coupled oscillators have been used to demonstrate the occurrence of exceptional points in a purely classical system. The implementation was achieved with electronic circuits in the kHz-range. The experimental results perfectly…

Quantum Physics · Physics 2009-11-10 T. Stehmann , W. D. Heiss , F. G. Scholtz

Linear systems under the influence of nonlinear and random linear perturbations, and with random initial and boundary conditions, are discussed. The notion of states of a system is substituted by the notion of the generating vectors for…

General Physics · Physics 2013-10-30 Jerzy Hanckowiak

In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…

Dynamical Systems · Mathematics 2021-01-27 Anna Klick , Nicolae Strungaru , Adi Tcaciuc

What distributions arise as the distribution of the distance between two typical points in some measured metric space? This seems to be a surprisingly subtle problem. We conjecture that every distribution with a density function whose…

Probability · Mathematics 2024-03-19 David J. Aldous , Guillaume Blanc , Nicolas Curien

We prove that the set of thick points of the log-correlated Gaussian field contains an unbounded path in sufficiently high dimensions. This contrasts with the two-dimensional case, where Aru, Papon, and Powell (2023) showed that the set of…

Probability · Mathematics 2026-02-05 Jian Ding , Ewain Gwynne , Zijie Zhuang

This paper is concerned with the existence of multiple points of Gaussian random fields. Under the framework of Dalang et al. (2017), we prove that, for a wide class of Gaussian random fields, multiple points do not exist in critical…

Probability · Mathematics 2021-02-03 Robert C. Dalang , Cheuk Yin Lee , Carl Mueller , Yimin Xiao

A non-Hermitean random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show…

Mathematical Physics · Physics 2007-05-23 Daniel E. Holz , Henri Orland , A. Zee

We derive logarithmic asymptotics of probabilities of small deviations for iterated processes in the space of trajectories. We find conditions under which these asymptotics coincide with those of processes generating iterated processes.…

Probability · Mathematics 2015-02-17 Andrei N. Frolov

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

Computational Geometry · Computer Science 2024-06-03 Ahmad Biniaz , Anil Maheshwari , Michiel Smid
‹ Prev 1 8 9 10 Next ›