The $3$-sparsity of $X^n-1$ over finite fields
Kaimin Cheng

TL;DR
This paper characterizes when the polynomial $X^n - 1$ over finite fields is 3-sparse, meaning all irreducible factors are binomials or trinomials, providing a complete answer for fields of odd characteristic.
Contribution
It proves a necessary and sufficient condition for $X^n - 1$ to be 3-sparse over finite fields of odd characteristic, solving an open problem for such fields.
Findings
$X^n - 1$ is 3-sparse iff $n$ is a product of primes dividing $q^2 - 1$
The result applies to all positive integers not divisible by the characteristic prime
Resolves the open problem for finite fields of odd characteristic
Abstract
Let be a prime power and the finite field with elements. For a positive integer , the binomial is said to be -sparse over if every irreducible factor of in is either a binomial or a trinomial. In 2021, Oliveira and Reis characterized all positive integers for which is -sparse over when and , and raised the open problem of whether, for any given , there are only finitely many primes such that is -sparse over . In this paper, if is a power of an odd prime , we then establish that for any positive integer not divisible by , is -sparse over if and only if for some nonnegative integers , where are distinct prime…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Algebraic Geometry and Number Theory
