Researcher profile

Mario Kummer

Mario Kummer contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
6works
0followers
3topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

6 published item(s)

preprint2026arXiv

Soohak: A Mathematician-Curated Benchmark for Evaluating Research-level Math Capabilities of LLMs

Following the recent achievement of gold-medal performance on the IMO by frontier LLMs, the community is searching for the next meaningful and challenging target for measuring LLM reasoning. Whereas olympiad-style problems measure step-by-step reasoning alone, research-level problems use such reasoning to advance the frontier of mathematical knowledge itself, emerging as a compelling alternative. Yet research-level math benchmarks remain scarce because such problems are difficult to source (e.g., Riemann Bench and FrontierMath-Tier 4 contain 25 and 50 problems, respectively). To support reliable evaluation of next-generation frontier models, we introduce Soohak, a 439-problem benchmark newly authored from scratch by 64 mathematicians. Soohak comprises two subsets. On the Challenge subset, frontier models including Gemini-3-Pro, GPT-5, and Claude-Opus-4.5 reach 30.4%, 26.4%, and 10.4% respectively, leaving substantial headroom, while leading open-weight models such as Qwen3-235B, GPT-OSS-120B, and Kimi-2.5 remain below 15%. Notably, beyond standard problem solving, Soohak introduces a refusal subset that probes a capability intrinsic to research mathematics: recognizing ill-posed problems and pausing rather than producing confident but unjustified answers. On this subset, no model exceeds 50%, identifying refusal as a new optimization target that current models do not directly address. To prevent contamination, the dataset will be publicly released in late 2026, with model evaluations available upon request in the interim.

preprint2021arXiv

A generalization of the space of complete quadrics

To any homogeneous polynomial $h$ we naturally associate a variety $Ω_h$ which maps birationally onto the graph $Γ_h$ of the gradient map $\nabla h$ and which agrees with the space of complete quadrics when $h$ is the determinant of the generic symmetric matrix. We give a sufficient criterion for $Ω_h$ being smooth which applies for example when $h$ is an elementary symmetric polynomial. In this case $Ω_h$ is a smooth toric variety associated to a certain generalized permutohedron. We also give examples when $Ω_h$ is not smooth.

preprint2019arXiv

The separating semigroup of a real curve

We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We also introduce the hyperbolic semigroup which consists of elements of the separating semigroup arising from morphisms which are compositions of a linear projection with an embedding of the curve to some projective space. We completely determine both semigroups in the case of maximal curves. We also prove that any embedding of a real curve to projective space of sufficiently high degree is hyperbolic. Using these semigroups we show that the hyperbolicity locus of an embedded curve is in general not connected.

preprint2018arXiv

Generalized eigenvalue methods for Gaussian quadrature rules

A quadrature rule of a measure $μ$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $μ$ for all polynomials up to some fixed degree. In this paper, we present a bivariate polynomial whose roots parametrize the nodes of minimal quadrature rules for measures on the real line. We give two symmetric determinantal formulas for this polynomial, which translate the problem of finding the nodes to solving a generalized eigenvalue problem.