Combinatorics / CONCEPT
Three Turns of a Binary XOR Triangle
The clockwise right-edge map of a finite binary XOR triangle has third iterate equal to the identity. At each width it is a permutation whose inverse is two clockwise turns.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
Three turns recover the row
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
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