Madeleine Weinstein
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Madeleine Weinstein has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Bernd Sturmfels
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
3 shared publications - Paul Breiding
University of Osnabrück, Osnabrück, Germany
2 shared publications - Sara Kališnik
Wesleyan University
2 shared publications - David Eklund
RISE Research Institutes of Sweden, Kista, Sweden
1 shared publication - Diego Cifuentes
Massachusetts Institute of Technology 02139 Cambridge MA USA
1 shared publication - Emil Horobet1 shared publication
Latest Publications
- Open Access
The bottleneck degree of algebraic varieties
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a fundamental complexity measure in the algebraic geometry of data. In this paper we study the number of bottlenecks of affine and projective varieties, which we call the bottleneck degree. The bottleneck degree is a measure of the complexity of computing all bottlenecks of an algebraic variety, using for example numerical homotopy methods. We show that the bottleneck degree is a function of classical invariants such as Chern classes and polar classes. We give the formula explicitly in low dimension and provide an algorithm to compute it in the general case.Open AccessThe bottleneck degree of algebraic varieties
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a fundamental complexity measure in the algebraic geometry of data. In this paper we study the number of bottlenecks of affine and projective varieties, which we call the bottleneck degree. The bottleneck degree is a measure of the complexity of computing all bottlenecks of an algebraic variety, using for example numerical homotopy methods. We show that the bottleneck degree is a function of classical invariants such as Chern classes and polar classes. We give the formula explicitly in low dimension and provide an algorithm to compute it in the general case. - Open Access
Offset Hypersurfaces and Persistent Homology of Algebraic Varieties
In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and algebraic optimization. Namely, we express the degree corresponding to the distance variable of the offset hypersurface in terms of the Euclidean Distance Degree of the starting variety, obtaining a new way to compute these degrees. Finally, we describe the non-properness locus of the offset construction and use this to describe the set of points that are topologically interesting (the medial axis and center points of the bounded components of the complement of the variety) and relevant to the computation of persistent homology.
Open AccessOffset Hypersurfaces and Persistent Homology of Algebraic Varieties
In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and algebraic optimization. Namely, we express the degree corresponding to the distance variable of the offset hypersurface in terms of the Euclidean Distance Degree of the starting variety, obtaining a new way to compute these degrees. Finally, we describe the non-properness locus of the offset construction and use this to describe the set of points that are topologically interesting (the medial axis and center points of the bounded components of the complement of the variety) and relevant to the computation of persistent homology.
- Open Access
Voronoi Cells of Varieties
Every real algebraic variety determines a Voronoi decomposition of its ambient Euclidean space. Each Voronoi cell is a convex semialgebraic set in the normal space of the variety at a point. We compute the algebraic boundaries of these Voronoi cells.
Open AccessVoronoi Cells of Varieties
Every real algebraic variety determines a Voronoi decomposition of its ambient Euclidean space. Each Voronoi cell is a convex semialgebraic set in the normal space of the variety at a point. We compute the algebraic boundaries of these Voronoi cells.
- Open Access
Learning Algebraic Varieties from Samples
We seek to determine a real algebraic variety from a fixed finite subset of points. Existing methods are studied and new methods are developed. Our focus lies on aspects of topology and algebraic geometry, such as dimension and defining polynomials. All algorithms are tested on a range of datasets and made available in a Julia package.
Open AccessLearning Algebraic Varieties from Samples
We seek to determine a real algebraic variety from a fixed finite subset of points. Existing methods are studied and new methods are developed. Our focus lies on aspects of topology and algebraic geometry, such as dimension and defining polynomials. All algorithms are tested on a range of datasets and made available in a Julia package.
- Open Access
- 13 August 2018
- Published by Springer Nature in Revista Matemática Complutense
- Vol. 31 (3) , 545-593
Learning algebraic varieties from samples
- 13 August 2018
- Published by Springer Nature in Revista Matemática Complutense
- Vol. 31 (3) , 545-593
Open AccessLearning algebraic varieties from samples