Conjecture on the power-series coefficients of the expected largest BP-factorization width
Statement
Let denote the limit of the expected width of the largest block-palindrome factorization of a length- word over an alphabet of size , whose existence is established for every . Let be the coefficient sequence in the formal expansion in powers of . Coefficient conjecture. For every integer ,
where the sequence 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.