Smooth connectivity in real algebraic varieties

Abstract A standard question in real algebraic geometry is to compute the number of connected components of a real algebraic variety in affine space. This manuscript provides algorithms for computing the number of connected components, the Euler characteristic, and deciding the connectivity between two points for a smooth manifold arising as the complement of a real hypersurface of a real algebraic variety. When considering the complement of the set of singular points of a real algebraic variety, this yields an approach for determining smooth connectivity in a real algebraic variety. The method is based upon gradient ascent/descent paths on the real algebraic variety inspired by a method proposed by Hong, Rohal, Safey El Din, and Schost for complements of real hypersurfaces. Several examples are included to demonstrate the approach.

Authors

Institutions

Publication Details

Journal
Numerical Algorithms
Published
2024-10-05
DOI
https://doi.org/10.1007/s11075-024-01952-3
Citations
3
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
1.08

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Smooth connectivity in real algebraic varieties

Jonathan D. Hauenstein, Joseph Cummings, Clifford Smyth, Hoon Hong
3 citations
Numerical Algorithms
Polynomial and algebraic computation
1.08
article

Smooth connectivity in real algebraic varieties

Jonathan D. Hauenstein, Joseph Cummings, Clifford Smyth, Hoon Hong
article en
3 citations

Abstract

Abstract A standard question in real algebraic geometry is to compute the number of connected components of a real algebraic variety in affine space. This manuscript provides algorithms for computing the number of connected components, the Euler characteristic, and deciding the connectivity between two points for a smooth manifold arising as the complement of a real hypersurface of a real algebraic variety. When considering the complement of the set of singular points of a real algebraic variety, this yields an approach for determining smooth connectivity in a real algebraic variety. The method is based upon gradient ascent/descent paths on the real algebraic variety inspired by a method proposed by Hong, Rohal, Safey El Din, and Schost for complements of real hypersurfaces. Several examples are included to demonstrate the approach.

Numerical AlgorithmsVol. 100(1)
University of Notre Dame (US), North Carolina State University (US), University of North Carolina at Greensboro (US)
National Science Foundation, Simons Foundation, Division of Computing and Communication Foundations
Openalex Percentile: Top 20%
Polynomial and algebraic computation
1.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Smooth connectivity in real algebraic varieties — Jonathan D. Hauenstein, Joseph Cummings, et al. · Numerical Algorithms (2024) | TGRS Research Map | TGRS