Sieve methods for polynomial rings over finite fields

DOI10.1016/0022-314X(83)90062-8zbMath0517.10049OpenAlexW2076045237MaRDI QIDQ1053058

William A. Webb

Publication date: 1983

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-314x(83)90062-8

zbMATH Keywords

primitive rootslarge sieveSelberg sievepolynomial rings over finite fieldsirreducible polynomials in arithmetic progression

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Sieves (11N35)

Related Items (7)

Correlations of multiplicative functions in function fields ⋮ Irreducibility of random polynomials: general measures ⋮ Correlation of multiplicative functions over Fq[x$\mathbb {F}_q[x]$: A pretentious approach] ⋮ A polynomial analogue of the twin prime conjecture ⋮ On elementary estimates of arithmetic sums for polynomial rings over finite fields ⋮ The fourth power mean of Dirichlet \(L\)-functions in \(\mathbb{F}_q [T\)] ⋮ THE FOURTH MOMENT OF DIRICHLET L-FUNCTIONS FOR THE RATIONAL FUNCTION FIELD

Cites Work

• Unnamed Item
• Unnamed Item
• On the large sieve method in algebraic number fields
• The expression of a polynomial as a sum of three irreducibles
• The large sieve
• On the large sieve method in GF (q, x)

This page was built for publication: Sieve methods for polynomial rings over finite fields