Maximum Gap in (Inverse) Cyclotomic Polynomial

Abstract

Let g(f) denote the maximum of the differences (gaps) between two consecutive exponents occurring in a polynomial f. Let n denote the n-th cyclotomic polynomial and let n denote the n-th inverse cyclotomic polynomial. In this note, we study g(n) and g(n) where n is a product of odd primes, say p1 < p2 < p3, etc. It is trivial to determine g(p1), g(p1) and g(p1p2). Hence the simplest non-trivial cases are g(p1p2) and g(p1p2p3). We provide an exact expression for g(p1p2). We also provide an exact expression for g(p1p2p3) under a mild condition. The condition is almost always satisfied (only finite exceptions for each p1). We also provide a lower bound and an upper bound for g(p1p2p3).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…