trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Weighted Terminal Enumeration

Terminal factorization decomposes weighted counts on every nonempty finite alphabet.

Closed Authored exposition
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH7
DOCUMENT LINKS1
THEOREM

Weighted decomposition by pivot and cut

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Catalan Orders of the Final CycleCatalan Orders of the FinalCycleUnique Terminal FactorizationUnique Terminal FactorizationWeighted Terminal EnumerationWeighted Terminal EnumerationEnumeration of Nonnesting Permutations Avoiding 1322Enumeration of NonnestingPermutations Avoiding 1322
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
7
Layer
D5/S3
Domain
Combinatorics
Node ID
D5/S3/Combinatorics/Nonnesting/NonnestingOneThreeTwoTwoCount
Repository path
D5/S3/Combinatorics/Nonnesting/NonnestingOneThreeTwoTwoCount.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.