Zeros / CONCEPT
Perfect Matching Count
Count fixed-point-free involutions using the pinned Mathlib cycle-type formula.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES5
PROOF DEPTH0
DOCUMENT LINKS0
Pairing involutions and their cycle type
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
- A square-discriminant obstruction for the Pascalian polynomial of degree 49truth-dependency · Closed
- Adjacency transfer through uniform clone matchingstruth-dependency · Closed
- Matching Monomial Fiberstruth-dependency · Closed
- Signed pairing coefficients and cyclic translationtruth-dependency · Closed
- The strict coefficient deficit outside cyclic arcstruth-dependency · Closed
RELATED KNOWLEDGE
Structural connections
- A regular biconnected graph with a positive fourth difference of ln(i! N(i))structural-affinity · Closed
- A square-discriminant obstruction for the Pascalian polynomial of degree 49structural-affinity · Closed
- Adjacency transfer through uniform clone matchingsstructural-affinity · Closed
- Finite Convolution Coefficientsstructural-affinity · Closed
- Finite Free Commutators in Degree Fourstructural-affinity · Closed
- Matching Monomial Fibersstructural-affinity · Closed
- Seat-Tower Combinatoricsstructural-affinity · Closed
- Signed pairing coefficients and cyclic translationstructural-affinity · Closed
- The strict coefficient deficit outside cyclic arcsstructural-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