SearcharxivSearch

arXiv subjects

Mathieu Rundström

Publications and source records attributed to Mathieu Rundström.

3 recordsLinked to original sources

QEDBENCH: Quantifying the Alignment Gap in Automated Evaluation of University-Level Mathematical Proofs

As Large Language Models (LLMs) saturate elementary benchmarks, the research frontier has shifted from generation to the reliability of automated evaluation. We demonstrate that standard "LLM-as-a-Judge" protocols suffer from a systematic Alignment Gap when applied to upper-undergraduate to early graduate level mathematics. To quantify this, we introduce QEDBench, the first large-scale dual-rubric alignment benchmark to systematically measure alignment with human experts on university-level math proofs by contrasting course-specific rubrics against expert common knowledge criteria. By deploying a dual-evaluation matrix (7 judges x 5 solvers) against 1,000+ hours of human evaluation, we reveal that certain frontier evaluators like Claude Opus 4.5, DeepSeek-V3, Qwen 2.5 Max, and Llama 4 Maverick exhibit significant positive bias (up to +0.18, +0.20, +0.30, +0.36 mean score inflation, respectively). Furthermore, we uncover a critical reasoning gap in the discrete domain: while Gemini 3.0 Pro achieves state-of-the-art performance (0.91 average human evaluation score), other reasoning models like GPT-5 Pro and Claude Sonnet 4.5 see their performance significantly degrade in discrete domains. Specifically, their average human evaluation scores drop to 0.72 and 0.63 in Discrete Math, and to 0.74 and 0.50 in Graph Theory. In addition to these research results, we also release QEDBench as a public benchmark for evaluating and improving AI judges. Our benchmark is publicly published at https://github.com/qqliu/Yale-QEDBench.

cs.LG

The structure of $\Delta(1, 2, 2)$-free tournaments

We extend the list of tournaments $S$ for which the complete structural description for tournaments excluding $S$ as a subtournament is known. Specifically, let $\Delta(1, 2, 2)$ be a tournament on five vertices obtained from a cyclic triangle by substituting a two-vertex tournament for two of its vertices. In this paper, we show that tournaments excluding $\Delta(1, 2, 2)$ as a subtournament are either isomorphic to one of three small tournaments, obtained from a transitive tournament by reversing edges in vertex-disjoint directed paths, or obtained from a smaller tournament with the same property by applying one of two operations. In particular, one of these operations creates a homogeneous set that induces a subtournament isomorphic to one of three fixed tournaments, and the other creates a homogeneous pair such that their union induces a subtournament isomorphic to a fixed tournament. As an application of this result, we present an upper bound for the chromatic number, a lower bound for the size of a largest transitive subtournament, and a lower bound for the number of vertex-disjoint cyclic triangles for such tournaments. The bounds that we present are all best possible.

math.CO

An improved upper bound for the multicolour Ramsey number of odd cycles

We show that the $k$-colour Ramsey number of an odd cycle of length $2 \ell + 1$ is at most $(4 \ell)^k \cdot k^{k/\ell}$. This proves a conjecture of Fox and is the first improvement in the exponent that goes beyond an absolute constant factor since the work of Bondy and Erd\H{o}s from 1973.

math.CO