English

Squarefree polynomials with prescribed coefficients

Number Theory 2017-07-21 v1 Combinatorics

Abstract

For nonempty subsets S0,,Sn1S_0, \dots, S_{n-1} of a (large enough) finite field F\mathbb{F} satisfying S1,,Sn1>2orS1,Sn1>n1,|S_1|, \dots, |S_{n-1}| > 2 \quad \mathrm{or} \quad |S_1|,|S_{n-1}| > n - 1, we show that there exist a0S0,,an1Sn1a_0 \in S_0, \dots, a_{n-1} \in S_{n-1} such that Tn+an1Tn1++a1T+a0F[T] T^n + a_{n-1}T^{n-1} + \dots + a_1T + a_0 \in \mathbb{F}[T] is a squarefree polynomial.

Keywords

Cite

@article{arxiv.1707.06528,
  title  = {Squarefree polynomials with prescribed coefficients},
  author = {Amotz Oppenheim and Mark Shusterman},
  journal= {arXiv preprint arXiv:1707.06528},
  year   = {2017}
}
R2 v1 2026-06-22T20:52:58.465Z