We develop two combinatorial proofs of the fact that certain Young tableaux are counted by the Catalan numbers. The setting is a larger class of tableaux where labels increase along rows without attention to whether labels increase down columns. We define a new operation called tableau cycling. It is used to duplicate the reflection argument attributed to Andr´e in the tableaux setting, and also to prove a tableaux analog of the Chung-Feller theorem
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible general...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
International audienceIn this article, we consider a generalization of Young tableaux in which we al...
Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells ma...
AbstractA new very short proof of the counting formula for Young tableaux is given. Its equivalence ...
This is the first of three papers that develop structures which are countedby a "parabolic" generali...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...
Fix an integer partition lambda that has no more than n parts. Let beta be aweakly increasing n-tupl...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
International audienceIn this work we introduce and study tree-like tableaux, which are certain fill...
Cette thèse se situe au carrefour de la combinatoire énumérative, algébrique et bijective. Elle se c...
Cette thèse se situe au carrefour de la combinatoire énumérative, algébrique et bijective. Elle se c...
Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can c...
AbstractMany interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible...
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible general...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
International audienceIn this article, we consider a generalization of Young tableaux in which we al...
Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells ma...
AbstractA new very short proof of the counting formula for Young tableaux is given. Its equivalence ...
This is the first of three papers that develop structures which are countedby a "parabolic" generali...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...
Fix an integer partition lambda that has no more than n parts. Let beta be aweakly increasing n-tupl...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
International audienceIn this work we introduce and study tree-like tableaux, which are certain fill...
Cette thèse se situe au carrefour de la combinatoire énumérative, algébrique et bijective. Elle se c...
Cette thèse se situe au carrefour de la combinatoire énumérative, algébrique et bijective. Elle se c...
Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can c...
AbstractMany interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible...
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible general...
AbstractWe study a new class of tableaux defined by a certain condition on hook-ranks. Many connecti...
International audienceIn this article, we consider a generalization of Young tableaux in which we al...