AbstractVarious results on the parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Stickelberger's and Swan's theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. A relation between the discriminants of the composed polynomial and the original ones will be established. We apply this to obtain some results concerning the parity of the number of irreducible factors for several special types of polynomials over finite fields
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
The focus of this paper is testing the irreducibility of polynomials over finite fields. In particul...
AbstractVarious results on the parity of the number of irreducible factors of given polynomials over...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
AbstractIt is well known that the Stickelberger–Swan theorem is very important for determining the r...
AbstractThere has been some interest in finding irreducible polynomials of the type f(A(x)) for cert...
AbstractLet Fq[X] denote the multiplicative semigroups of monic polynomials in one indeterminate X, ...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
The construction of irreducible polynomials over finite fields is currently a strong subject of inte...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
AbstractLet Fq denote the finite field of order q=pr, p a prime and r a positive integer, and let f(...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
The focus of this paper is testing the irreducibility of polynomials over finite fields. In particul...
AbstractVarious results on the parity of the number of irreducible factors of given polynomials over...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
AbstractIt is well known that the Stickelberger–Swan theorem is very important for determining the r...
AbstractThere has been some interest in finding irreducible polynomials of the type f(A(x)) for cert...
AbstractLet Fq[X] denote the multiplicative semigroups of monic polynomials in one indeterminate X, ...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
The construction of irreducible polynomials over finite fields is currently a strong subject of inte...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
AbstractLet Fq denote the finite field of order q=pr, p a prime and r a positive integer, and let f(...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
The focus of this paper is testing the irreducibility of polynomials over finite fields. In particul...