The polytopes in a Poisson hyperplane tessellation
classification
🧮 math.PR
math.MG
keywords
polytopescombinatorialeveryhyperplaneinfinitelyoftenpoissonprobability
read the original abstract
For a stationary Poisson hyperplane tessellation $X$ in ${\mathbb R}^d$, whose directional distribution satisfies some mild conditions (which hold in the isotropic case, for example), it was recently shown that with probability one every combinatorial type of a simple $d$-polytope is realized infinitely often by the polytopes of $X$. This result is strengthened here: with probability one, every such combinatorial type appears among the polytopes of $X$ not only infinitely often, but with positive density.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.