Back to Search
Start Over
SÁRKÖZY'S THEOREM IN VARIOUS FINITE FIELD SETTINGS.
- Source :
-
SIAM Journal on Discrete Mathematics . 2024, Vol. 38 Issue 2, p1400-1416. 8p. - Publication Year :
- 2024
-
Abstract
- In this paper, we strengthen a result by Green about an analogue of Sárközy's theorem in the setting of polynomial rings Fq[x]. In the integer setting, for a given polynomial F ∈ Z[x] with constant term zero, (a generalization of) Sárközy's theorem gives an upper bound on the maximum size of a subset A ⊂{1, ..., n} that does not contain distinct α1, α2 ∈ A satisfying α1, -- α2 = F(b) for some b ∈ Z. Green proved an analogous result with much stronger bounds in the setting of subsets A ⊂ Fq[x] of the polynomial ring Fq[x], but this result required the additional condition that the number of roots of the polynomial F ∈ Fq[x] be coprime to q. We generalize Green's result, removing this condition. As an application, we also obtain a version of Sárközy's theorem with similar strong bounds for subsets A ⊂ Fq for q=pn for a fixed prime p and large n. [ABSTRACT FROM AUTHOR]
- Subjects :
- *NUMBER theory
*POLYNOMIAL rings
*POLYNOMIALS
*FINITE fields
*COMBINATORICS
Subjects
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 38
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 178602100
- Full Text :
- https://doi.org/10.1137/23M1563256