AbstractLet f(X1,…, Xn) be an absolutely irreducible polynomial with coefficients in a finite field. Elementary methods are used to derive an explicit lower bound for the number of zeros of f
Coefficients of polynomials over finite fields often encode information that can be applied in vario...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
AbstractLet f(X1,…, Xn) be an absolutely irreducible polynomial with coefficients in a finite field....
AbstractLet F be a finite field with q=pf elements, where p is a prime. Let N be the number of solut...
AbstractLet F be a finite field with q=pf elements, where p is a prime number. Let N(n) be the numbe...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
O objetivo principal deste trabalho é o estudo do número de soluções de equações polinomiais definid...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
Let s be a positive integer, p be an odd prime, q=ps, and let Fq be a finite field of q elements. Le...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
: Given a polynomial f 2 k[x], k a number field, we consider bounds on the number of cyclotomic fact...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Coefficients of polynomials over finite fields often encode information that can be applied in vario...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
AbstractLet f(X1,…, Xn) be an absolutely irreducible polynomial with coefficients in a finite field....
AbstractLet F be a finite field with q=pf elements, where p is a prime. Let N be the number of solut...
AbstractLet F be a finite field with q=pf elements, where p is a prime number. Let N(n) be the numbe...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
O objetivo principal deste trabalho é o estudo do número de soluções de equações polinomiais definid...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
Let s be a positive integer, p be an odd prime, q=ps, and let Fq be a finite field of q elements. Le...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
: Given a polynomial f 2 k[x], k a number field, we consider bounds on the number of cyclotomic fact...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
Coefficients of polynomials over finite fields often encode information that can be applied in vario...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
DOI
Add to ORKG