Division-line conjecture for Pythagoras numbers of integers in biquadratic fields
Division-line conjecture for Pythagoras numbers of integers in biquadratic fields
Let be a totally real biquadratic field, and write for the least number of squares of algebraic integers needed to represent every totally positive algebraic integer of . The fields are the biquadratic fields used in the paper's notation.
Division-line conjecture.
if and only if at least one of the following holds:
- contains or ;
- with ;
- .
The paper proves the lower bound in broad classes and gives substantial computational evidence, but the upper bound for the six exceptional fields in the conjecture remains open.
Sources & referencesView supporting material
Primary source
Daniel Dombek, “On biquadratic fields: when 5 squares are not enough”, arXiv:2506.20820 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.