Cyclotomic ordering conjecture
Abstract
This note describes a conjecture involving cyclotomic polynomials and some initial thoughts towards a solution. Given positive integers m,n, the conjecture is that either m(q)≤slantn(q) or m(q)≥slantn(q) holds for all integers q≥slant 2. Pomerance and Rubinstein-Salzedo proved the conjecture in a preprint called `Cyclotomic coincidences' [arXiv:1903.01962].
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.