Squarefree polynomials with prescribed coefficients

DOI10.1016/j.jnt.2017.10.025zbMath1416.11165arXiv1707.06528OpenAlexW2962811246MaRDI QIDQ1747219

Mark Shusterman, Amotz Oppenheim

Publication date: 4 May 2018

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

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

zbMATH Keywords

function fieldssquarefreescombinatorial Nullstellensatzbinary digits

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (4)

Asymptotic equidistribution for partition statistics and topological invariants ⋮ The distance to square-free polynomials ⋮ Irreducible Polynomials Over a Finite Field with Restricted Coefficients ⋮ The distance to a squarefree polynomial over $\mathbb F_2[x$]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Squarefree polynomials and Möbius values in short intervals and arithmetic progressions
• Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients
• Square-full polynomials in short intervals and in arithmetic progressions
• The distribution of irreducible polynomials in \(\mathbb{F}_q[t\)]
• The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace
• A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
• Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed
• On RSA moduli with almost half of the bits prescribed
• On arithmetic properties of integers with missing digits. I: Distribution in residue classes
• On arithmetic properties of integers with missing digits. II: Prime factors
• Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients.
• Irreducible polynomials over GF(2) with prescribed coefficients.
• On RSA moduli with half of the bits prescribed
• Almost primes whose expansion in base \(r\) misses some digits
• Prime polynomials in short intervals and in arithmetic progressions
• Prescribing the binary digits of primes. II
• On extremal problems of graphs and generalized graphs
• Primes with restricted digits
• Irreducible polynomials with consecutive zero coefficients
• On RSA moduli with prescribed bit patterns
• The Variance of the Number of Prime Polynomials in Short Intervals and in Residue Classes
• Sur les nombres premiers ayant des chiffres initiaux et finals donnés
• Primes with preassigned digits
• The Covariance of Almost-Primes in 𝔽_q[T]
• Primes with preassigned digits II
• ON POLYNOMIALS OF PRESCRIBED HEIGHT IN FINITE FIELDS
• A Note on Primes, with Arbitrary Initial or Terminal Decimal Ciphers, in Dirichlet Arithmetic Progressions
• Combinatorial Nullstellensatz
• Generators and irreducible polynomials over finite fields
• Arithmetic properties of numbers with restricted digits
• Squarefree values of polynomials all of whose coefficients are 0 and 1
• Primes with preassigned digits
• Prescribing the binary digits of squarefree numbers and quadratic residues
• A new proof of the Hansen-Mullen irreducibility conjecture
• A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS
• The Distribution of Irreducibles in GF [ q,x ]
• Uniform Distribution of Polynomials Over Finite Fields
• Irreducible polynomials with several prescribed coefficients
• Irreducible polynomials with several prescribed coefficients
• Proof of a conjecture of S. Chowla
• On the number of prime factors of integers characterized by digit properties
• Arithmetic properties of integers with missing digits: distribution in residue classes
• Zero-density sets containing integers with at most two prime factors

This page was built for publication: Squarefree polynomials with prescribed coefficients