Bijections between pattern-avoiding fillings of Young diagrams

  title={Bijections between pattern-avoiding fillings of Young diagrams},
  author={Matthieu Josuat-Verg{\`e}s},
  journal={J. Comb. Theory, Ser. A},

Figures from this paper

Combinatorics of diagrams of permutations

Lonesum and Γ-free 0-1 fillings of Ferrers shapes

Lonesum and $\Gamma$-free $0$-$1$ fillings of Ferrers shapes

We show that $\Gamma$-free fillings and lonesum fillings of Ferrers shapes are equinumerous by applying a previously defined bijection on matrices for this more general case and by constructing a new

Generalization of Euler and Ramanujan’s Partition Functions

The theory of partitions has interested some of the best minds since the 18th century. In 1742, Leonhard Euler established the generating function of P(n). Godfrey Harold Hardy said that Srinivasa

Sujet de thèse : Combinatoire des tableaux escaliers

Les tableaux de permutation sont des objets récents introduits par L. Williams (Harvard) [22]. Ils sont une sous-classe des Γ -diagrammes introduits A. Postnikov (MIT) [19] pour l’énumération des



Permutation tableaux and permutation patterns

Total positivity for cominuscule Grassmannians

In this paper we explore the combinatorics of the nonneg- ative part (G/P )≥0 of a cominuscule Grassmannian. For each such Grassmannian we define Γ — certain fillings of generalized Young diagrams

Pattern-Avoidance in Binary Fillings of Grid Shapes (short version)

A $\textit{grid shape}$ is a set of boxes chosen from a square grid; any Young diagram is an example. This paper considers a notion of pattern-avoidance for $0-1$ fillings of grid shapes, which

Acyclic orientations of graphs

Enumeration of totally positive Grassmann cells

Generalized triangulations and diagonal-free subsets of stack polyominoes

On Some Properties of Permutation Tableaux

Abstract.We consider the relations between various permutation statistics and properties of permutation tableaux. We answer some of the open problems of Steingrímsson and Williams [8], in particular,

Total positivity, Grassmannians, and networks

The aim of this paper is to discuss a relationship between total positivity and planar directed networks. We show that the inverse boundary problem for these networks is naturally linked with the

Pattern-avoidance in binary fillings of grid shapes, Proc. FPSAC’2008

  • 2008

Total positivity, grassmannians, and networks, preprint 2006, arXiv:math/0609764v1

  • Total positivity, grassmannians, and networks, preprint 2006, arXiv:math/0609764v1