On sets of polynomials whose difference set contains no squares

dc.contributor.authorHoang Le, Thai
dc.contributor.authorLiu, Yu-Ru
dc.date.accessioned2023-10-03T15:12:39Z
dc.date.available2023-10-03T15:12:39Z
dc.date.issued2013
dc.description.abstractLet Fq[t] be the polynomial ring over the finite field Fq, and let GN be the subset of Fq[t] containing all polynomials of degree strictly less than N. Define D(N) to be the maximal cardinality of a set A⊆GN for which A−A contains no squares of polynomials. By combining the polynomial Hardy–Littlewood circle method with the density increment technology developed by Pintz, Steiger and Szemerédi, we prove that D(N)≪qN(logN)7/N.en
dc.identifier.urihttps://doi.org/10.4064/aa161-2-2
dc.identifier.urihttp://hdl.handle.net/10012/20002
dc.language.isoenen
dc.publisherInstitute of Mathematics: Polish Academy of Sciencesen
dc.relation.ispartofseriesActa Arithmetica;161
dc.subjectSarkozy's theoremen
dc.subjectfunction fieldsen
dc.subjectcircle methoden
dc.titleOn sets of polynomials whose difference set contains no squaresen
dc.typeArticleen
dcterms.bibliographicCitationLê, T. H., & Liu, Y.-R. (2013). On sets of polynomials whose difference set contains no squares. Acta Arithmetica, 161(2), 127–143. https://doi.org/10.4064/aa161-2-2en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Pure Mathematicsen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2013-differenceset-nosquare.pdf
Size:
332.23 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description: