On sets of polynomials whose difference set contains no squares
Let \({\mathbb F}^{\times}_{q}[t]\) be the polynomial ring over the finite field \({\mathbb F}_{q}\), and let \({\mathbb G}_{N}\) be the subset of \({\mathbb F}^{\times}_{q}[t]\) containing all polynomials of degree strictly less than \(N\). Define \(D(N)\) to be the maximal cardinality of a set \(A\subseteq{\mathbb G}_{N}\) for which \(A-A\) contains no squares of polynomials. By combining the polynomial Hardy-Littlewood circle method with the density increment technology developed by \textit{J. Pintz, W. L. Steiger} and \textit{E. Szemerédi} [J. Lond. Math. Soc., II. Ser. 37, No. 2, 219--231 (1988; Zbl 0651.10031)], the authors prove that \(D(N)\ll q^{N}(\log N)^{7}/N\).
- Polynomial criterion for abelian difference sets
- The Furstenberg-Sárközy theorem for intersective polynomials in function fields
- Binary quadratic forms in difference sets
- Multivariate polynomial values in difference sets
- Sets in \(\mathbb{Z}_m\) whose difference sets avoid squares
- The Pintz-Steiger-Szemerédi estimate for intersective quadratic polynomials in function fields
- Problems and Results on Intersective Sets
- Equidistribution of polynomial sequences in function fields, with applications
This page was built for publication: On sets of polynomials whose difference set contains no squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859339)
