The asymptotic maximum-appearance conjecture for distinct-letter words in two-dimensional grids
Statement
Let be a word of length whose letters are all distinct, and let denote the maximum number of copies of appearing in an grid. Distinct-letter word conjecture.
The paper notes that the known bounds place roughly between and , and suggests that the lower bound is closer to the truth; the asserted asymptotic equivalence remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.