Paley graphs and sárközy’s theorem in function fields
From MaRDI portal
(Redirected from Publication:6155914)
Abstract: S'ark"ozy's theorem states that dense sets of integers must contain two elements whose difference is a power. Following the polynomial method breakthrough of Croot, Lev, and Pach, Green proved a strong quantitative version of this result for . In this paper we provide a lower bound for S'{a}rk"{o}zy's theorem in function fields by adapting Ruzsa's construction for the analogous problem in . We construct a set of polynomials of degree such that does not contain a power difference with . Additionally, we prove a handful of results concerning the independence number of generalized Paley Graphs, including a generalization of a claim of Ruzsa, which helps with understanding the limit of the method.
Recommendations
- Sárközy's theorem in function fields
- Difference sets and the irreducibles in function fields
- CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
- On simultaneous digital expansions of polynomial values
- scientific article; zbMATH DE number 6502036
- The distance to square-free polynomials
- Some Ramanujan-Nagell equations with many solutions
- A 2-dimensional analogue of Sárközy's theorem in function fields
- Polynomial configurations in difference sets
- On multiplicative decompositions of the set of the shifted quadratic residues modulo p
Cited in
(7)- Paley-like graphs over finite fields from vector spaces
- Sárközy's theorem in function fields
- A 2-dimensional analogue of Sárközy's theorem in function fields
- A Sárközy Theorem for Finite Fields
- S\'ark\"ozy's Theorem in Various Finite Field Settings
- On Sárközy's theorem for shifted primes
- Intersective sets over abelian groups
This page was built for publication: Paley graphs and sárközy’s theorem in function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155914)