Combinatorics / CONCEPT
The maximum number of strongly complementary permutation matrices
The maximum size of a strongly complementary permutation family is the largest power of two dividing its positive dimension.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
The sharp bound and a family attaining it
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
- Bounds from a Distinguished Heapstructural-affinity · Closed
- Distinguished Heaps Two and Fourstructural-affinity · Closed
- Divisor Nim and Minimum Excluded Valuesstructural-affinity · Closed
- Dyadic Depth and Zero Positionsstructural-affinity · Closed
- Finite mex block propagationstructural-affinity · Closed
- Paired Dyadic Removalsstructural-affinity · Closed
- The Distinguished Heap Eightstructural-affinity · Closed
- The Yang-Baxter cellular automata over F_{2^n} have period dividing 2^nstructural-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