中文
相关论文

相关论文: Spin-preserving Knuth correspondences for ribbon t…

200 篇论文

Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth…

组合数学 · 数学 2007-05-23 Jason Fulman

We give the first two-dimensional pictorial presentation of Berele's correspondence \cite{Berele}, an analogue of the Robinson-Schensted (R-S) correspondence \cite{Robinson, Schensted} for the symplectic group $Sp(2n, \Cpx )$. From the…

组合数学 · 数学 2007-05-23 Tom Roby , Itaru Terada

By using an elementary matrix approach, based on the technique of discrete Toda equation, we construct subtraction-free rational and piecewise linear transformations associated with various combinatorial algorithms, including the RSK…

数学物理 · 物理学 2007-05-23 Masatoshi Noumi , Yasuhiko Yamada

Given an rc-graph $R$ of permutation $w$ and an rc-graph $Y$ of permutation $v$, we provide an insertion algorithm, which defines an rc-graph $R\leftarrow Y$ in the case when $v$ is a shuffle with the descent at $r$ and $w$ has no descents…

组合数学 · 数学 2007-05-23 Mikhail Kogan

Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…

Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so that the decomposition of the r tensor power of the representation of G on cosets on H behaves (after renormalization) like the regular…

表示论 · 数学 2007-05-23 Jason Fulman

Given a permutation $\sigma$, the Robinson-Schensted correspondence determines a certain partition called the shape of $\sigma$. Famously, the shape measures the longest unions of increasing and decreasing subsequences, thus giving global…

组合数学 · 数学 2026-05-12 William Q. Erickson

Schensted row insertion is a fundamental component of the Robinson-Schensted-Knuth (RSK) algorithm, a powerful tool in combinatorics and representation theory. This study examines the insertion of a deterministic number into a random…

组合数学 · 数学 2024-07-10 Mikołaj Marciniak , Piotr Śniady

The Berele row-insertion is a symplectic analogue of the Schensted row-insertion. In the present paper, we provide it with a representation theoretical interpretation via the quantum symmetric pairs of type $A\mathrm{II}$. As applications,…

表示论 · 数学 2025-09-16 Hideya Watanabe

Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. In the particular case of the crystal graph…

组合数学 · 数学 2017-06-29 Alan J. Cain , António Malheiro

In a paper by Ghorpade and Raghavan, they provide an explicit combinatorial description of the Hilbert function of the tangent cone at any point on a Schubert variety in the symplectic Grassmannian, by giving a certain "degree-preserving"…

组合数学 · 数学 2021-03-16 Shyamashree Upadhyay , Papi Ray

We consider two examples of a fully decodable combinatorial encoding of Bernoulli schemes: the encoding via Weyl simplices and the much more complicated encoding via the RSK (Robinson--Schensted--Knuth) correspondence. In the first case,…

组合数学 · 数学 2020-06-16 Anatoly Vershik

A Richardson variety $X_\ga^\gc$ in the Orthogonal Grassmannian is defined to be the intersection of a Schubert variety $X^\gc$ in the Orthogonal Grassmannian and a opposite Schubert variety $X_\ga$ therein. We give an explicit description…

组合数学 · 数学 2009-09-09 Shyamashree Upadhyay

In this paper, we show how various combinatorial algorithms of Young tableaux naturally arise from the WKB approximation of the connection matrix of quantum confluent hypergeometric equation, including the Robinson-Schensted algorithm, the…

表示论 · 数学 2025-03-21 Xiaomeng Xu

Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation \sigma\ as a pattern, the shape of w contains the…

组合数学 · 数学 2011-09-06 Andrew Crites , Greta Panova , Gregory S. Warrington

The coinvariant algebra $R_n$ is a well-studied $\mathfrak{S}_n$-module that is a graded version of the regular representation of $\mathfrak{S}_n$. Using a straightening algorithm on monomials and the Garsia-Stanton basis, Adin, Brenti, and…

组合数学 · 数学 2018-02-26 Kyle P. Meyer

Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…

组合数学 · 数学 2015-06-09 Eric Neyman

Relations among tautological classes on the moduli space of stable curves are obtained via the study of Witten's r-spin theory for higher r. In order to calculate the quantum product, a new formula relating the r-spin correlators in genus 0…

代数几何 · 数学 2020-04-21 R. Pandharipande , A. Pixton , D. Zvonkine

R. Sulzgruber's rim hook insertion and the Hillman-Grassl correspondence are two distinct bijections between the reverse plane partitions of a fixed partition shape and multisets of rim-hooks of the same partition shape. It is known that…

组合数学 · 数学 2017-09-01 Alexander Garver , Rebecca Patrias

We formalize some known categorical equivalences to give a rigorous treatment of smooth representations of p-adic general linear groups, as ungraded modules over quiver Hecke algebras of type A. Graded variants of RSK-standard modules are…

表示论 · 数学 2021-06-08 Maxim Gurevich