Chirotopes of Random Points in Space are Realizable on a Small Integer Grid

01/22/2020
by   Jean Cardinal, et al.
0

We prove that with high probability, a uniform sample of n points in a convex domain in ℝ^d can be rounded to points on a grid of step size proportional to 1/n^d+1+ϵ without changing the underlying chirotope (oriented matroid). Therefore, chirotopes of random point sets can be encoded with O(nlog n) bits. This is in stark contrast to the worst case, where the grid may be forced to have step size 1/2^2^Ω(n) even for d=2. This result is a high-dimensional generalization of previous results on order types of random planar point sets due to Fabila-Monroy and Huemer (2017) and Devillers, Duchon, Glisse, and Goaoc (2018).

READ FULL TEXT

page 1

page 2

research
12/20/2018

On Order Types of Random Point Sets

Let P be a set of n random points chosen uniformly in the unit square. I...
research
04/03/2018

A Constant Step Stochastic Douglas-Rachford Algorithm with Application to Non Separable Regularizations

The Douglas Rachford algorithm is an algorithm that converges to a minim...
research
03/18/2020

Convex Hulls of Random Order Types

We establish the following two main results on order types of points in ...
research
08/05/2019

Extending the step-size restriction for gradient descent to avoid strict saddle points

We provide larger step-size restrictions for which gradient descent base...
research
11/18/2019

WITCHcraft: Efficient PGD attacks with random step size

State-of-the-art adversarial attacks on neural networks use expensive it...
research
07/30/2020

Many Order Types on Integer Grids of Polynomial Size

Two point configurations {p_1,…,p_n} and {q_1,…,q_n} are of the same ord...
research
12/01/2021

The (1+1)-ES Reliably Overcomes Saddle Points

It is known that step size adaptive evolution strategies (ES) do not con...

Please sign up or login with your details

Forgot password? Click here to reset