SearcharxivSearch

arXiv subjects

Lukas Mauth

Publications and source records attributed to Lukas Mauth.

8 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

Quasimodular forms that detect primes are Eisenstein

MacMahon's partition functions and their extensions provide equations that identify prime numbers as solutions. These results depend on the theory of (mixed weight) quasimodular forms on $SL_2(\mathbb{Z})$. Two of the authors, along with Craig, conjectured an explicit description of the set of prime-detecting quasimodular forms in terms of Eisenstein series and their derivatives. Kane et al.\ recently verified this conjecture using analytic methods. We offer an alternative proof using the theory of $\ell$-adic Galois representations associated to modular forms.

math.NT

On the asymptotics of certain colored partitions

We will prove an infinite family of asymptotic formulas for the logarithm of certain two-colored partitions. An infinite sub-family of these asymptotics was posed as a conjecture by Guadalupe.

math.NT

On the parity of coefficients of eta powers

We consider a special subsequence of the Fourier coefficients of powers of the Dedekind $\eta$-function, analogous to the sequence $\delta_\ell := 24^{-1} \pmod{\ell}$ on which exceptional congruences of the partition function are supported. Therefrom we define a notion of density $D(r)$ for a normalized eta-power $\eta^r$ measuring the proportion of primes $\ell$ for which the order at infinity of $U_\ell (\eta^r)$ modulo 2 is maximal. We relate $D(r)$ to a notion of density measuring nonzero prime Fourier coefficients introduced by Bella\"iche, and use this to completely classify the vanishing of and establish upper bounds for $D(r)$. Furthermore, for several infinite families of $\eta$ powers corresponding to dihedral/CM mod-2 modular forms in the sense of Nicholas-Serre and Bella\"iche, we explicitly compute the densities $D$. We rely on Galois-theoretic techniques developed by Bella\"iche in level 1 and extend these to level 9. En passant we take the opportunity to communicate proofs of two of Bella\"iche's unpublished results on densities of mod-$2$ modular forms.

math.NT

Exact formula for 1-lower run overpartitions

We are going to show an exact formula for lower $1$-run overpartitions. The generating function is of mixed mock-modular type with an overall weight $0.$ We will apply an extended version of the classical Circle Method. The approach requires bounding modified Kloosterman sums and Mordell integrals.

math.NT

Log-concavity for partitions without sequences

We prove log-concavity for the function counting partitions without sequences. We use an exact formula for a mixed-mock modular form of weight zero, explicit estimates on modified Kloosterman sums and analytic techniques. Finally, we establish the higher Tur\'an inequalities in an asymptotic form of the aforementioned partition function using a well established criterion of Griffin, Ono, Rolen, and Zagier on the zeros of Jensen polynomials.

math.NT

On Pointwise convergence of the non-linear Fourier transform

A. Poltotaski proved an analog of Carleson's Theorem on almost everywhere convergence of Fourier series for a version of the non-linear Fourier transform. We aim to present his proof in full detail and elaborate on the ideas behind each step.

math.CV