2013
DOI: 10.48550/arxiv.1308.0999
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

$p$-adic Zeros of Quintic Forms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Besides these considerations, we put a general effort on implementing the algorithm efficiently. The full C++ program and the data used in the assembling process are available at [5]. This completes the proof of Theorem 1.…”
Section: Proof Of Theoremmentioning
confidence: 62%
“…Besides these considerations, we put a general effort on implementing the algorithm efficiently. The full C++ program and the data used in the assembling process are available at [5]. This completes the proof of Theorem 1.…”
Section: Proof Of Theoremmentioning
confidence: 62%
“…For some other small degrees, the conjecture was confirmed except for a concrete list of small primes. For quintic forms, for example, p-adic solubility is guaranteed for all primes p ≥ 11 (Dumke [14]). Certainly the conjecture was very influential in shaping the subject area, and remains a source of inspiration and inquiry.…”
Section: Introductionmentioning
confidence: 99%