The symplectic Schur process

We define a measure on tuples of partitions, called the symplectic Schur process, that should be regarded as the right analogue of the Schur process of Okounkov-Reshetikhin for the Cartan type C. The weights of our measure include factors that are universal symplectic characters, as well as a novel family of "Down-Up Schur functions" that we define and for which we prove new identities of Cauchy-Littlewood-type. Our main structural result is that the point process corresponding to the symplectic Schur process is determinantal and we find an explicit correlation kernel. We also present dynamics that preserve the family of symplectic Schur processes and explore an alternative sampling scheme, based on the Berele insertion algorithm, in a special case. Finally, we study the asymptotics of the Berele insertion process and find explicit formulas for the limit shape and fluctuations near the bulk and the edge. One of the limit regimes leads to a new kernel that resembles the symmetric Pearcey kernel.

Authors

Publication Details

Journal
Advances in Mathematics
Published
2026-07-28
DOI
https://doi.org/10.1016/j.aim.2026.111161
Primary Topic
Random Matrices and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The symplectic Schur process

Cesar Cuenca, Matteo Mucciconi
Advances in Mathematics
Random Matrices and Applications
article

The symplectic Schur process

Cesar Cuenca, Matteo Mucciconi
article en

Abstract

We define a measure on tuples of partitions, called the symplectic Schur process, that should be regarded as the right analogue of the Schur process of Okounkov-Reshetikhin for the Cartan type C. The weights of our measure include factors that are universal symplectic characters, as well as a novel family of "Down-Up Schur functions" that we define and for which we prove new identities of Cauchy-Littlewood-type. Our main structural result is that the point process corresponding to the symplectic Schur process is determinantal and we find an explicit correlation kernel. We also present dynamics that preserve the family of symplectic Schur processes and explore an alternative sampling scheme, based on the Berele insertion algorithm, in a special case. Finally, we study the asymptotics of the Berele insertion process and find explicit formulas for the limit shape and fluctuations near the bulk and the edge. One of the limit regimes leads to a new kernel that resembles the symmetric Pearcey kernel.

Advances in MathematicsVol. 502
University of Warwick, European Commission, Directorate-General for Research and Innovation, HORIZON EUROPE Marie Sklodowska-Curie Actions
Openalex Percentile: Top 99%
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The symplectic Schur process — Cesar Cuenca, Matteo Mucciconi · Advances in Mathematics (2026) | TGRS Research Map | TGRS