Topological complexity of finding flex points on cubic plane curves
We prove a lower bound for the topological complexity, in the sense of Smale, of the problem of finding a flex point on a cubic plane curve. The key is to bound the Schwarz genus of a cover associated to this problem. We also show that our lower bound for the complexity is close to the best possible.
Authors
- Zheyan Wan (ORCID: https://orcid.org/0000-0002-2714-0578)
- Weiyan Chen (ORCID: https://orcid.org/0000-0001-6077-3484)
Publication Details
- Journal
- Proceedings of the American Mathematical Society
- Published
- 2024-12-30
- DOI
- https://doi.org/10.1090/proc/17184
- Primary Topic
- Topological and Geometric Data Analysis
- Type
- article
- Field-Weighted Citation Impact
- 0.00