QuantumBounds / CONCEPT
The classical value of the odd polygon game
For every odd P at least three, the polygon game's optimal classical winning probability is one minus F(P minus one) divided by two to the power P.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES0
PROOF DEPTH8
DOCUMENT LINKS0
The sharp upper bound
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- All qubit maximizers of the imaginary Bargmann invariantstructural-affinity · Closed
- Arith: Fibonacci Rankstructural-affinity · Closed
- Fibonacci Rank Euler Tailstructural-affinity · Closed
- Fibonacci Rank Weighted Prime Tailstructural-affinity · Closed
- Finite Fibonacci rank closurestructural-affinity · Closed
- Pairwise Fibonacci Time Recoverystructural-affinity · Closed
- The Fibonacci Count of Zeckendorf-Admissible Wordsstructural-affinity · Closed
- Two-State Short-Word Certificate Widthstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance