Abstract
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees the vector of coefficients of the polynomial as a word on a ternary alphabet \(\{-1,0,+1\}\). It designs an efficient algorithm that computes a compact representation of this word. This algorithm is of linear time with respect to the size of the output, and, thus, optimal. This approach allows to recover known properties of coefficients of binary cyclotomic polynomials, and extends to the case of polynomials associated with numerical semi-groups of dimension 2.
Supported by Project UNGS 30/3307, Project Stic AmSud 20STIC-06 and LIA SINFIN.
Dedicated to Adrián Tato Álvarez.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arnold, A., Monagan, M.: Calculating cyclotomic polynomials. Math. Comp. 80(276), 2359–2379 (2011)
Camburu, O., Ciolan, E., Luca, F., Moree, P., Shparlinski, I.: Cyclotomic coefficients: gaps and jumps. J. Number Theor. 163, 211–237 (2016)
Hong, H., Lee, E., Lee, H.S., Park, C.M.: Maximum gap in (inverse) cyclotomic polynomial. J. Number Theor. 132(10), 2297–2315 (2012)
Lam, T., Leung, K.: On the cyclotomic polynomial \(\phi _{pq}(x)\). Am. Math. Mon. 103(7), 562–564 (1996)
Lenstra, H.W.: Vanishing sums of roots of unity. In: Proceedings, Bicentennial Congress Wiskundig Genootschap Vrije University, Amsterdam, 1978, Part II. Math. Centre Tracts, Mathematisch Centrum, Amsterdam, vol. 101, pp. 249–268 (1979)
Moree, P.: Numerical semigroups, cyclotomic polynomials, and Bernoulli numbers. Amer. Math. Mon. 121(10), 890–902 (2014)
Zhang, B.: Remarks on the maximum gap in binary cyclotomic polynomials. Bull. Math. Soc. Sci. Math. Roumanie 59(107), 109–115 (2016)
Acknowledgments
The authors wish to thank Brigitte Vallée for many helpful conversations and suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Cafure, A., Cesaratto, E. (2021). Binary Cyclotomic Polynomials: Representation via Words and Algorithms. In: Lecroq, T., Puzynina, S. (eds) Combinatorics on Words. WORDS 2021. Lecture Notes in Computer Science(), vol 12847. Springer, Cham. https://doi.org/10.1007/978-3-030-85088-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-85088-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85087-6
Online ISBN: 978-3-030-85088-3
eBook Packages: Computer ScienceComputer Science (R0)