Chebyshev varieties
Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play the role of toric varieties in sparse polynomial root finding, when monomials are replaced by Chebyshev polynomials. We present numerical root finding algorithms that exploit our results.
Authors
- Zaïneb Bel-Afia
- Chiara Meroni
- Simon Telen
Institutions
- University of Oxford (GB)
- Max Planck Institute for Mathematics in the Sciences (DE)
- Instituto de Física Teórica (ES)
Publication Details
- Journal
- Mathematics of Computation
- Published
- 2025-07-24
- DOI
- https://doi.org/10.1090/mcom/4125
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Walter Haefner Stiftung
- ETH Zürich Foundation