Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.