Combinatorics / CONCEPT
Identity edge words on finite trees
Leaf intervals characterize identity words on every finite tree.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
The local tree criterion holds
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Crossing- and Nesting-Free Labeled Graphsstructural-affinity · Closed
- Multi-entropy positivity fails on three qutritsstructural-affinity · Closed
- Support forests and edge-word reflectionstructural-affinity · Closed
- The unweighted fourth moment does not determine four-edge forest countsstructural-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