Maximum gap in (inverse) cyclotomic polynomial
From MaRDI portal
Publication:448219
DOI10.1016/j.jnt.2012.04.008zbMath1273.11051arXiv1101.4255WikidataQ57430431 ScholiaQ57430431MaRDI QIDQ448219
Cheol-Min Park, Hoon Hong, Hyang-Sook Lee, Eun Jeong Lee
Publication date: 30 August 2012
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.4255
11C08: Polynomials in number theory
Related Items
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)$, Cyclotomic coefficients: gaps and jumps, On the number of terms of some families of the ternary cyclotomic polynomials Φ3p2p3, 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
Cites Work
- Cyclotomic polynomial coefficients \(a(n,k)\) with \(n\) and \(k\) in prescribed residue classes
- Inverse cyclotomic polynomials
- On the coefficients of ternary cyclotomic polynomials
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- A taxonomy of pairing-friendly elliptic curves
- Flat cyclotomic polynomials of order three
- Ternary cyclotomic polynomials having a large coefficient
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- On the Cyclotomic Polynomial $Phi\{pq} (X)$
- Unnamed Item
- Unnamed Item
- Unnamed Item