Arith / CONCEPT
A Uniform Bound for Antidiagonal Grid Traffic
A uniform strict binomial-ratio bound for antidiagonal grid obstructions at every n at least 496.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
The upper logarithmic factorial envelope
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A factorial remainder uniform in floor phasestructural-affinity · Closed
- Actual Continuous Factorial Compensationstructural-affinity · Closed
- Cancellation in the actual harmonic tailstructural-affinity · Closed
- Floor-uniform arithmetic identitiesstructural-affinity · Closed
- Logarithmic Convolution from Absolute Coefficient Massstructural-affinity · Closed
- The Actual Compensated Causal Kernelstructural-affinity · Closed
- The Actual Factorial Robin High Integral and Its Derivativestructural-affinity · Closed
- The exact limit of the literal factorial compensationstructural-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