Abstract. Schinzel’s Hypothesis H predicts that a family of irre-ducible polynomials over the integers satisfying certain necessary local conditions simultaneously assumes prime values infinitely of-ten. Here we consider an analogue of Hypothesis H for one-variable polynomials over the q-element finite field Fq and show that it holds whenever q is large compared to the degree of the product of the polynomials involved. We also show that for fixed q, the conclu-sion of our Hypothesis H holds for “almost all ” single-polynomial families. Along the way we propose a new polynomial analogue of the Hardy-Littlewood/Bateman-Horn conjectures
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
The Schinzel hypothesis over Z: Let f1(x),..., fr(x) be irreducible poly-nomials with coefficients i...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...
Following Beard, O’Connell and West (1977) we call a polynomial over a finite field Fq perfect if it...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
AbstractFollowing Beard, O'Connell and West [J.T.B. Beard Jr., J.R. O'Connell Jr., K.I. West, Perfec...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
AbstractLet r be a positive integer and f1,…,fr be distinct polynomials in Z[X]. If f1(n),…,fr(n) ar...
AbstractIn 1901, von Koch showed that the Riemann Hypothesis is equivalent to the assertion that∑p⩽x...
The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is ...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
The Schinzel hypothesis over Z: Let f1(x),..., fr(x) be irreducible poly-nomials with coefficients i...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...
Following Beard, O’Connell and West (1977) we call a polynomial over a finite field Fq perfect if it...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
AbstractFollowing Beard, O'Connell and West [J.T.B. Beard Jr., J.R. O'Connell Jr., K.I. West, Perfec...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
AbstractLet r be a positive integer and f1,…,fr be distinct polynomials in Z[X]. If f1(n),…,fr(n) ar...
AbstractIn 1901, von Koch showed that the Riemann Hypothesis is equivalent to the assertion that∑p⩽x...
The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is ...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
The Schinzel hypothesis over Z: Let f1(x),..., fr(x) be irreducible poly-nomials with coefficients i...