BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Christian Stump

Christian Stump appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
math.COmath.RTmath.GRComputation and LanguageDatabases

Catalog footprint

What is connected

20works
5topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

20 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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A combinatorial classification of 2-regular simple modules for Nakayama algebras

Enomoto showed for finite dimensional algebras that the classification of exact structures on the category of finitely generated projective modules can be reduced to the classification of 2-regular simple modules. In this article, we give a combinatorial classification of 2-regular simple modules for Nakayama algebras and we use this classification to answer several natural questions such as when there is a unique exact structure on the category of finitely generated projective modules for Nakayama algebras. We also classify 1-regular simple modules, quasi-hereditary Nakayama algebras and Nakayama algebras of global dimension at most two. It turns out that most classes are enumerated by well-known combinatorial sequences, such as Fibonacci, Riordan and Narayana numbers. We first obtain interpretations in terms of the Auslander-Reiten quiver of the algebra using homological algebra, and then apply suitable bijections to relate these to combinatorial statistics on Dyck paths.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A new face iterator for polyhedra and more general finite locally branched lattices

We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied to face lattices of polyhedra and to various generalizations such as finite polyhedral complexes and subdivisions of manifolds, extended tight spans and closed sets of matroids. Its practical implementation is very fast compared to state-of-the-art implementations of previously considered algorithms. Based on recent work of Bruns, García-Sánchez, O'Neill and Wilburne, we apply this algorithm to prove Wilf's conjecture for all numerical semigroups of multiplicity 19 by iterating through the faces of the Kunz cone and identifying the possible bad faces and then checking that these do not yield counterexamples to Wilf's conjecture.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Minkowski decompositions for generalized associahedra of acyclic type

We give an explicit subword complex description of the generators of the type cone of the g-vector fan of a finite type cluster algebra with acyclic initial seed. This yields in particular a description of the Newton polytopes of the F-polynomials in terms of subword complexes as conjectured by S. Brodsky and the third author. We then show that the cluster complex is combinatorially isomorphic to the totally positive part of the tropicalization of the cluster variety as conjectured by D. Speyer and L. Williams.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

The EKR property for flag pure simplicial complexes without boundary

We prove that the family of facets of a pure simplicial complex of dimension up to three satisfies the Erdős-Ko-Rado property whenever it is flag and has no boundary ridges. We conjecture the same to be true in arbitrary dimension and give evidence for this conjecture. Our motivation is that complexes with these two properties include flag pseudo-manifolds and cluster complexes.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Towards a uniform subword complex description of acyclic finite type cluster algebras

It has been established in recent years how to approach acyclic cluster algebras of finite type using subword complexes. In this paper, we continue this study by describing the c- and g-vectors, and by providing a conjectured description of the Newton polytopes of the F-polynomials. In particular, we show that this conjectured description would imply that finite type cluster complexes are realized by the duals of the Minkowski sums of the Newton polytopes of either the F-polynomials, or of the cluster variables, respectively.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

A note on the transitive Hurwitz action on decompositions of parabolic Coxeter elements

In this note, we provide a short and self-contained proof that the braid group on n strands acts transitively on the set of reduced factorizations of a Coxeter element in a Coxeter group of finite rank n into products of reflections. We moreover use the same argument to also show that all factorizations of an element in a parabolic subgroup of W lie as well in this parabolic subgroup.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Counting factorizations of Coxeter elements into products of reflections

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is expressed uniformly in terms of natural parameters of the group. In the case of factorizations of minimal length, we recover a formula due to P. Deligne, J. Tits and D. Zagier in the real case and to D. Bessis in the complex case. For the symmetric group, our formula specializes to a formula of D. M. Jackson.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

On a new collection of words in the Catalan family

In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this bijection is the zeta map which is an important map in the study of q,t-Catalan numbers. Finally we discuss an alternative approach to this new collection of words using two statistics on planted trees that turn out to be closely related to the Tutte polynomial on the Catalan matroid.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

On non-conjugate Coxeter elements in well-generated reflection groups

Given an irreducible well-generated complex reflection group W with Coxeter number h, we call a Coxeter element any regular element (in the sense of Springer) of order h in W; this is a slight extension of the most common notion of Coxeter element. We show that the class of these Coxeter elements forms a single orbit in W under the action of reflection automorphisms. For Coxeter and Shephard groups, this implies that an element c is a Coxeter element if and only if there exists a simple system S of reflections such that c is the product of the generators in S. We moreover deduce multiple further implications of this property. In particular, we obtain that all noncrossing partition lattices of W associated to different Coxeter elements are isomorphic. We also prove that there is a simply transitive action of the Galois group of the field of definition of W on the set of conjugacy classes of Coxeter elements. Finally, we extend several of these properties to Springer's regular elements of arbitrary order.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

More bijective Catalan combinatorics on permutations and on signed permutations

In this paper, we construct bijections between Dyck paths, noncrossing partitions, and 231-avoiding permutations, which send the area statistic on Dyck paths to the inversion number on noncrossing partitions and on 231-avoiding permutations. This bijection has the additional property that it simultaneously sends the major index on Dyck paths to the sum of the major index and the inverse major index on noncrossing partitions and on 231-avoiding permutations, respectively. Moreover, we provide generalizations of these constructions to the group of signed permutations.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Subword complexes, cluster complexes, and generalized multi-associahedra

In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called multi-cluster complex. For k=1, we show that this subword complex is isomorphic to the cluster complex of the given type. We show that multi-cluster complexes of types A and B coincide with known simplicial complexes, namely with the simplicial complexes of multi-triangulations and centrally symmetric multi-triangulations respectively. Furthermore, we show that the multi-cluster complex is universal in the sense that every spherical subword complex can be realized as a link of a face of the multi-cluster complex.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

On root posets for noncrystallographic root systems

We discuss properties of root posets for finite crystallographic root systems, and show that these properties uniquely determine root posets for the noncrystallographic dihedral types and type $H_3$, while proving that there does not exist a poset satisfying all of the properties in type $H_4$. We do this by exhaustive computer searches for posets having these properties. We further give a realization of the poset of type $H_3$ as restricted roots of type $D_6$, and conjecture a Hilbert polynomial for the $q,t$-Catalan numbers for type $H_4$.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

A compendium on the cluster algebra and quiver package in sage

This is the compendium of the cluster algebra and quiver package for sage. The purpose of this package is to provide a platform to work with cluster algebras in graduate courses and to further develop the theory by working on examples, by gathering data, and by exhibiting and testing conjectures. In this compendium, we include the relevant theory to introduce the reader to cluster algebras assuming no prior background; this exposition has been written to be accessible to an interested undergraduate. Throughout this compendium, we include examples that the user can run in the sage notebook or command line, and then close with a detailed description of the data structures and methods in this package.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

A uniform bijection between nonnesting and noncrossing partitions

In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing partitions, and hence construct the first uniform bijection between nonnesting and noncrossing partitions. Unfortunately, the proof that our construction is well-defined is case-by-case, using a computer in the exceptional types. Fortunately, the proof involves new and interesting combinatorics in the classical types. As consequences, we prove several conjectural properties of the Panyushev map, and we prove two cyclic sieving phenomena conjectured by D. Bessis and V. Reiner.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Counting the number of elements in the mutation classes of \tilde{A}_n-quivers

In this article we prove explicit formulae for the number of non-isomorphic cluster-tilted algebras of type \tilde{A}_n in the derived equivalence classes. In particular, we obtain the number of elements in the mutation classes of quivers of type \tilde{A}_n. As a by-product, this provides an alternative proof for the number of quivers of Dynkin type D_n which was first determined by Buan and Torkildsen.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Maximal fillings of moon polyominoes, simplicial complexes, and Schubert polynomials

We exhibit a canonical connection between maximal (0,1)-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity result for Schubert polynomials. For Ferrers shapes, we moreover construct a bijection to maximal fillings avoiding south-east chains of the same length which specializes to a bijection between k-triangulations of the n-gon and k-fans of Dyck paths of length 2(n-2k). Using this, we translate a conjectured cyclic sieving phenomenon for k-triangulations with rotation to the language of k-flagged tableaux with promotion.

0 citations0 reviewsNo code linkedOpen access