ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path graph on nn vertices, let

fn(λ)=∑k=0⌊n/2⌋(−1)n+k(n−kk)λn−2kf_n(\lambda)=\sum_{k=0}^{\lfloor n/2\rfloor}(-1)^{n+k}\binom{n-k}{k}\lambda^{n-2k}

be its characteristic polynomial, and let F0=0F_0=0, F1=1F_1=1, with FnF_n denoting the Fibonacci numbers. For each nn, let RnR_n be the set of roots of fn(λ)=Fn+1f_n(\lambda)=F_{n+1}. Gullerud–Johnson–Mbirika conjectures. The following assertions hold: (1) for each nn, the points in RnR_n lie on an ellipse; (2) the maximum real part of a point in RnR_n is unbounded as nn increases; (3) for all nn, the imaginary parts of points in RnR_n lie within [−1,1][-1,1]; (4) if nn is even, then RnR_n contains exactly two distinct real roots; and (5) if nn is odd, then RnR_n 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 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.