ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let EkE_k denote the limit of the expected width of the largest block-palindrome factorization of a length-nn word over an alphabet of size kk, whose existence is established for every k≥2k\geq 2. Let (ai)i≥1(a_i)_{i\geq 1} be the coefficient sequence in the formal expansion in powers of k−1k^{-1}. Coefficient conjecture. For every integer k≥2k\geq 2,

Ek=1+∑i=1∞aik−i,E_k=1+\sum_{i=1}^{\infty}a_i k^{-i},

where the sequence (an/2)n≥1(a_n/2)_{n\geq 1} is OEIS sequence A274199. This conjecture identifies the empirically observed coefficients of the expected limiting width; the paper provides numerical evidence but does not establish the claimed coefficient sequence.

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.