2013
DOI: 10.7169/facm/2013.48.2.3
|View full text |Cite
|
Sign up to set email alerts
|

Pairs of additive forms of degree $p^\tau(p-1)$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…For p ≥ 3 and k = p τ (p − 1) on the other hand, the bound was further sharpened by Godinho and de Souza Neto [6,7] who proved that s ≥ 2 p p−1 k 2 − 2k suffices for p ∈ {3, 5} and if τ ≥ p−1 2 for p ≥ 7 as well. For k = 6 = 3⋅2, the bound s > 2k 2 was reached by Godinho, Knapp and Rodrigues [8] while later Godinho and Ventura [9] showed that this bound suffices for k = 3 τ ⋅ 2 with τ ≥ 2 as well.…”
Section: Introductionmentioning
confidence: 97%
“…For p ≥ 3 and k = p τ (p − 1) on the other hand, the bound was further sharpened by Godinho and de Souza Neto [6,7] who proved that s ≥ 2 p p−1 k 2 − 2k suffices for p ∈ {3, 5} and if τ ≥ p−1 2 for p ≥ 7 as well. For k = 6 = 3⋅2, the bound s > 2k 2 was reached by Godinho, Knapp and Rodrigues [8] while later Godinho and Ventura [9] showed that this bound suffices for k = 3 τ ⋅ 2 with τ ≥ 2 as well.…”
Section: Introductionmentioning
confidence: 97%
“…For p 3 and k = p τ (p − 1) on the other hand, the bound was further sharpened by Godinho and de Souza Neto [6,7] who proved that s > 2 p p−1 k 2 − 2k suffices for p ∈ {3, 5} and if τ p−1 2…”
Section: Introductionmentioning
confidence: 97%
“…For p3 and k=pτfalse(p1false) on the other hand, the bound was further sharpened by Godinho and de Souza Neto [6, 7] who proved that s>2pp1k22k suffices for p{3,5} and if τp12 for p7 as well. For k=6=3·2, the bound s>2k2 was reached by Godinho, Knapp and Rodrigues [8] while later Godinho and Ventura [9] showed that this bound suffices for k=3τ·2 with τ2 as well.…”
Section: Introductionmentioning
confidence: 98%
“…For p ≥ 3 and k = p τ (p − 1) on the other hand, the bound was further sharpened by Godinho and de Souza Neto [20,21]…”
Section: Introductionmentioning
confidence: 90%