AbstractWe generalize Carlitzʼ result on the number of self-reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula holds for the number of irreducible polynomials obtained by a fixed quadratic transformation. Our main tools are a combinatorial argument and Hurwitz genus formula
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
AbstractWe generalize Carlitzʼ result on the number of self-reciprocal monic irreducible polynomials...
A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a ...
AbstractWe obtain an equivalent version of Carlitz's formula for the number of monic irreducible pol...
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palin...
AbstractWe prove estimates for the number of self-reciprocal monic irreducible polynomials over a fi...
AbstractThe connection between a certain class of necklaces and self-reciprocal polynomials over fin...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
Dedicated to Iekata Shiokawa on the occasion of his 65th birthday and retirement. Abstract. We study...
AbstractWe count the number of irreducible polynomials in several variables of a given degree over a...
AbstractWe discuss several enumerative results for irreducible polynomials of a given degree and pai...
AbstractUsing a natural action of the permutation group S3 on the set of irreducible polynomials, we...
AbstractWe prove a new formula for the generating function of polynomials counting absolutely stable...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
AbstractWe generalize Carlitzʼ result on the number of self-reciprocal monic irreducible polynomials...
A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a ...
AbstractWe obtain an equivalent version of Carlitz's formula for the number of monic irreducible pol...
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palin...
AbstractWe prove estimates for the number of self-reciprocal monic irreducible polynomials over a fi...
AbstractThe connection between a certain class of necklaces and self-reciprocal polynomials over fin...
AbstractUsing the Stickelberger–Swan theorem, the parity of the number of irreducible factors of a s...
Dedicated to Iekata Shiokawa on the occasion of his 65th birthday and retirement. Abstract. We study...
AbstractWe count the number of irreducible polynomials in several variables of a given degree over a...
AbstractWe discuss several enumerative results for irreducible polynomials of a given degree and pai...
AbstractUsing a natural action of the permutation group S3 on the set of irreducible polynomials, we...
AbstractWe prove a new formula for the generating function of polynomials counting absolutely stable...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
DOI
Add to ORKG