AbstractLet Fq[X] denote a polynomial ring in an indeterminate X over a finite field Fq. Exact formulae are derived for (i) the number of polynomials of degree n in Fq[X] with a specified number of irreducible factors of a fixed degree r in Fq[X] and (ii) the average number of such irreducible factors and corresponding variance for a polynomial of degree n in Fq[X]. The main emphasis is on the case when multiplicity of factors is counted. These results are then applied to derive the mean and variance for the total number of irreducible factors of polynomials of degree n in Fq[X]
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
AbstractLet Fq[X] denote a polynomial ring in an indeterminate X over a finite field Fq. Exact formu...
AbstractLet Fq[X] denote the multiplicative semigroups of monic polynomials in one indeterminate X, ...
AbstractWe discuss several enumerative results for irreducible polynomials of a given degree and pai...
AbstractLet Fq[X] denote the multiplicative semigroups of monic polynomials in one indeterminate X, ...
AbstractVarious results on the parity of the number of irreducible factors of given polynomials over...
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(q)(x),...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
AbstractThis paper deals with the problem of computing the degrees and multiplicities of the irreduc...
AbstractAmong the bivariate polynomials over a finite field, most are irreducible. We count some cla...
AbstractWe discuss several enumerative results for irreducible polynomials of a given degree and pai...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
AbstractLet Fq[X] denote a polynomial ring in an indeterminate X over a finite field Fq. Exact formu...
AbstractLet Fq[X] denote the multiplicative semigroups of monic polynomials in one indeterminate X, ...
AbstractWe discuss several enumerative results for irreducible polynomials of a given degree and pai...
AbstractLet Fq[X] denote the multiplicative semigroups of monic polynomials in one indeterminate X, ...
AbstractVarious results on the parity of the number of irreducible factors of given polynomials over...
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(q)(x),...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
AbstractThis paper deals with the problem of computing the degrees and multiplicities of the irreduc...
AbstractAmong the bivariate polynomials over a finite field, most are irreducible. We count some cla...
AbstractWe discuss several enumerative results for irreducible polynomials of a given degree and pai...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....