trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Conjecture 15 of CayleyPy-4 fails at k = 5, L = 4, N = 13

The k = 5 clause of Conjecture 15 of CayleyPy-4 is false: without inverses, rotations of five consecutive letters need at least 9 moves to turn 0000111111111 into its reversal, whichever way the rotation acts, while the clause gives 8.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS1
THEOREM

Refutation

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Diameter of the inverse-closed consecutive 3-cycle Schreier coset graphDiameter of the inverse-closedconsecutive 3-cycle Schreiercoset graphConjecture 15 of CayleyPy-4 fails at k = 5, L = 4, N = 13Conjecture 15 of CayleyPy-4fails at k = 5, L = 4, N = 13
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

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

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.