Polynomial formulas for truncated total depth in ordered trees
Statement
Let and be integers satisfying . Let denote the total quantity studied in the paper, and let denote its truncated version. For each , let and be polynomials in . Polynomial-formula conjecture. For all , \
\operatorname{totalD}(n,2\ell-1)-\operatorname{totalDTrunc}(n,2\ell-1)=\frac{a_{\ell}(n)}{(n+2\ell+2)^{(2\ell-2)}}{2n \choose n-2\ell-1} \and \
\operatorname{totalD}(n,2\ell)-\operatorname{totalDTrunc}(n,2\ell)=\frac{b_{\ell}(n)}{(n+2\ell+4)^{(2\ell-2)}}{2n+1 \choose n-2\ell-2}. \Here and have degree and non-negative integer coefficients; the leading coefficient of is , and the leading coefficient of is . The conjecture would provide a simplified expression for , but the supplied text gives no resolution.
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.