Related papers: Lines in Every Direction with No ee-Random Points

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

We answer a question of Schleicher by showing that, for an exponential map with nonescaping singular value, every periodic ray lands. This is an analog of a theorem of Douady and Hubbard concerning polynomials. We also prove a partial…

An old problem in discrete geometry, originating with Kupitz, asks whether there is a fixed natural number $k$ such that every finite set of points in the plane has a line through at least two of its points where the number of points on…

Consider $n$ points $x_1,\ldots,x_n$ in finite-dimensional euclidean space, each having one of two colors. Suppose there exists a separating hyperplane (identified with its unit normal vector $w)$ for the points, i.e a hyperplane such that…

We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists a=a(D,C)>0 such that for any graph G, with n vertices and…

In first-passage percolation, one places nonnegative i.i.d. random variables (T(e)) on the edges of Z^d. A geodesic is an optimal path for the passage times T(e). Consider a local property of the time environment. We call it a pattern. We…

In~[1],authors considered a general finite horizon model of dynamic game of asymmetric information, where N players have types evolving as independent Markovian process, where each player observes its own type perfectly and actions of all…

It is shown that $n$ points and $e$ lines in the complex Euclidean plane ${\mathbb C}^2$ determine $O(n^{2/3}e^{2/3}+n+e)$ point-line incidences. This bound is the best possible, and it generalizes the celebrated theorem by Szemer\'edi and…

We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

We consider K-Facility Location games, where n strategic agents report their locations in a metric space, and a mechanism maps them to K facilities. Our main result is an elegant characterization of deterministic strategyproof mechanisms…

We show that for any natural number n, the set of domains containing absolutely periodic orbits of order n are dense in the set of bounded strictly convex domains with smooth boundary. The proof that such an orbit exists is an extension to…

Consider the Euclidean traveling salesman problem with $n$ random points on the plane. Suppose that one of the points is shifted to a new random location. This gives us a new optimal path. Consider such shifts for each of the $n$ points. Do…

Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_n$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\binom{n}{2}}$. Let $T$ be the earliest time at which $e_1$…

In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Atiyah's conjecture concerning configurations of N points in the Euclidean three-space is verified for the following nonplanar configurations: The first m points lie on a line L and the remaining n=N-m (>2) points are the vertices of a…

We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…

We consider two independent symmetric Markov random flights $\bold Z_1(t)$ and $\bold Z_2(t)$ performed by the particles that simultaneously start from the origin of the Euclidean plane $\Bbb R^2$ in random directions distributed uniformly…

We consider nonelementary random walks on general hyperbolic spaces. Without any moment condition on the walk, we show that it escapes linearly to infinity, with exponential error bounds. We even get such exponential bounds up to the rate…