Hannah Friedman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hannah Friedman has a total of 11 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 - Andrea Rosana1 shared publication
- Bernhard Reinke
MPI Leipzig, Leipzig, Germany
1 shared publication - Karel Devriendt
University of Oxford, Oxford, UK
1 shared publication - Maksym Zubkov1 shared publication
- Max Pfeffer
Institute of Numerical and Applied Mathematics, University of Göttingen, Göttingen, Germany
1 shared publication
Latest Publications
- Open Access
Distance Optimization in the Grassmannian of Lines
The square of a skew-symmetric matrix is a symmetric matrix whose eigenvalues have even multiplicities. When the matrices have rank two, they represent the Grassmannian of lines, and the squaring operation takes Plücker coordinates to projection coordinates. We develop metric algebraic geometry for varieties of lines in this linear algebra setting. The Grassmann distance (GD) degree is introduced as a new invariant for subvarieties of a Grassmannian. We study the GD degree for Schubert varieties and other models.
Open AccessDistance Optimization in the Grassmannian of Lines
The square of a skew-symmetric matrix is a symmetric matrix whose eigenvalues have even multiplicities. When the matrices have rank two, they represent the Grassmannian of lines, and the squaring operation takes Plücker coordinates to projection coordinates. We develop metric algebraic geometry for varieties of lines in this linear algebra setting. The Grassmann distance (GD) degree is introduced as a new invariant for subvarieties of a Grassmannian. We study the GD degree for Schubert varieties and other models.
- Open Access
Numerical Algebraic Geometry for Energy Computations on Tensor Train Varieties
We study energy minimization problems in quantum chemistry through the lens of computational algebraic geometry. We focus on minimizing the Rayleigh quotient of a Hamiltonian over a tensor train variety. The complex critical points of this problem approximate eigenstates of the quantum system, with the global minimum approximating the ground state. We call the number of critical points the Rayleigh-Ritz degree. After introducing tensor train varieties, we identify instances when they are Segre products of projective spaces. We also report what we know about the defining ideals of tensor trains. We present a birational parametrization of them from products of Grassmannians. Along the way, we study the Rayleigh-Ritz degree, and we introduce the Rayleigh-Ritz discriminant, which describes Hamiltonians that lead to deficient number of critical points. We use homotopy continuation to compute all critical points of this optimization problem over various tensor train and determinantal varieties. Finally, we use these results to benchmark state-of-the-art methods, the Alternating Linear Scheme and Density Matrix Renormalization Group.
Open AccessNumerical Algebraic Geometry for Energy Computations on Tensor Train Varieties
We study energy minimization problems in quantum chemistry through the lens of computational algebraic geometry. We focus on minimizing the Rayleigh quotient of a Hamiltonian over a tensor train variety. The complex critical points of this problem approximate eigenstates of the quantum system, with the global minimum approximating the ground state. We call the number of critical points the Rayleigh-Ritz degree. After introducing tensor train varieties, we identify instances when they are Segre products of projective spaces. We also report what we know about the defining ideals of tensor trains. We present a birational parametrization of them from products of Grassmannians. Along the way, we study the Rayleigh-Ritz degree, and we introduce the Rayleigh-Ritz discriminant, which describes Hamiltonians that lead to deficient number of critical points. We use homotopy continuation to compute all critical points of this optimization problem over various tensor train and determinantal varieties. Finally, we use these results to benchmark state-of-the-art methods, the Alternating Linear Scheme and Density Matrix Renormalization Group.
- Open Access
Counting Homogeneous Einstein Metrics
We present an explicit upper bound on the number of isolated homogeneous Einstein metrics on compact homogeneous spaces whose isotropy representations consist of pairwise inequivalent irreducibles. This is the BKK bound of the corresponding system of Laurent polynomials and is found combinatorially by computing the volume of a polytope. Inspired by a connection with algebraic statistics, we describe this system's BKK discriminant in terms of the principal $A$-determinant of scalar curvature. As a consequence, we confirm the Finiteness Conjecture of Böhm--Wang--Ziller in special cases. In particular, we give a unified proof that it holds on all generalized Wallach spaces. Finally, using numerical algebraic geometry, we compute $G$-invariant Einstein metrics on low-dimensional full flag manifolds $G/T$, where $G$ is a compact simple Lie group and $T$ is a maximal torus.Open AccessCounting Homogeneous Einstein Metrics
We present an explicit upper bound on the number of isolated homogeneous Einstein metrics on compact homogeneous spaces whose isotropy representations consist of pairwise inequivalent irreducibles. This is the BKK bound of the corresponding system of Laurent polynomials and is found combinatorially by computing the volume of a polytope. Inspired by a connection with algebraic statistics, we describe this system's BKK discriminant in terms of the principal $A$-determinant of scalar curvature. As a consequence, we confirm the Finiteness Conjecture of Böhm--Wang--Ziller in special cases. In particular, we give a unified proof that it holds on all generalized Wallach spaces. Finally, using numerical algebraic geometry, we compute $G$-invariant Einstein metrics on low-dimensional full flag manifolds $G/T$, where $G$ is a compact simple Lie group and $T$ is a maximal torus. - Open Access
Homotopy Iterators
We introduce the concept of homotopy iterators for performing polynomial homotopy continuation tasks in a memory efficient manner. The main idea is to push forward an iterator for the start solutions of a homotopy via the function which tracks them along the homotopy. Doing so produces a representation of the target solutions, bypassing the need to hold all solutions in memory. We discuss several applications of this datatype ranging from solution counting to data compression.
Open AccessHomotopy Iterators
We introduce the concept of homotopy iterators for performing polynomial homotopy continuation tasks in a memory efficient manner. The main idea is to push forward an iterator for the start solutions of a homotopy via the function which tracks them along the homotopy. Doing so produces a representation of the target solutions, bypassing the need to hold all solutions in memory. We discuss several applications of this datatype ranging from solution counting to data compression.
- Open Access
- 3 July 2025
- Published by Springer Nature in Acta Universitatis Sapientiae, Mathematica
- Vol. 17 (1) , 1-18
The two lives of the Grassmannian
The real Grassmannian is both a projective variety (via Plücker coordinates) and an affine variety (via orthogonal projections). We connect these two representations, and we develop the commutative algebra of the latter variety. We introduce the squared Grassmannian, and we study applications to determinantal point processes in statistics.
- 3 July 2025
- Published by Springer Nature in Acta Universitatis Sapientiae, Mathematica
- Vol. 17 (1) , 1-18
Open AccessThe two lives of the Grassmannian
The real Grassmannian is both a projective variety (via Plücker coordinates) and an affine variety (via orthogonal projections). We connect these two representations, and we develop the commutative algebra of the latter variety. We introduce the squared Grassmannian, and we study applications to determinantal point processes in statistics.
- Open Access
Likelihood Geometry of Determinantal Point Processes
We study determinantal point processes (DPP) through the lens of algebraic statistics. We count the critical points of the log-likelihood function, and we compute them for small models, thereby disproving a conjecture of Brunel, Moitra, Rigollet and Urschel.
Open AccessLikelihood Geometry of Determinantal Point Processes
We study determinantal point processes (DPP) through the lens of algebraic statistics. We count the critical points of the log-likelihood function, and we compute them for small models, thereby disproving a conjecture of Brunel, Moitra, Rigollet and Urschel.