Generic quadratic graph degree conjecture
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.
References
- Fabian M. Faulstich, Vincenzo Galgano, Elke Neuhaus and Irem Portakal, “On the Coupled Cluster Doubles Truncation Variety of Four Electrons”, arXiv:2602.16580 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.