Search arXiv⌕ Search

arXiv · 2610.08171

A duality-preserving extension of the Worley-Sagan insertion and Haiman's mixed insertion for the hyperoctahedral group

Abstract

The Worley-Sagan insertion and Haiman's mixed insertion are insertion algorithms for shifted Young tableaux, and each of them gives a Robinson-Schensted-type correspondence between the symmetric group of degree $n$ and a set consisting of certain pairs of same-shape shifted Young tableaux with $n$ cells. It is a known fact that these two insertions are dual to each other. Our purpose is to give an extension of these two insertions without losing the duality relationship. The extended ones will be insertions producing pairs of shifted tableaux from colored permutations. Our extension of the Worley-Sagan insertion is different from the restriction of Sagan's own "Knuth version" to colored permutations. In proving the duality between our extended insertions, we "embed" them into Shimozono and White's doubly mixed insertion for unshifted tableaux by "doubling" shifted tableaux and use the self-duality of the doubly mixed insertion shown by Shimozono and White.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Masato Nakagiri. 2026-10-06. A duality-preserving extension of the Worley-Sagan insertion and Haiman's mixed insertion for the hyperoctahedral group. https://arxiv.org/abs/2610.08171

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Twin-star hypothesis and cycle-free $d$-partitions of $K_{2d}$

In this paper we study an equivalence relation defined on the set of cycle-free $d$-partitions of the complete graph $K_{2d}$. We discuss a conjecture which states that this equivalence relation has only one equivalence class, and show that the conjecture is equivalent with the so called twin-star hypothesis. We check the conjecture in the case $d=4$ and disuses how this relates to the determinant-like map $det^{S^2}$.

math.CO↗

Oriented trees in digraphs without short non-directed cycles

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree with $k$ edges whose maximum degree does not exceed the minimum degree of $G$. In this paper, we extend Jiang's result to digraphs by proving that every digraph $D$ with no non-directed cycle of length between $3$ and $2\ell$ and minimum semidegree at least $k/\ell$ contains every oriented tree with $k$ edges whose maximum degree does not exceed the minimum semidegree of $D$. This answers a question raised by Stein and Trujillo-Negrete in the affirmative.

math.CO↗

The 3-state Potts model on planar triangulations: explicit algebraic solution

We consider the $3$-state Potts generating function $T(ν,w)$ of planar triangulations; that is, the bivariate series that counts planar triangulations with vertices coloured in $3$ colours, weighted by their size (number of vertices, recorded by the variable $w$) and by the number of monochromatic edges (variable $ν$). This series was proved to be algebraic 15 years ago by Bernardi and the first author: this follows from its link with the solution of a discrete differential equation (DDE), and from general algebraicity results on such equations. However, despite recent progresses on the effective solution of DDEs, the exact value of $T(ν,w)$ has remained unknown so far -- except in the case $ν=0$, corresponding to proper colourings and solved by Tutte in the sixties. We determine here this exact value, proving that $T(ν,w)$ satisfies a polynomial equation of degree $11$ in $T$ and genus $1$ in $w$ and $T$. We prove that the critical value of $ν$ is $ν_c=1+3/\sqrt{47}$, with a critical exponent $6/5$ in the series $T(ν_c, \cdot)$, while the other values of $ν$ yield the usual map exponent $3/2$. By duality of the planar Potts model, our results also characterize the 3-state Potts generating function of planar cubic maps, in which all vertices have degree $3$. In particular, the annihilating polynomial, still of degree $11$, that we obtain for properly 3-coloured cubic maps proves a conjecture by Bruno Salvy from 2009.

math.CO↗