Combinatorics / CONCEPT
Low Entries in the Forced Prefix
The prescribed boundary data for two consecutive inverse images determine additional small entries.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH5
DOCUMENT LINKS1
Four forced small entries
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A Consecutive Pair Forced by a Returnstructural-affinity · Closed
- An Extreme Value in the Inverse Imagestructural-affinity · Closed
- Exclusion of Large Fixed 231-Avoidersstructural-affinity · Closed
- Fixed Avoiders of the Third Iteratestructural-affinity · Closed
- Incompatible Middle Cycle Datastructural-affinity · Closed
- Record Bounds and the Inverse Bijectionstructural-affinity · Closed
- The High Prefix before Onestructural-affinity · Closed
- The Initial Pair after the Maximum and Onestructural-affinity · Closed
- The Penultimate Record Blockstructural-affinity · Closed
- The Penultimate Value of the Original Wordstructural-affinity · Closed
- The Prefix before One in a 231-Avoiderstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance