ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P(x)P(x) have roots r1,r2,…,rir_1,r_2,\dots,r_i, with respective multiplicities 1,m2,…,mi1,m_2,\dots,m_i, where mj≥1m_j\geq 1 for 2≤j≤i≤k2\leq j\leq i\leq k. Let a1a_1 be the coefficient of the principal root in the Binet expansion of q(1,t)q(1,t), and let Q0(x)Q_0(x) denote the polynomial used by the Zeroing Algorithm.

Generalized principal-coefficient conjecture. The coefficient a1a_1 satisfies

a1=Q0(r1)∏j=2i(r1−rj)mj.a_1=\frac{Q_0(r_1)}{\prod_{j=2}^{i}(r_1-r_j)^{m_j}}.

This conjecture extends the corresponding result for ZLRRs whose roots all have multiplicity 11 to the case of arbitrary root multiplicities. Establishing it is more difficult because repeated roots make the Binet expansion of q(1,t)q(1,t) more complicated and prevent the Vandermonde-matrix argument used in the simple-root case.

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.