pith. the verified trust layer for science. sign in

arxiv: 1101.4255 · v1 · pith:NGDZOKMZnew · submitted 2011-01-22 · 🧮 math.NT

Maximum Gap in (Inverse) Cyclotomic Polynomial

classification 🧮 math.NT
keywords polynomialcyclotomicdenoteboundconditionexactexpressioninverse
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{NGDZOKMZ}

Prints a linked pith:NGDZOKMZ badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

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