2008
DOI: 10.1007/s00006-008-0090-y
|View full text |Cite
|
Sign up to set email alerts
|

Quadratic Forms over $${\mathbb{Z}}$$ from Diophantus to the 290 Theorem

Abstract: What follows 1 is a brief historical survey of the representation theory of quadratic forms over the integers. It starts with questions considered by Diophantus about 1800 years ago, dashes past classical contributions of Euler, Lagrange, and Sylvester, considers work of Ramanujan and Dickson, continues with theorems of Conway and Schneeberger, and ends with a short sketch of the proof of the 290-Theorem by Bhargava and Hanke. This survey is self-contained in the sense that all the basic definitions and concep… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 16 publications
1
2
0
Order By: Relevance
“…Remark 2.3. As pointed out by [6], Bhargava also proved the above result. However, no proof of this has appeared in the literature to the author's knowledge.…”
Section: Uniqueness Of the Minimal Universality Criterion Setsupporting
confidence: 61%
“…Remark 2.3. As pointed out by [6], Bhargava also proved the above result. However, no proof of this has appeared in the literature to the author's knowledge.…”
Section: Uniqueness Of the Minimal Universality Criterion Setsupporting
confidence: 61%
“…This was proved in more generality by Kim et al [7]. Bhargava asserted (see [5,Theorem C,page 674]) that if T is the set of prime numbers, then the corresponding smaller finite set S is given by S = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 67, 73}, but no proof of this has appeared in the literature to the authors' knowledge. Should this set S be proven to be correct, then it is straightforward to verify that the unproven forms in Table 1 represent all primes in S, and Theorems 1.6 and 1.7 would be unconditional.…”
Section: Final Remarksmentioning
confidence: 76%
“…. , t r ) using an invertible matrix U (see, e.g., [75]). The TQFT is then characterized by the number of +1 and −1 Legendre symbols of the t i 's.…”
Section: In Order To Compute the Fusionmentioning
confidence: 99%