ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Tusnady's problem

Let dnd_n be the discrepancy of nn points in R2\mathbb{R}^2 wrt all alix-aligned rectangles i.e. the set system comprises of all axis-aligned rectangles in R2\mathbb{R}^2 as sets, maximised over all choices of nn points. Tusnady's problem then asks for the exact value of dnd_n.

We can also ask for the same question in Rd\mathbb{R}^d.

Record

Added
Links

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.