Add to ORKGWe define and construct the "canonical reduced word" of a boolean permutation, and show that the RSK tableaux for that permutation can be read off directly from this reduced word. We also describe those tableaux that can correspond to boolean permutations, and enumerate them. In addition, we generalize a result of Mazorchuk and Tenner, showing that the "run" statistic influences the shape of the RSK tableau of arbitrary permutations, not just of those that are boolean.Comment: 18 pages, 3 figure
AbstractIn this paper we propose two bijections between permutation tableaux and permutations. These...
We review a recent development at the interface between discrete mathematics on one hand and probabi...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
For each fully commutative permutation, we construct a "boolean core," which is the maximal boolean ...
The Robinson-Schensted-Knuth (RSK) correspondence is a fundamental concept in combinatorics and repr...
A reduced word of a permutation $w$ is a minimal length expression of $w$ as a product of simple tra...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
In this paper we propose a new bijection between permutation tableaux and permutations. This bijecti...
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary s...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
A box-ball system (BBS) is a discrete dynamical system consisting of n balls in an infinite strip of...
International audienceIn this paper we propose a new bijection between permutation tableaux and perm...
International audienceIn this paper we propose a new bijection between permutation tableaux and perm...
AbstractIn (Adv. Math. 174(2) (2003) 236), a bijection between collections of reduced factorizations...
AbstractIn this paper we propose two bijections between permutation tableaux and permutations. These...
We review a recent development at the interface between discrete mathematics on one hand and probabi...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
For each fully commutative permutation, we construct a "boolean core," which is the maximal boolean ...
The Robinson-Schensted-Knuth (RSK) correspondence is a fundamental concept in combinatorics and repr...
A reduced word of a permutation $w$ is a minimal length expression of $w$ as a product of simple tra...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
In this paper we propose a new bijection between permutation tableaux and permutations. This bijecti...
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary s...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
A box-ball system (BBS) is a discrete dynamical system consisting of n balls in an infinite strip of...
International audienceIn this paper we propose a new bijection between permutation tableaux and perm...
International audienceIn this paper we propose a new bijection between permutation tableaux and perm...
AbstractIn (Adv. Math. 174(2) (2003) 236), a bijection between collections of reduced factorizations...
AbstractIn this paper we propose two bijections between permutation tableaux and permutations. These...
We review a recent development at the interface between discrete mathematics on one hand and probabi...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...