arXiv subjects
Publications and source records attributed to Hannah Friedman.
We study the positive Grassmannian through the lens of algebraic statistics. A closed formula is presented for the maximum likelihood degree of the Grassmannian of lines. We study the real and positive critical points for the Grassmannian of lines in 3-space.
Between April 1 and May 15, 2026, a group of 49 mathematicians compiled a dataset of research-level mathematics questions with known answers. Most of the work was done during the 3-day workshop *Benchmarks in Leipzig* with 35 participants at the Max Planck Institute for Mathematics in the Sciences in Leipzig, Germany. We present the resulting collection of 100 questions. We evaluated these questions in three stages: a single attempt by five state-of-the-art LLMs, followed by a 20-runs-per-model evaluation with three of these models, and finally a 3-run attempt with two heavy-thinking models. After Stage 1, 41 questions remained completely unsolved; after Stage 2, this count dropped to 16; and we concluded Stage 3 with only 2 unsolved questions. This demonstrates that the mathematical reasoning capabilities of LLMs are becoming impressive.
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\"ucker 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.
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. We first study the Rayleigh-Ritz degree and introduce the Rayleigh-Ritz discriminant, which describes Hamiltonians that lead to a deficient number of critical points. We then specialize this framework to tensor train varieties: we identify instances when they are Segre products of projective spaces, report what we know about their defining ideals, and present a birational parametrization from products of Grassmannians. 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.
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\"ohm--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.
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.
We study statistical models that are parametrized by squares of linear forms. All critical points of the likelihood function are real and positive. There is one critical point in each region of the projective hyperplane arrangement defined by the linear forms. We examine the ideal and singular locus of the model, and we give a determinantal presentation for its likelihood correspondence. We characterize tropical degenerations of the MLE, we describe the log-normal polytopes, and we explore connections to determinantal point processes.
Grassmann and flag varieties lead many lives in pure and applied mathematics. Here we focus on the algebraic complexity of solving various problems in linear algebra and statistics as optimization problems over these varieties. The measure of the algebraic complexity is the amount of complex critical points of the corresponding optimization problem. After an exposition of different realizations of these manifolds as algebraic varieties we present a sample of optimization problems over them and we compute their algebraic complexity.
We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models, we show that this is a decomposition into radical ideals by displaying Gr\"obner bases for the components. We identify conditions under which the components are prime, and establish formulas for the dimensions of these prime ideals. Moreover, we show that the components in the decomposition can be grouped into equivalence classes defined by their combinatorial structure, and we derive a closed formula for the number of such classes.
We study projection determinantal point processes and their connection to the squared Grassmannian. We prove that the log-likelihood function of this statistical model has $(n - 1)!/2$ critical points, all of which are real and positive, thereby settling a conjecture of Devriendt, Friedman, Reinke, and Sturmfels.
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.
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.
Near infrared (NIR, 700 - 1,000 nm) and short-wave infrared (SWIR, 1,000 - 2,000 nm) dye molecules exhibit significant nonradiative decay rates from the first singlet excited state to the ground state. While these trends can be empirically explained by a simple energy gap law, detailed mechanisms of the nearly universal behavior have remained unsettled for many cases. Theoretical and experimental results for two representative NIR/SWIR dye molecules reported here clarify the key mechanism for the observed energy gap law behavior. It is shown that the first derivative nonadiabatic coupling terms serve as major coupling pathways for nonadiabatic decay processes from the first excited singlet state to the ground state for these NIR and SWIR dye molecules and that vibrational modes other than the highest frequency ones also make significant contributions to the rate. This assessment is corroborated by further theoretical comparison with possible alternative mechanisms of intersystem crossing to triplet states and also by comparison with experimental data for deuterated molecules.
In this paper, we propose a new method for determining shared features of and measuring the distance between data sets or point clouds. Our approach uses the joint factorization of two data matrices $X_1,X_2$ into non-negative matrices $X_1 = AS_1, X_2 = AS_2$ to derive a similarity measure that determines how well the shared basis $A$ approximates $X_1, X_2$. We also propose a point cloud distance measure built upon this method and the learned factorization. Our method reveals structural differences in both image and text data. Potential applications include classification, detecting plagiarism or other manipulation, data denoising, and transfer learning.