Year: 2026
Type: preprint
Abstract: A standard question in computational real algebraic geometry is to compute all real solutions to a system of polynomial equations with real coefficients. One classical and promising approach is to track along a connected component of a real curve defined by a Newton homotopy, which is dependent upon the selected start point. As the start point varies, different subsets of real solutions may be obtained. This yields a partition of the space of start points into cells, and it is important to understand the structure of this partition in order to develop efficient algorithms based on Newton homotopies. The structure of the boundary of such cells and the number of cells in the corresponding partition are investigated for bivariate systems. Several examples are included to demonstrate the results.
Source: arXiv (Cornell University)
Institutions: North Carolina State University, University of Notre Dame
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W7214281387