Combinatorics / CONCEPT
Partitions with the fewest extensions are boxes
In every dimension d, the d-dimensional partitions of n that extend in exactly d ways to a partition of n + 1, and the d-dimensional partitions of n + 1 that contain exactly one partition of n, are the boxes, so both are counted by the number of ordered factorizations of n, respectively n + 1, into d factors; for d = 4 these are the first columns of A098052 and A098530 on solid partitions.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS1
Proof of the conjectures
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
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance