Related papers: On the Young-Fibonacci insertion algorithm
We extend the notion of $k$-ribbon tableaux to the Fibonacci lattice, a differential poset defined by R. Stanley in 1975. Using this notion, we describe an insertion algorithm that takes $k$-colored permutations to pairs of $k$-ribbon…
In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…
The celebrated Robinson-Schensted algorithm and each of its variants that have attracted substantial attention can be constructed using Fomin's "growth diagram" construction from a modular lattice that is also a weighted-differential poset.…
The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin…
It is well known that the Young lattice is the Bratelli diagram of the symmetric groups expressing how irreducible representations restrict from $S_N$ to $S_{N-1}$. In 1988, Stanley discovered a similar lattice called the Young-Fibonacci…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…
The $k$-Young lattice $Y^k$ is a partial order on partitions with no part larger than $k$. This weak subposet of the Young lattice originated from the study of the $k$-Schur functions(atoms) $s_\lambda^{(k)}$, symmetric functions that form…
We study the subgraph of the Young-Fibonacci graph induced by elements with odd $f$-statistic (the $f$-statistic of an element $w$ of a differential graded poset is the number of saturated chains from the minimal element of the poset to…
We introduce the notion of "type" of a tableau, that allows us to define new families of tableaux including both balanced and standard Young tableaux. We use these new objects to describe the set of reduced decompositions of any…
The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…
This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…
We give a new (inductive) proof of the classical Frobenius--Young correspondence between irreducible complex representations of the symmetric group and Young diagrams, using the new approach, suggested in \cite{OV, VO}, to determining this…
The character theory of symmetric groups, and the theory of symmetric functions, both make use of the combinatorics of Young tableaux, such as the Robinson-Schensted algorithm, Schuetzenberger's "jeu de taquin", and evacuation. In 1995…
The study of representations of affine Hecke algebras has led to a new notion of shapes and standard Young tableaux which works for the root system of any finite Coxeter group. This paper is completely independent of affine Hecke algebra…
Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A…
We study positivity and probabilistic properties arising from the Young--Fibonacci lattice $\mathbb{YF}$, a 1-differential poset on binary (Fibonacci) words of 1's and 2's, graded by digit sum. Building on Okada's theory of clone Schur…
We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…
Tableau switching is a well studied bijection on pairs of skew Young tableaux which swaps their relative positions. This is achieved by successively sliding the entries of the inner tableaux through the outer one via jeu de taquin (JDT)…