The generalized principal-coefficient formula for Binet expansions
Statement
Let have roots , with respective multiplicities , where for . Let be the coefficient of the principal root in the Binet expansion of , and let denote the polynomial used by the Zeroing Algorithm.
Generalized principal-coefficient conjecture. The coefficient satisfies
This conjecture extends the corresponding result for ZLRRs whose roots all have multiplicity to the case of arbitrary root multiplicities. Establishing it is more difficult because repeated roots make the Binet expansion of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.