Generic quadratic graph degree conjecture
Statement
Let and be nonnegative integers, and consider the rational map
whose coordinates on are given by
where the are general homogeneous quadratic polynomials for . Generic quadratic graph degree conjecture. The graph of has degree
This conjectural formula is motivated by computational evidence and is intended to provide a tractable degree calculation for the graphs arising in the coupled-cluster truncation problem. Its status is not resolved in the supplied source.
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.