Reproduce “The Six-Dimensional Tarski Problem is $Ω(\log^3 n)$-Hard” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Kristóf Zólomy
The authors prove a deterministic oracle-query lower bound for finding fixed points of unknown monotone functions on grids. Their recursive construction splits coordinates into three blocks and routes queries into smaller hidden problems. In six dimensions, every deterministic algorithm needs order (log n)^3 queries, matching a known upper bound; randomized lower bounds are expected but unproved.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.