Pith. sign in

REVIEW

Primitive prime divisors and the n-th cyclotomic polynomial

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1504.02598 v4 pith:VM5AHWET submitted 2015-04-10 math.NT

Primitive prime divisors and the n-th cyclotomic polynomial

classification math.NT
keywords divisorsprimeprimitivealgorithmcertaincyclotomicdefinitiongiven
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $\Phi^*_n(q)$, which is closely related to the cyclotomic polynomial $\Phi_n(x)$ and to primitive prime divisors of $q^n-1$. Our definition of $\Phi^*_n(q)$ is novel, and we prove it is equivalent to the definition given by Hering. Given positive constants $c$ and $k$, we give an algorithm for determining all pairs $(n,q)$ with $\Phi^*_n(q)\le cn^k$. This algorithm is used to extend (and correct) a result of Hering which is useful for classifying certain families of subgroups of finite linear groups.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.