2000 character limit reached
Roudneff's Conjecture in Dimension $4$
Published 24 Mar 2023 in math.CO and cs.DM | (2303.14212v1)
Abstract: J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}d$ has at most $\sum_{i=0}{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each hyperplane). The conjecture is true for $d=2,3$ and for arrangements arising from Lawrence oriented matroids. The main result of this manuscript is to show the validity of Roudneff's conjecture for $d=4$. Moreover, based on computational data we conjecture that the maximum number of complete cells is only obtained by cyclic arrangements.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.