Publication:5377465

DOI10.4153/CMB-2018-027-XzbMATH Open1505.11148arXiv1711.06243OpenAlexW2768936014MaRDI QIDQ5377465FDOQ5377465

Sam Porritt

Publication date: 24 May 2019

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Abstract: We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a finite field F_q whose coefficients are restriced to lie in a given subset of F_q.

Full work available at URL: https://arxiv.org/abs/1711.06243

zbMATH Keywords

finite fieldirreducible polynomialrestricted coefficients

Mathematics Subject Classification ID

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

Cites Work

• Irreducible polynomials with several prescribed coefficients
• Primes with restricted digits
• On the number of \(N\)-free elements with prescribed trace
• The expression of a polynomial as a sum of three irreducibles
• Irreducible polynomials with several prescribed coefficients
• Prescribing the binary digits of squarefree numbers and quadratic residues
• Squarefree polynomials with prescribed coefficients
• Polynomial values and generators with missing digits in finite fields

Cited In (7)

• On the distribution of the Rudin-Shapiro function for finite fields
• Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
• Irreducibility of random polynomials: general measures
• Infinitude of Wilson primes for F_q[t]
• A correspondence of certain irreducible polynomials over finite fields
• Pseudorandom sequences derived from automatic sequences
• Irreducible polynomials over finite fields. I

This page was built for publication: Irreducible Polynomials Over a Finite Field with Restricted Coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377465)