ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(x)∈C[x]f(x)\in\mathbb C[x] be a generic monic polynomial of degree dd. Its cyclic resultants are the quantities associated to ff obtained by evaluating the resultant with xm−1x^m-1 for positive integers mm. A polynomial is reciprocal when its coefficients satisfy the corresponding palindromic symmetry; here the reciprocal polynomial is allowed to be non-monic and has even degree dd.

Sturmfels–Zworski conjecture. A generic monic polynomial f(x)∈C[x]f(x)\in\mathbb C[x] of degree dd is determined by its first d+1d+1 cyclic resultants. Moreover, if ff is non-monic reciprocal of even degree dd, then the number of resultants needed for inversion is d/2+2d/2+2.

This conjecture concerns finite reconstruction of polynomials from cyclic resultants, which encode periodic-point data in dynamical systems and are closely related to zeta functions. The paper notes that 2d+12^{d+1} resultants are known to suffice, while empirical evidence suggests that the conjectured bounds are substantially tighter.

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.