论文标题
网格中单词的最大出现数量
The Maximum Number of Appearances of a Word in a Grid
论文作者
论文摘要
您如何用字母A和M填充$ 3 \ times 3 $网格，以使单词``'amm''在网格中看起来尽可能多次？更一般而言，给定一个单词$ w $的长度$ n $，您如何填充$ n \ times n $网格，以使$ w $看起来尽可能多倍？我们为几个单词家庭解决了这个问题，我们在高维网格中渐近地解决了这个问题。
How can you fill a $3\times 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\times 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.
