Combinatorics / CONCEPT
A cut into decreasing chains
For a word with distinct entries, membership in D is equivalent to the existence of a value cut such that entries on each side of the cut occur in decreasing order. Every such word belongs to C.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
A cut into decreasing chains
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
- An ascent in the second inflated blockstructural-affinity · Closed
- Inserting a minimum in an early gapstructural-affinity · Closed
- Ordinary continuationstructural-affinity · Closed
- Simplicity of the parallel familystructural-affinity · Closed
- The alternating prefix before the minimumstructural-affinity · Closed
- The Fibonacci enumeration assertionstructural-affinity · Closed
- The first and third values before a late minimumstructural-affinity · Closed
- The two value regions below a second-position maximumstructural-affinity · Closed
- The unique proper interval of an odd extrastructural-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