Square-free values of multivariate polynomials over function fields in linear sparse sets

DOI10.1142/S1793042117500063MaRDI QIDQ3179505zbMATH OpenOpenAlexFDO

Publication date 21 December 2016

Published in International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.7449

discriminant square-free square-free values

Polynomials in number theory (11C08) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Abstract: Let f be a square-free polynomial in Fq[t][x] where Fq is a field of q elements. We view f as a polynomial in the variable x with coefficients in the ring Fq[t]. We study squarefree values of f in sparse subsets of Fq[t] which are given by a linear condition. The motivation for our study is an analogue problem of representing square-free integers by integer polynomials, where it is conjectured that setting aside some simple exceptional cases, a square-free polynomial f in Z[x] takes infinitely many square-free values. Let c(t) be a polynomial in Fq[t] of degree less than m, and let k < m be coprime to q. A consequence of the main result we show, is that if q is sufficiently large with respect to m and the degrees of f in t and x, then there exist

in Fq such that

is square-free. Moreover, as q tends to infinity, the last is true for almost all

and

in Fq. The main result shows that a similar result holds also for other cases. We then generalize the results to multivariate polynomials.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Square-free values of multivariate polynomials over function fields in linear sparse sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179505)