Pith. sign in

REVIEW 3 major objections 3 minor 62 references

Escalations and criteria over real quadratic fields

T0 review · 3 major / 3 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper develops escalation over number fields and uses it to compute universality criterion sets for Q(√2), Q(√3), and Q(√5).

desk verdict A genuine methodological advance in number-field escalation, but the headline criteria are honest conjectures resting on norm-limited computation. read the letter →

arxiv 2608.12648 v1 pith:2OYRUIIZ submitted 2026-08-12 math.NT

Jakub Krásenský , Giuliano Romeo This is my paper · ORCID
classification math.NT MSC 11E1211E2011R0411R1111R80
keywords universalquadraticformscriterionsetsescalationrealfieldstotallynumberlattices15-Theoremdiagonal
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper aims to turn the 15-Theorem/290-Theorem question — which numbers must a quadratic form represent in order to represent every totally positive integer? — into a finite algorithmic procedure for totally real number fields. It develops escalation over number fields, and a variant called pseudoescalation for diagonal forms, proving that the process of repeatedly adjoining a vector representing the smallest missing totally positive integer always terminates. Applied to the three simplest real quadratic fields, the method yields explicit criterion sets: exact for diagonal forms over $\mathbb{Q}(\sqrt{5})$, and provably correct below norm $250\,000$ with conjectural exactness for $\mathbb{Q}(\sqrt{2})$ and $\mathbb{Q}(\sqrt{3})$. The payoff is that universality criteria, previously explicit only for $\mathbb{Q}(\sqrt{5})$, become computable objects.

What carries the argument

The central mechanism is the escalator tree. Starting from the zero lattice, at each step take the current lattice's truant — the least (with respect to any order refining norm) totally positive algebraic integer it fails to represent — and add a vector representing that truant; every lattice has only finitely many such escalations, and no infinite chain can exist because eventually the lattice has rank at least $5$ and the asymptotic local–global principle makes it universal. Hence the tree of escalators is finite, and the equivalence 'critical iff truant of some lattice, equivalently of some escalator' turns criterion-set computation into a finite search. For diagonal forms, pseudoescalation plays the same role, adjoining one or more diagonal coefficients just enough to represent the current truant. The remaining work for explicit fields is proving (or conjecturing) universality of the finitely many quaternary escalators.

What would settle it

Run the paper's escalation algorithm beyond norm $250\,000$ (or analyze the class-number-two ternary lattice $E^{(5)}_3$) and check whether any of the twelve quaternary lattices in Conjecture 5.11 misses a totally positive integer; equally decisive would be finding any critical element outside the six listed elements by producing a lattice whose truant lies outside that set. The paper records local–global failures for the parent ternary lattice at norms $203\,391$ and $210\,681$, so the search should be specifically target large-norm exceptions.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that the minimal criterion set — the unique finite set $C$ such that a classical quadratic lattice is universal iff it represents every element of $C$ — can be computed by escalation. A totally positive algebraic integer is critical precisely when it occurs as the truant of an escalator, i.e. the least element (in any admissible order refining norm) an escalator fails to represent; because the tree of all escalators is locally finite and has no infinite branches, the procedure terminates. The paper carries this out for $\mathbb{Q}(\sqrt{5})$, $\mathbb{Q}(\sqrt{2})$ and $\mathbb{Q}(\sqrt{3})$: it proves the diagonal criterion set for $\mathbb{Q}(\sqrt{5})$ is $\{1,2,(5+\sqrt{5})/2,(7\pm\sqrt{5})/2,2(5+\sqrt{5})/2\}$, proves that the previously known six-element classical criterion set for $\mathbb{Q}(\sqrt{5})$ is minimal, and reduces the classical criterion sets for $\mathbb{Q}(\sqrt{2})$ and $\mathbb{Q}(\sqrt{3})$ to explicit conjectures about finitely many quaternary lattices, with numerical verification up to norm $250\,000$.

Load-bearing premise

The load-bearing premise is that Conjecture 5.11 holds — the twelve listed quaternary lattices over $\mathbb{Q}(\sqrt{2})$ are universal and one further lattice represents everything except $3(3-\sqrt{2})$ — together with the analogous Conjectures 6.5 and 6.9 for $\mathbb{Q}(\sqrt{3})$; if any of those lattices has an extra exceptional element, the claimed criterion sets are incomplete.

Editorial extensions

If this is right

  • For $\mathbb{Q}(\sqrt{2})$, any classical lattice representing $\{1,2+\sqrt{2},3,3(2+\sqrt{2}),3(3\pm\sqrt{2})\}$ represents every totally positive integer up to norm $250\,000$; assuming Conjecture 5.11 it is universal, and these six elements are exactly the minimal criterion set.
  • For $\mathbb{Q}(\sqrt{3})$, the ten-element set $\{1,\varepsilon,4\pm\sqrt{3},\varepsilon(4\pm\sqrt{3}),7\pm2\sqrt{3},\varepsilon(7\pm2\sqrt{3})\}$ with $\varepsilon=2+\sqrt{3}$ is contained in both the classical and diagonal criterion sets, with equality following from Conjectures 6.5 and 6.9.
  • For $\mathbb{Q}(\sqrt{5})$, the diagonal criterion set is exactly the five-element set $\{1,2,(5+\sqrt{5})/2,(7\pm\sqrt{5})/2,2(5+\sqrt{5})/2\}$, and the classical criterion set is minimal.
  • The finiteness theorems for escalation and pseudoescalation give an independent proof that every totally real number field has a finite criterion set, without invoking the earlier general finiteness theorem [CO].
  • In the three fields studied, the largest critical element has a sharp 'almost-universal' property: any lattice representing all smaller criteria represents everything except possibly the largest; the diagonal analogue holds for $\mathbb{Q}(\sqrt{3})$ but fails for $\mathbb{Q}(\sqrt{2})$ and $\mathbb{Q}(\sqrt{5})$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The method is, in principle, an exact algorithm: pair any universal-lattice oracle with Algorithm 3.9 and it outputs the criterion set, while a norm bound and finite verification give a certified lower bound and a heuristic upper bound; applying it to fields with class number greater than one would test how much survives non-free lattices.
  • The paper's own warning about exceptions at norm $203\,391$ suggests the $250\,000$-norm verifications for $\mathbb{Q}(\sqrt{2})$ and $\mathbb{Q}(\sqrt{3})$ should not be treated as proof; the plausible failure mode is a large-norm exception in one of the conjecturally universal quaternary lattices.
  • The conjectural equality $C^{\mathrm{diag}}(\mathbb{Q}(\sqrt{3})) = C^{\mathrm{cl}}(\mathbb{Q}(\sqrt{3}))$ raises the question of whether diagonal forms generally see the same obstructions as arbitrary classical forms; if so, diagonal criteria could serve as a cheap first test before tackling the full classical criterion set.
  • The paper mentions evidence from a follow-up that $\mathbb{Q}(\sqrt{21})$ has a small criterion set for which the largest-critical-element phenomenon fails, so the 'almost-universal largest element' pattern observed for $D=2,3,5$ is probably an accident of those fields rather than a general law.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper develops the method of escalation over totally real number fields, proving finiteness of S-criterion sets and giving algorithms to compute them. It also introduces a separate pseudoescalation theory for diagonal forms. The main arithmetic results are conjectural criterion sets for the classical universal forms over Q(√2) (Conjecture 5.1) and Q(√3) (Conjecture 6.1), the exact classical criterion set for Q(√5) due to Lee is reproved with minimality (Theorem 7.1), and the exact diagonal criterion set for Q(√5) is computed (Theorem 7.2). The Q(√2) and Q(√3) criterion sets are supported by numerical verification up to norm 250,000 and by conditional proofs that reduce them to explicit conjectures about a small number of quaternary and ternary lattices (Conjectures 5.11, 6.5, 6.9).

Significance. If the conjectures are correct, this would be the first explicit universality criterion sets over real quadratic fields other than Q(√5), and the escalation method would be a substantial algorithmic contribution to the field. The finiteness proof for S-criterion sets, once completed, removes the reliance on the Chan–Oh theorem in [KKR] and provides a practical computational route. The pseudoescalation theory for diagonal forms is new and of independent interest. The paper is remarkably honest in labeling its main results as conjectural and in documenting the fragility of numerical evidence (Remark 5.10). The unconditional results, such as the universality of all escalations of ⟨1,2+√2,2⟩ (Proposition 5.8) and the diagonal criterion for Q(√5), are solid and valuable. However, the central claims for Q(√2) and Q(√3) remain conditional on unproved assertions that are verified only by computations to norm 250,000, and the computational programs themselves are not made available.

major comments (3)
  1. [Section 3, Lemma 3.6] The proof of Lemma 3.6 omits the core local S-universality argument, stating only that it is 'virtually the same as in the proof of [KKR, Prop. 3.1]' and providing two pointers. Since Theorem 3.7, which states the finiteness of the escalation tree, depends directly on this lemma, and since the paper advertises a 'simple proof of finiteness', the omission is load-bearing. Please provide a complete proof of the local S-universality step, or at least a precise statement with the necessary modifications of the KKR argument, rather than deferring the key detail to a reference.
  2. [Section 5, Conjecture 5.11 and Theorem 5.2(4)] The claim that Conjecture 5.1 follows from Conjecture 5.11 makes the Q(√2) criterion set conditional on the universality of twelve quaternary lattices that are checked only up to norm 250,000. Remark 5.10 explicitly warns that the analogous check for E^(5)_3 was complete through norm 200,000 and yet new exceptions appear at norms 203,391 and 210,681. Therefore the numerical evidence does not strongly support Conjecture 5.11, and there is a real possibility that a first non-represented element occurs above the computed bound, which would change the minimal criterion set. The same issue applies to Conjectures 6.5 and 6.9 for Q(√3). The paper should state this limitation more prominently in the abstract and in the statements of Theorems 5.2 and 6.2, and ideally give some heuristic or further evidence that the conjectures hold beyond the checked bound.
  3. [Section 5, Proposition 5.6 and computational verification] The proof of Theorem 5.2(2)–(3) and Proposition 5.6 relies on a Magma computation that is described only as 'We used a program written in Magma to compute all elements up to norm 250 000 and check their representability', with the programs 'available upon request'. This is not sufficient for a reproducible proof, especially because the paper explicitly uses these computations to establish that the criterion set contains no further elements below norm 250,000, which is one of the few unconditional results. The authors should provide the program code as supplementary material, or at least give a complete, checkable algorithmic description and the full output of the computations.
minor comments (3)
  1. [Section 4, Example 4.9] In the proof of Cdiag_odd = Ccl_odd, the sentence 'we just proved Cdiag_odd ⊂ Cdiag_odd' is a typo: the intended statement is that the exhibited diagonal forms prove Ccl_odd ⊂ Cdiag_odd (or the reverse inclusion, depending on the direction being discussed).
  2. [Section 6, proof of Theorem 6.2] The proof cites '[KKR, Thm. 1.2]' for closure of criterion sets under units and conjugation, whereas the earlier text cites '[KKR, Cor. 3.5]' for the same property; please harmonize the references.
  3. [Section 7, proof of Theorem 7.2] The Q(√5) part of the proof states 'They can all be checked to be universal' without showing the checks; a short table listing the forms and the required representations would make the argument easier to verify.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the computational criterion sets are explicit conjectures conditioned on stated computational evidence, and the finiteness and escalation theory rest on external published results rather than on their own conclusions.

full rationale

The paper's derivation chain is not circular. The finiteness of the escalation procedure (Theorem 3.7) is proved using Kőnig's lemma and the external asymptotic local–global principle of Hsia–Kitaoka–Kneser; it does not presuppose the criterion set it is meant to compute. The identification of critical elements with truants (Proposition 2.8) and the characterization of criterion sets (Theorem 2.9) are cited from the published paper [KKR]; although this is a self-citation, it is an external, refereed theorem whose assumptions do not include the Q(√2) or Q(√3) conjectures, so it does not make the argument circular. The Q(√5) results use Lee's Norm-45-Theorem as an external benchmark and then prove minimality by exhibiting explicit truants; no fitted parameter is renamed as a prediction. For Q(√2) and Q(√3), the proposed criterion sets are explicitly labeled conjectures (Conjectures 5.1 and 6.1), and Theorems 5.2(4) and 6.2(4) state exactly their dependence on Conjectures 5.11, 6.5, and 6.9. The norm-250,000 computations are presented as evidence, not as proofs, and Remark 5.10 explicitly warns that such numerical checks can miss exceptions. Algorithm 3.9 is openly conditional on an oracle and immediately acknowledges the oracle problem. No equation in the paper is equivalent by construction to its own input, and the conjectured criterion sets are not derived from themselves.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No numerical constants are fitted; the conjectured criterion sets are sets of algebraic integers, not fitted parameters. The norm bound 250,000 is a computational truncation, not a free parameter. No new physical entities are introduced; 'pseudoescalation' is an algorithmic construction, not an invented entity.

assumptions (4)
  • standard math Hsia-Kitaoka-Kneser asymptotic local-global principle: a lattice of rank at least 5 that locally represents α with norm above a constant C also represents α globally.
    Used in Lemma 3.6 and Lemma 4.6 to show that escalation chains terminate after finitely many steps, since eventually local S-universality plus large-norm representation gives full universality.
  • domain assumption KKR Theorem 2.9 and Proposition 2.8: the set of critical elements is the unique minimal criterion set, and an element is critical if and only if it is a truant of some lattice.
    The entire escalation framework and the computations depend on this characterization from the authors' prior published paper [KKR]. The present paper fixes a minor mistake in the proof of KKR Cor. 3.5 but assumes the main results.
  • domain assumption Class number 1 for Q(√2), Q(√3), and Q(√5), so all lattices are free and the local-global principle holds for the class-number-1 lattices used.
    Used throughout Sections 5-7 to equate lattices with quadratic forms and to determine represented elements exactly for lattices with class number 1, such as E^(6)_3 in Lemma 5.9.
  • ad hoc to paper Conjectures 5.11, 6.5, and 6.9, asserting universality or near-universality of specific listed lattices.
    The conditional parts of Theorems 5.2, 6.2, and 7.2 assume these conjectures. They are not proven and are based on norm-250,000 or norm-1,000,000 computational checks.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Escalations and criteria over real quadratic fields." pith.science (2026). https://pith.science/paper/2OYRUIIZ

@misc{pith2026260812648,
  author       = {Pith},
  title        = {Pith review of: Escalations and criteria over real quadratic fields},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2OYRUIIZ}},
  note         = {Machine review of arXiv:2608.12648}
}
abstract

The famous 15-Theorem and 290-Theorem fully characterise universal quadratic forms over $\mathbb{Q}$. Similar theorems exist for every totally real number field, but only over $\mathbb{Q}(\sqrt5)$ the criterion set is explicitly known. We study criterion sets both theoretically and computationally: We develop the method of escalation over number fields, thus providing a simple proof of finiteness of the criteria and, more importantly, a practical tool for computing them. We illustrate this by explicit computations for $\mathbb{Q}(\sqrt2)$ and $\mathbb{Q}(\sqrt3)$, obtaining a conjecture about the corresponding universality criteria; we also prove universality of many escalator lattices. Moreover, we develop the somewhat different theory of escalations for diagonal quadratic forms, obtaining the diagonal criterion set for $\mathbb{Q}(\sqrt5)$ and conjecturally for $\mathbb{Q}(\sqrt2)$ and $\mathbb{Q}(\sqrt3)$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

62 extracted references · 46 canonical work pages

  1. [1]

    Bordignon, G

    M. Bordignon, G. Cherubini, Coprime-universal quadratic forms. arXiv:2406.01533

    arXiv

  2. [2]

    Bosma, J

    W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), 235--265

    1997

  3. [3]

    C. N. Beli, A new approach to classification of integral quadratic forms over dyadic local fields, Trans. Amer. Math. Soc. 362 (2010), 1599--1617

    work page 2010

  4. [4]

    C. N. Beli, Universal integral quadratic forms over dyadic local fields. arXiv:2008.10113

    work page Pith review arXiv 2008

  5. [5]

    Bhargava, On the Conway-Schneeberger fifteen theorem, Contemp

    M. Bhargava, On the Conway-Schneeberger fifteen theorem, Contemp. Math. 272 (2000), 27--37

    work page 2000

  6. [6]

    Bhargava, J

    M. Bhargava, J. Hanke, Universal quadratic forms and the 290-theorem, 2011. Preprint

    2011

  7. [7]

    Blomer, V

    V. Blomer, V. Kala, Number fields without universal n -ary quadratic forms, Math. Proc. Cambridge Philos. Soc. 159 (2015), 239--252

    2015

  8. [8]

    Blomer, V

    V. Blomer, V. Kala, On the rank of universal quadratic forms over real quadratic fields, Doc. Math. 23 (2018), 15--34

    work page 2018

Show all 62 references
  1. [9]

    W. K. Chan, M.-H. Kim, S. Raghavan, Ternary universal integral quadratic forms, Japan. J. Math. 22 (1996), 263--273

    1996

  2. [10]

    W. K. Chan, B.-K. Oh, Can we recover an integral quadratic form by representing all its subforms?, Adv. Math. 433 (2023), article 109317, 20 pp

    2023

  3. [11]

    DeBenedetto, Quadratic forms representing all primes, Involve 7 (2014), 619--626

    J. DeBenedetto, Quadratic forms representing all primes, Involve 7 (2014), 619--626

    2014

  4. [12]

    DeBenedetto, J

    J. DeBenedetto, J. Rouse, Quadratic forms representing all integers coprime to 3, Ramanujan J. 46 (2018), 431--446

    2018

  5. [13]

    Doyle, K

    G. Doyle, K. S. Williams, Prime-universal quadratic forms ax^2+by^2+cz^2 and ax^2+by^2+cz^2+dw^2 , Bull. Aust. Math. Soc. 101 (2020), 1--12

    2020

  6. [14]

    A. G. Earnest, A. Khosravani, Universal positive quaternary quadratic lattices over totally real number fields, Mathematika 44 (1997), 342--347

    1997

  7. [15]

    N. D. Elkies, D. M. Kane, S. D. Kominers, Minimal S -universality criteria may vary in size, J. Théor. Nombres Bordeaux 25 (2013), 557--563

    2013

  8. [16]

    A. J. Hahn, Quadratic forms over Z from Diophantus to the 290 theorem , Adv. Appl. Clifford Algebr. 18 (2008), 665--676

    2008

  9. [17]

    Z. He, Y. Hu, On n -universal quadratic forms over dyadic local fields, Sci. China Math. 67 (2024), 1481--1506

    2024

  10. [18]

    Z. He, Y. Hu, F. Xu, On indefinite k -universal integral quadratic forms over number fields , Math. Z. 304 (2023), article 20, 26 pp

    2023

  11. [19]

    Hejda, V

    T. Hejda, V. Kala, Additive structure of totally positive quadratic integers, Manuscripta Math. 163 (2020), 263--278

    2020

  12. [20]

    J. S. Hsia, Y. Kitaoka, M. Kneser, Representations of positive definite quadratic forms, J. Reine Angew. Math. 301 (1978), 132--141

    1978

  13. [21]

    W. C. Jagy, Five regular or nearly-regular ternary quadratic forms, Acta Arith. 77 (1996), 361--367

    1996

  14. [22]

    J. Ju, D. Kim, The pentagonal theorem of sixty-three and generalizations of Cauchy’s lemma, Forum Math. 35 (2023), 1685--1706

    2023

  15. [23]

    J. Ju, D. Kim, K. Kim, M. Kim, B.-K. Oh, Prime-universal diagonal quadratic forms, Bull. Aust. Math. Soc. 103 (2021), 390--404

    2021

  16. [24]

    Kala, Universal quadratic forms and elements of small norm in real quadratic fields, Bull

    V. Kala, Universal quadratic forms and elements of small norm in real quadratic fields, Bull. Aust. Math. Soc. 94 (2016), 7--14

    2016

  17. [25]

    Kala, Number fields without universal quadratic forms of small rank exist in most degrees, Math

    V. Kala, Number fields without universal quadratic forms of small rank exist in most degrees, Math. Proc. Cambridge Philos. Soc. 174 (2023), 225--231

    2023

  18. [26]

    Kala, Universal quadratic forms and indecomposables in number fields: A survey, Commun

    V. Kala, Universal quadratic forms and indecomposables in number fields: A survey, Commun. Math. 31 (2023), 81--114

    2023

  19. [27]

    Kaplansky, Ternary positive quadratic forms that represent all odd positive integers, Acta Arith

    I. Kaplansky, Ternary positive quadratic forms that represent all odd positive integers, Acta Arith. 70 (1995), 209--214

    1995

  20. [28]

    B. M. Kim, Universal octonary diagonal forms over some real quadratic fields, Comment. Math. Helv. 75 (2000), 410--414

    2000

  21. [29]

    Kim, Recent developments on universal forms, Contemp

    M.-H. Kim, Recent developments on universal forms, Contemp. Math. 344 (2004), 215--228

    2004

  22. [30]

    Kirschmer, One-class genera of maximal integral quadratic forms, J

    M. Kirschmer, One-class genera of maximal integral quadratic forms, J. Number Theory 136 (2014), 375--393

    2014

  23. [31]

    Kirschmer, D

    M. Kirschmer, D. Lorch, Ternary quadratic forms over number fields with small class number, J. Number Theory 161 (2016), 343--361

    2016

  24. [32]

    Kramer, J

    K. Kramer, J. Krásenský, Non-universality of ternary quadratic forms over fields containing 2 , submitted. arXiv:2601.15568

  25. [33]

    V. Kala, K. Kramer, J. Krásenský, Kitaoka's Conjecture and sums of squares, Bull. Lond. Math. Soc. 58 (2026), article e70045, 21 pp

    2026

  26. [34]

    B. M. Kim, M.-H. Kim, B.-K. Oh, 2-universal positive definite integral quinary quadratic forms, Contemp. Math. 249 (1999), 51--62

    1999

  27. [35]

    B. M. Kim, M.-H. Kim, B.-K. Oh, A finiteness theorem for representability of quadratic forms by forms, J. Reine Angew. Math. 581 (2005), 23--30

    2005

  28. [36]

    B. M. Kim, M.-H. Kim, D. Park, Real quadratic fields admitting universal lattice of rank 7 , J. Number Theory 233 (2022), 456--466

    2022

  29. [37]

    B. M. Kim, J. Y. Kim, P.-S. Park, The fifteen theorem for universal Hermitian lattices over imaginary quadratic fields, Math. Comp. 79 (2010), 1123--1144

    2010

  30. [38]

    V. Kala, J. Krásenský, G. Romeo, Universality criterion sets for quadratic forms over number fields, Adv. Math. 500 (2026), article 111080, 27 pp

    2026

  31. [39]

    V. Kala, J. Krásenský, D. Park, P. Yatsyna, B. \.Zmija, Kitaoka's conjecture for quadratic fields, submitted. arXiv:2501.19371

    arXiv

  32. [40]

    B. Kane, J. Liu, Universal sums of m -gonal numbers, Int. Math. Res. Not. IMRN (2020), 6999--7036

    2020

  33. [41]

    K. Kim, J. Lee, B.-K. Oh, Minimal universality criterion sets on the representations of binary quadratic forms, J. Number Theory 238 (2022), 37--59

    2022

  34. [42]

    S. D. Kominers, Uniqueness of the 2-universality criterion, Note Mat. 28 (2008), 203--206

    2008

  35. [43]

    S. D. Kominers, Oh's 8-universality criterion is unique, Kyungpook Math. J. 61 (2021), 455--459

    2021

  36. [44]

    V. Kala, O. Prakash, There is no 290-Theorem for higher degree forms, Math. Nachr. 297 (2024), 4322--4332

    2024

  37. [45]

    Krásenský, How small can a universality criterion be?, in preparation

    J. Krásenský, How small can a universality criterion be?, in preparation

  38. [46]

    V. Kala, J. Svoboda, Universal quadratic forms over multiquadratic fields, Ramanujan J. 48 (2019), 151--157

    2019

  39. [47]

    V. Kala, M. Tinková, Universal quadratic forms, small norms and traces in families of number fields, Int. Math. Res. Not. IMRN (2023), 7541--7577

    2023

  40. [48]

    Krásenský, M

    J. Krásenský, M. Tinková, K. Zemková, There are no universal ternary quadratic forms over biquadratic fields, Proc. Edinb. Math. Soc. 63 (2020), 861--912

    2020

  41. [49]

    V. Kala, P. Yatsyna, On K itaoka's conjecture and lifting problem for universal quadratic forms , Bull. Lond. Math. Soc. 55 (2023), 854--864

    2023

  42. [50]

    V. Kala, P. Yatsyna, Even better sums of squares over quintic and cyclotomic fields, Rev. Math. Complut., to appear. arXiv:2402.03850

    arXiv

  43. [51]

    V. Kala, P. Yatsyna, B. \.Zmija, Real quadratic fields with a universal quadratic form of given rank have density zero, Amer. J. Math., to appear. arXiv:2302.12080

    arXiv

  44. [52]

    Y. M. Lee, Universal forms over ( 5) , Ramanujan J. 16 (2008), 97--104

    2008

  45. [53]

    U ber die D arstellung total positiver Z ahlen des K \

    H. Maass, \" U ber die D arstellung total positiver Z ahlen des K \" o rpers R( 5 ) als S umme von drei Q uadraten , Abh. Math. Sem. Hamburg 14 (1941), 185--191

    1941

  46. [54]

    S. H. Man, Minimal rank of universal lattices and number of indecomposable elements in real multiquadratic fields, Adv. Math. 447 (2024), article 109694, 38 pp

    2024

  47. [55]

    Y. S. Moon, Universal quadratic forms and the 15-theorem and 290-theorem, Undergraduate honors thesis, Stanford University, 2008. Available at: https://web.archive.org/web/20140814082644/https://math.stanford.edu/theses/moon.pdf

    2008

  48. [56]

    Oh, Universal Z-lattices of minimal rank, Proc

    B.-K. Oh, Universal Z-lattices of minimal rank, Proc. Amer. Math. Soc. 128 (2000), 683--689

    2000

  49. [57]

    O. T. O'Meara, Introduction to Quadratic Forms, Springer-Verlag, 1973

    1973

  50. [58]

    Ramanujan, On the expression of a number in the form ax^2 + by^2 + cz^2 + du^2 , Proc

    S. Ramanujan, On the expression of a number in the form ax^2 + by^2 + cz^2 + du^2 , Proc. Cambridge Philos. Soc. 19 (1917), 11--21

    1917

  51. [59]

    Rouse, Quadratic forms representing all odd positive integers, Amer

    J. Rouse, Quadratic forms representing all odd positive integers, Amer. J. Math. 136 (2014), 1693--1745

    2014

  52. [60]

    C. L. Siegel, Sums of m -th powers of algebraic integers, Ann. of Math. 46 (1945), 313--339

    1945

  53. [61]

    F. Xu, Y. Zhang, On indefinite and potentially universal quadratic forms over number fields, Trans. Amer. Math. Soc. 375 (2022), 2459--2480

    2022

  54. [62]

    Yatsyna, A lower bound for the rank of a universal quadratic form with integer coefficients in a totally real field, Comment

    P. Yatsyna, A lower bound for the rank of a universal quadratic form with integer coefficients in a totally real field, Comment. Math. Helv. 94 (2019), 221--239

    2019

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.