Combinatorics / CONCEPT
Ordered low-subword recovery
Increasing slot order transports low-subword deletion and reads a replacement permutation exactly.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS1
Deletion and replacement in increasing low-slot order
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
- Constructive southeast Bruhat factorsstructural-affinity · Closed
- Exact cell cardinalitystructural-affinity · Closed
- Explicit factors and scalar fibersstructural-affinity · Closed
- Left composition of the coupled repaired digit mapsstructural-affinity · Closed
- List Inversions and Local Replacement Boundsstructural-affinity · Closed
- Ordinary contraction of forbidden countsstructural-affinity · Closed
- Scalar fiber actionstructural-affinity · Closed
- The repaired integer weightstructural-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