ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let w′w' be a word of length k≥2k\ge 2 whose letters are all distinct, and let f(w′,n,2)f(w',n,2) denote the maximum number of copies of w′w' appearing in an n×nn\times n grid. Distinct-letter word conjecture.

f(w′,n,2)∼3k−1n2.f(w',n,2)\sim \frac{3}{k-1}n^2.

The paper notes that the known bounds place f(w′,n,2)f(w',n,2) roughly between 3k−1n2\frac{3}{k-1}n^2 and 4k−1n2\frac{4}{k-1}n^2, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.