Roudneff's Conjecture in Dimension 4

03/24/2023
by   Rangel Hernández-Ortiz, et al.
0

J.-P. Roudneff conjectured in 1991 that every arrangement of n ≥ 2d+1≥ 5 pseudohyperplanes in the real projective space ℙ^d has at most ∑_i=0^d-2n-1i 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2022

Arrangements of Pseudocircles: On Digons and Triangles

In this article, we study the cell-structure of simple arrangements of p...
research
01/27/2023

Proof of a conjecture of Krawchuk and Rampersad

We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal beh...
research
07/12/2023

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise

The discrepancy of a matrix M ∈ℝ^d × n is given by DISC(M) := min_x∈{-1,...
research
10/26/2022

Optimal Patrolling Strategies for Trees and Complete Networks

We present solutions to a continuous patrolling game played on network. ...
research
07/24/2020

Ample completions of OMs and CUOMs

This paper considers completions of COMs (complexes oriented matroids) t...
research
06/01/2018

The real tau-conjecture is true on average

Koiran's real τ-conjecture claims that the number of real zeros of a str...
research
12/21/2020

A Journey to the Frontiers of Query Rewritability

This paper is about (first order) query rewritability in the context of ...

Please sign up or login with your details

Forgot password? Click here to reset