Shuffle anti-squares of every even length from 24

A binary word is a shuffle square if its letters can be split into two identical subsequences, and an even binary word is a shuffle anti-square if none of its cyclic rotations is a shuffle square. Grytczuk, Pawlik and Pleszczyński found that the shortest anti-squares have length 24 and conjectured that they exist in every even length from 24. We prove the conjecture with two explicit families, one with a short proof by hand, and show that the hand-proved family stays an anti-square when every zero run is multiplied by a constant and every one is replaced by an odd block of ones. It follows that some even binary word of every length from 24 needs at least two cuts before its pieces can be rearranged into a shuffle square; a computer check confirms that two cuts suffice for every anti-square up to length 34. The theorems are formally verified in Lean 4; the exhaustive searches are each confirmed by an independent program. This record is identical to the folder shuffle-anti-squares at tag shuffle-anti-squares-v3 of https://github.com/jvvk/mathematics. Version 3 of the preprint; versions 1 (8 October 2026) and 2 (23 October 2026) were released on GitHub only.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24372233
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Shuffle anti-squares of every even length from 24

Vamshi Jandhyala
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

Shuffle anti-squares of every even length from 24

Vamshi Jandhyala
preprint en

Abstract

A binary word is a shuffle square if its letters can be split into two identical subsequences, and an even binary word is a shuffle anti-square if none of its cyclic rotations is a shuffle square. Grytczuk, Pawlik and Pleszczyński found that the shortest anti-squares have length 24 and conjectured that they exist in every even length from 24. We prove the conjecture with two explicit families, one with a short proof by hand, and show that the hand-proved family stays an anti-square when every zero run is multiplied by a constant and every one is replaced by an odd block of ones. It follows that some even binary word of every length from 24 needs at least two cuts before its pieces can be rearranged into a shuffle square; a computer check confirms that two cuts suffice for every anti-square up to length 34. The theorems are formally verified in Lean 4; the exhaustive searches are each confirmed by an independent program. This record is identical to the folder shuffle-anti-squares at tag shuffle-anti-squares-v3 of https://github.com/jvvk/mathematics. Version 3 of the preprint; versions 1 (8 October 2026) and 2 (23 October 2026) were released on GitHub only.

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon