The linear covering-set conjecture for generalized shuffle squares
Fix an alphabet of size . Let be the set of all even -ary words of length , and let be the set of all permutations of . Define to be the minimum size of a set of permutations whose associated shuffle squares cover every word in . The linear covering-set conjecture. For every there exists a constant such that
for all .
References
Status
- Refuted: Jarosław Grytczuk et al. Shuffle squares and ordered nest-free graphs (arXiv, 2025) https://arxiv.org/abs/2503.22043
Source: Jarosław Grytczuk, Bartłomiej Pawlik and Mariusz Pleszczyński, “Variations on shuffle squares”, arXiv:2308.13882 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.