Maximum gap in (inverse) cyclotomic polynomial
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.
- A taxonomy of pairing-friendly elliptic curves
- Cyclotomic polynomial coefficients \(a(n,k)\) with \(n\) and \(k\) in prescribed residue classes
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Flat cyclotomic polynomials of order three
- scientific article; zbMATH DE number 3614843 (Why is no real title available?)
- scientific article; zbMATH DE number 3637982 (Why is no real title available?)
- scientific article; zbMATH DE number 2053193 (Why is no real title available?)
- Inverse cyclotomic polynomials
- On the coefficients of ternary cyclotomic polynomials
- On the Cyclotomic Polynomial $Phi\{pq} (X)$
- Optimal Pairings
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- Ternary cyclotomic polynomials having a large coefficient
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- Maximum gap in cyclotomic polynomials
- Binary cyclotomic polynomials: representation via words and algorithms
- A survey on coefficients of cyclotomic polynomials
- Constrained ternary integers
- On the scaled inverse of \((x^i-x^j)\) modulo cyclotomic polynomial of the form \(\Phi_{p^s}(x)\) or \(\Phi_{p^s q^t}(x)\)
- Maximum gaps in a class of ternary cyclotomic polynomials
- Remarks on the maximum gap in binary cyclotomic polynomials
- Cyclotomic coefficients: gaps and jumps
- On the number of terms of some families of the ternary cyclotomic polynomials Φ3p2p3
- Gaps in binary cyclotomic polynomials
This page was built for publication: Maximum gap in (inverse) cyclotomic polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448219)