Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...

This is a preview. Log in through your library . Abstract We extend the famous diophantine Frobenius problem to a ring of polynomials over a field 𝑘. Similar to the classical problem we show that the ...

We give an asymptotic formula for the proportion of polynomials of a given degree over a finite field which do not have odd degree irreducible factors. In the case of odd characteristic, this leads to ...