Gullerud–Johnson–Mbirika conjectures on roots of Fibonacci-shifted path polynomials
Statement
Let be the path graph on vertices, let
be its characteristic polynomial, and let , , with denoting the Fibonacci numbers. For each , let be the set of roots of . Gullerud–Johnson–Mbirika conjectures. The following assertions hold: (1) for each , the points in lie on an ellipse; (2) the maximum real part of a point in is unbounded as increases; (3) for all , the imaginary parts of points in lie within ; (4) if is even, then contains exactly two distinct real roots; and (5) if is odd, then contains exactly one real root, which is negative. These conjectures concern the geometric distribution of roots of characteristic polynomials associated with path graphs. The source reports partial progress toward two conjectures, an infinite class of polynomials contradicting a third, and evidence against a fourth; the supplied text does not identify which numbered assertions have each status.
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.