$k$-Ribbon Fibonacci Tableaux

On the Young-Fibonacci insertion algorithm

This work is concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of Okada's algebra associated to the Young-Fibonacci lattice. The original algorithm was introduced by Roby and we redefine it in such a way that both the insertion and recording tableaux of any permutation are \emph{conveniently} interpreted as chains in the Young-Fibonacci lattice. A property of Killpatrick's evacuation is given a simpler proof, but this evacuat…

河带表aux与对称群特征标

River ribbon tableaux and symmetric group characters

该研究引入河带表aux，证明对称群的统一特征标界，进而证明Moore与Russell的猜想，并应用证明了Dousse和Féray关于斜形状标准表aux数量的猜想。

Ribbon Tableaux and the Heisenberg Algebra

Lascoux, Leclerc and Thibon have introduced symmetric functions which are spin and weight generating functions for ribbon tableaux. This article is aimed at studying these `ribbon functions' in analogy with Schur functions. In particular we will describe ribbon Pieri and Murnagham-Nakayama formulae, a ribbon Cauchy identity and an algebra involution which `conjugates' the ribbon functions. We will study these functions in the context of the action of the Heisenberg algebra on the Fock space representation of the quantum affine algebra U_q(sl_n)^, discovered by Kashiwara, Miwa and Stern. We wil…

Cuspidal ribbon tableaux in affine type A

For any convex preorder on the set of positive roots of affine type A, we classify and construct all associated cuspidal and semicuspidal skew shapes. These combinatorial objects correspond to cuspidal and semicuspidal skew Specht modules for the Khovanov-Lauda-Rouquier algebra of affine type A. Cuspidal skew shapes are ribbons, and we show that every skew shape has a unique ordered tiling by cuspidal ribbons. This tiling data provides an upper bound, in the bilexicographic order on Kostant partitions, for labels of simple factors of Specht modules.

Wronskians, cyclic group actions, and ribbon tableaux

The Wronski map is a finite, PGL_2(C)-equivariant morphism from the Grassmannian Gr(d,n) to a projective space (the projectivization of a vector space of polynomials). We consider the following problem. If C_r < PGL_2(C) is a cyclic subgroup of order r, how may C_r-fixed points are in the in a fibre of the Wronski map over a C_r-fixed point in the base? In this paper, we compute a general answer in terms of r-ribbon tableaux. When r=2, this computation gives the number of real points in the fibre of the Wronski map over a real polynomial with purely imaginary roots. More generally, we can comp…

Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson--Schensted--Knuth-type correspondence for quasi-ribbon tableaux

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 for the $q$-analogue of the special linear Lie algebra $\mathfrak{sl}_{n}$, this monoid is the celebrated plactic monoid, whose elements can be identified with Young tableaux. The crystal graph and the so-called Kashiwara operators interact beautifully with the combinatorics of Young tableaux and with the Robinson--Schensted--Knuth correspondence and so prov…

Bijective proofs of character evaluations using trace forest of the jeu de taquin

Irreducible characters in the symmetric group are of special interest in combinatorics. They can be expressed either combinatorially with ribbon tableaux, or algebraically with contents. In this paper, these two expressions are related in a combinatorial way. We first introduce a fine structure in the famous jeu de taquin called "trace forest", with which we are able to count certain types of ribbon tableaux, leading to a simple bijective proof of a character evaluation formula in terms of contents that dates back to Frobenius (1901). Inspired by this proof, we give an inductive scheme that gi…

关于表格的组合学——Schensted对应关系下底座的分类

On the combinatorics of tableaux -- Classification of lattices underlying Schensted correspondences

本文研究了Schensted对应关系下底座的分类，发现了一类新的Fomin格，但这些格无法用于构造Robinson-Schensted算法。