Sharp estimates on random hyperplane tessellations

DOI10.1137/22M1485826MaRDI QIDQ6388220arXivFDO

Authors Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk

Publication date 13 January 2022

Published in arXiv

Full work available at URL https://doi.org/10.1137/22M1485826

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Geometric probability and stochastic geometry (60D05)

arXiv classification

cs.ITmath.ITmath.PR

Abstract: We study the problem of generating a hyperplane tessellation of an arbitrary set $T$ in $mathbb{R}^n$, ensuring that the Euclidean distance between any two points corresponds to the fraction of hyperplanes separating them up to a pre-specified error $delta$. We focus on random gaussian tessellations with uniformly distributed shifts and derive sharp bounds on the number of hyperplanes $m$ that are required. Surprisingly, our lower estimates falsify the conjecture that $msimel{l}_{\ast }^2(T)/delt{a}^2$, where $el{l}_{\ast }^2(T)$ is the gaussian width of $T$, is optimal.

This page was built for publication: Sharp estimates on random hyperplane tessellations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6388220)