ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(n,m)T(n,m) be the sequence studied in the paper, and write its nnth row generating function as

T(n,x)=∑m≥0T(n,m)xm=Hn(x)(1−x)n+1.T(n,x)=\sum_{m\geq 0}T(n,m)x^m=\frac{H_n(x)}{(1-x)^{n+1}}.

Let Mi,jM_{i,j} denote the array specified in the source.

Numerator-degree conjecture. For n≥2n\geq 2, Hn(x)H_n(x) has degree n−2n-2 and is given by

Hn(x)=Mn−2,0+Mn−3,1x+Mn−4,2x2+⋯+M0,n−2xn−2,H_n(x)=M_{n-2,0}+M_{n-3,1}x+M_{n-4,2}x^2+\cdots+M_{0,n-2}x^{n-2},

where Mn−2−j,jM_{n-2-j,j} is the corresponding entry of the array MM for j=0,1,…,n−2j=0,1,\ldots,n-2.

This conjecture specifies the numerator of each row generating function in terms of the array MM. The paper presents it among six conjectures and later discusses proofs using explicit formulas for the column generating function.

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.