arXiv (All)
open access
Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane
We report certified computations on four no-three-in-line questions, two in the cube and two in the plane, by one method: exact decision procedures inside symmetry strata, every witness re-verified by a second program sharing no code, every number traced to a public journal. (I) Let a(n) be the larg
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
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Quantum Advantage for Distributed Symmetry Breaking#1062712
- Quantum Advantage for Distributed Symmetry Breaking#1043062
- MathDuels: Evaluating LLMs as Problem Posers and Solvers#126578
Record · ID 1051626
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