arXiv subjects

Leonie Kayser

Publications and source records attributed to Leonie Kayser.

6 recordsLinked to original sources

arXiv2026

Mukai lifting of self-dual points in $\mathbb{P}^6$

A set of $2n$ points in $\mathbb{P}^{n-1}$ is self-dual if it is invariant under the Gale transform. Motivated by Mukai's work on canonical curves, Petrakiev showed that a general self-dual set of $14$ points in $\mathbb{P}^6$ arises as the intersection of the Grassmannian ${\rm Gr}(2,6)$ in its Plücker embedding in $\mathbb{P}^{14}$ with a linear space of dimension $6$. In this paper we focus on the inverse problem of recovering such a linear space associated to a general self-dual set of points. We use numerical homotopy continuation to approach the problem and implement an algorithm in Julia to solve it. Along the way we also implement the forward problem of slicing Grassmannians and use it to experimentally study the real solutions to this problem.

math.AG↗

arXiv2026

Polar Degrees of Matroids

We show that the polar degrees of the coordinate-wise inverse of a linear subspace $L \subseteq \mathbb{P}^n$ are given by the coefficients of a substitution of the reduced characteristic polynomial of the associated matroid $\mathrm{M}(L)$. Our proof connects the geometry of conormal varieties of reciprocal linear spaces to the combinatorial conormal fan of $\mathrm{M}(L)$. As a corollary, we settle two open conjectures regarding matroid discriminants.

math.CO↗

arXiv2026

Benchmarks in Leipzig

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.

math.HO↗

arXiv2025

Computational Complexity of Polynomial Subalgebras

The computational complexity of polynomial ideals and Gröbner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational algebra, with a view towards effective algorithms. We investigate the computational complexity of the subalgebra membership problem and degree bounds. In particular, we show completeness for the complexity class EXPSPACE and prove PSPACE-completeness for homogeneous algebras. We highlight parallels and differences compared to the settings of ideals, and also look at important classes of polynomials such as monomial algebras.

cs.CC↗

arXiv2025

Logarithmic Discriminants of Hyperplane Arrangements

A recurring task in particle physics and statistics is to compute the complex critical points of a product of powers of affine-linear functions. The logarithmic discriminant characterizes exponents for which such a function has a degenerate critical point in the corresponding hyperplane arrangement complement. We study properties of this discriminant, exploiting its connection with the Hurwitz form of a reciprocal linear space.

math.AG↗

arXiv2024

Hilbert Functions of Chopped Ideals

A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The complexity of computing these points from the chopped ideal is governed by the Hilbert function and regularity. We conjecture values for these invariants and prove them in many cases. We show that our conjecture is of practical relevance for symmetric tensor decomposition.

math.AC↗