Answering a recent question of Patchell and Spiro, we show that when a $d$-dimensional cube of side length $n$ is filled with letters, the word $\mathsf{CAT}$ can appear contiguously at most $(3^{d-1}/2)n^d$ times (allowing diagonals); we also characterize when equality occurs and extend our results to words other than $\mathsf{CAT}$.
@article{10_37236_11735,
author = {Noah Kravitz and Noga Alon},
title = {Cats in cubes},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {3},
doi = {10.37236/11735},
zbl = {1548.05317},
url = {http://geodesic.mathdoc.fr/articles/10.37236/11735/}
}
TY - JOUR
AU - Noah Kravitz
AU - Noga Alon
TI - Cats in cubes
JO - The electronic journal of combinatorics
PY - 2024
VL - 31
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/11735/
DO - 10.37236/11735
ID - 10_37236_11735
ER -