SearcharxivSearch

arXiv subjects

Duk-Soon Oh

Publications and source records attributed to Duk-Soon Oh.

5 recordsLinked to original sources

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.

cs.CL

New Analysis of Overlapping Schwarz Methods for Vector Field Problems in Three Dimensions with Generally Shaped Domains

This paper introduces a novel approach to analyzing overlapping Schwarz methods for Nédélec and Raviart--Thomas vector field problems. The theory is based on new regular stable decompositions for vector fields that are robust to the topology of the domain. Enhanced estimates for the condition numbers of the preconditioned linear systems are derived, dependent linearly on the relative overlap between the overlapping subdomains. Furthermore, we present the numerical experiments which support our theoretical results.

math.NA

Smoothers Based on Nonoverlapping Domain Decomposition Methods for $H(\mathbf{curl})$ Problems: A Numerical Study

This paper presents a numerical study on multigrid algorithms of $V$-cycle type for problems posed in the Hilbert space $H(\mathbf{curl})$ in three dimensions. The multigrid methods are designed for discrete problems originated from the discretization using the hexahedral Nédélec edge element of the lowest-order. Our suggested methods are associated with smoothers constructed by substructuring based on domain decomposition methods of nonoverlapping type. Numerical experiments to demonstrate the robustness and the effectiveness of the suggested algorithms are also provided.

math.NA

Multigrid methods for 3$D$ $H(\mathbf{curl})$ problems with nonoverlapping domain decomposition smoothers

We propose V--cycle multigrid methods for vector field problems arising from the lowest order hexahedral Nédélec finite element. Since the conventional scalar smoothing techniques do not work well for the problems, a new type of smoothing method is necessary. We introduce new smoothers based on substructuring with nonoverlapping domain decomposition methods. We provide the convergence analysis and numerical experiments that support our theory.

math.NA

Multigrid Methods for Saddle Point Problems: Darcy Systems

We design and analyze multigrid methods for the saddle point problems resulting from Raviart-Thomas-N\'ed\'elec mixed finite element methods (of order at least 1) for the Darcy system in porous media flow. Uniform convergence of the $W$-cycle algorithm in a nonstandard energy norm is established. Extensions to general second order elliptic problems are also addressed.

math.NA