2022/07/22 by Patchell, Gregory, Spiro, Sam · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2207.11273
How can you fill a 3× 3 grid with the letters A and M so that the word ``AMM'' appears as many times as possible in the grid? More generally, given a word w of length n, how can you fill an n× n grid so that w appears as many times as possible? We solve this problem exactly for several families of words, and we asymptotically solve this problem in higher-dimensional grids.