Combinatorics / CONCEPT
Signed boundaries of legal-word toggle graphs
At every length, the signed boundary of the actual legal-word graph has mass-zero image and gives the natural short exact sequence for singleton occupation.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
The image and the natural short exact sequence
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 missing amplitude in the pruned qutrit Dicke circuitstructural-affinity · Closed
- Constrained harmonic optimizationstructural-affinity · Closed
- Counting legal-word toggle edges by deletionstructural-affinity · Closed
- Degrees and the sharp count bound for legal wordsstructural-affinity · Closed
- Directed support obstructions for nSSPstructural-affinity · Closed
- Extreme points of finite matroid intersectionstructural-affinity · Closed
- Integer Signed Incidence Boundaries are Totally Unimodularstructural-affinity · Closed
- Legal chain moment and phase reductionstructural-affinity · Closed
- Legal-word block growthstructural-affinity · Closed
- Multigraph Contraction on Rational Cyclesstructural-affinity · Closed
- The Fibonacci Count of Zeckendorf-Admissible Wordsstructural-affinity · Closed
- The size distribution of nonadjacent supportsstructural-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