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 kth power. Following the polynomial method breakthrough of Croot, Lev, and Pach, Green proved a strong quantitative version of this result for mathbbFq[T]. 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 mathbbZ. We construct a set A of polynomials of degree <n such that A does not contain a kth power difference with |A|=qn−n/2k. 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.












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)