ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let W(ℓr,ℓ(1−r))W(\ell r,\ell(1-r)) denote the set of binary words with the indicated numbers of the two letters. Fix r∈(0,1)r\in(0,1) and n≥2n\geq 2, and let i(n,ℓ,r)i(n,\ell,r) be the fraction of UTn(T)\mathcal{UT}_n(\mathbb{T}) isoterms in W(ℓr,ℓ(1−r))W(\ell r,\ell(1-r)). Isoterm-fraction conjecture. The function i(n,ℓ,r)i(n,\ell,r) is monotone decreasing in ℓ\ell, and

i(n,ℓ,r)→0as ℓ→∞.i(n,\ell,r)\to 0\quad\text{as }\ell\to\infty.

This formalizes the experiments suggesting that, at a fixed letter ratio, isoterms become asymptotically rare among long binary words.

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.