arXiv (All)
open access
Dimension Amplification for Tarski Fixed-Point Query Lower Bounds
We prove that finding a fixed point of a monotone map on the nine-dimensional grid $[N]^9$ requires $Ω((\log N)^3)$ deterministic queries, even when the fixed point is unique and each query returns the entire function value. The proof gives a construction that raises the dimension from $d$ to $4d+1$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Ramsey-type problem and the Turán numbers#490222
- A proof of Hare's $ε$ unfair conjecture#986985
- The fourth generalized Davenport constant of $C_5^3$#971915
- The permutation dimension of the Klein 4-group#1105914
- Revisiting the nilpotent polynomial Hales–Jewett theorem#177957
Record · ID 1201657
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive