arXiv (All)
open access
Optimal discrepancy for triangles
We prove that every $n$-point set in the plane has a two-coloring with discrepancy $O(n^{1/4})$ for all triangles. This improves the previous bound $O(n^{1/4}\sqrt{\log n})$ and matches the classical lower bound.
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 combinatorial approach to point-flat incidences over finite fields#1118077
- The Statistical Analysis of Complexity and Regularity of Colour Information in Paintings#69567
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#780921
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#779546
- On the largest independent sets in the Kneser graph on chambers of PG(4,q)#350962
Record · ID 1155310
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