Maximum gap in (inverse) cyclotomic polynomial (Q448219)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6074387
Language Label Description Also known as
default for all languages
No label defined
    English
    Maximum gap in (inverse) cyclotomic polynomial
    scientific article; zbMATH DE number 6074387

      Statements

      Maximum gap in (inverse) cyclotomic polynomial (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      30 August 2012
      0 references
      0 references
      cyclotomic polynomial
      0 references
      inverse cyclotomic polynomial
      0 references
      gap
      0 references
      coefficients
      0 references
      Let \(\Phi_n(X)\) denote the \(n\)-th cyclotomic polynomial and \(\Psi_n(X)=(X^n-1)/\Phi_n(X)\), the \(n\)-th inverse cyclotomic polynomial. The authors are concerned with the maximum of the differences (gaps) between two consecutive exponents occurring in these polynomials, which they denote by \(g(\Phi_n)\), respectively \(g(\Psi_n)\). They reduce the study of these gaps to the case where \(n\) is square-free and odd. The first three cases are easy and the authors show that if \(p_1<p_2\) are odd primes, then \(g(\Phi_{p_1})=1\), \(g(\Psi_{p_1})=1\), and \(g(\Psi_{p_1p_2})=p_2-p_1+1\). They establish the following three theorems for the simplest non-trivial cases (with \(2<p_1<p_2<p_3\) arbitrary primes):NEWLINENEWLINE NEWLINETheorem 1. \(g(\Phi_{p_1p_2})=p_1-1\).NEWLINENEWLINE NEWLINETheorem 2. If \(p_2\geq 4(p_1-1)\) or \(p_3\geq p_1^2\), then \(g(\Psi_n)=2n/p_1-\deg(\Psi_n)\).NEWLINENEWLINE NEWLINETheorem 3. We have NEWLINE\[NEWLINE\max\left\{p_1-1,{2n\over p_1}-\deg(\Psi_n)\right\}\leq g(\Psi_n)<2n\left({1\over p_1}+{1\over p_2}+{1\over p_3}\right)-\deg(\Psi_n).NEWLINE\]NEWLINE Note that the degree of \(\Psi_n\) equals \(n-\varphi(n)\), with \(\varphi\) Euler's \(\varphi\)-function.NEWLINENEWLINE The paper has various diagrams that are helpful in visualizing the proofs.
      0 references

      Identifiers