ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix integers m≥4m\geq4 and n≥mn\geq m. Consider the m−1m-1 coordinate hyperplanes in Rm−1\mathbb R^{m-1} and add nn further hyperplanes. Bounded-region realization conjecture. For every integer kk satisfying

1≤k≤(n+m−2m−1),1\leq k\leq\binom{n+m-2}{m-1},

there exist nn hyperplanes such that the arrangement of all m+n−1m+n-1 hyperplanes has exactly kk bounded regions. The preceding argument establishes the asserted realization for sufficiently large parameters, while the stated uniform range for all m≥4m\geq4 and n≥mn\geq m remains the conjectural part.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.