arXiv math/05106762005-10math.CO

Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes

Christian Krattenthaler

备注：: AmS-LaTeX; 27 pages; many corrections and improvements of short-comings; thanks to comments by Mireille Bousquet-Melou and Jakob Jonsson, the final section is now much more profound and has additional results
发表信息：: Adv. Appl. Math. 37 (2006), 404-431.

英文摘要：

We put recent results by Chen, Deng, Du, Stanley and Yan on crossings and nestings of matchings and set partitions in the larger context of the enumeration of fillings of Ferrers shape on which one imposes restrictions on their increasing and decreasing chains. While Chen et al. work with Robinson-Schensted-like insertion/deletion algorithms, we use the growth diagram construction of Fomin to obtain our results. We extend the results by Chen et al., which, in the language of fillings, are results about $0$-$1$-fillings, to arbitrary fillings. Finally, we point out that, very likely, these results are part of a bigger picture which also includes recent results of Jonsson on $0$-$1$-fillings of stack polyominoes, and of results of Backelin, West and Xin and of Bousquet-Mélou and Steingr\'ımsson on the enumeration of permutations and involutions with restricted patterns. In particular, we show that our growth diagram bijections do in fact provide alternative proofs of the results by Backelin, West and Xin and by Bousquet-Mélou and Steingr\'ımsson.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

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

We show that $Γ$-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 bijection between Callan sequences and Dumont-like permutations. As an application, we give a new combinatorial interpretation of Genocchi numbers in terms of Callan sequences. Further, we recover some of Hetyei's results on alternating acyclic tournaments. Finally, we present an interesting result in the case of certain other special shapes.

2019-11-23math.CO

k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams

We give a correspondence between graphs with a given degree sequence and fillings of Ferrers diagrams by nonnegative integers with prescribed row and column sums. In this setting, k-crossings and k-nestings of the graph become occurrences of the identity and the antiidentity matrices in the filling. We use this to show the equality of the numbers of k-noncrossing and k-nonnesting graphs with a given degree sequence. This generalizes the analogous result for matchings and partition graphs of Chen, Deng, Du, Stanley, and Yan, and extends results of Klazar to k>2. Moreover, this correspondence re…

2006-04-09math.CO

避免对角模式的斜杨图填充

Fillings of skew shapes avoiding diagonal patterns

研究斜杨图的整数填充，证明 D-free 形状中避免东北链与东南链的填充双射，并构造任意斜杨图避免东南链与避免东北链及特定子填充的 01-填充双射。

2021-06-15cs.DMmath.CO

Combinatorics of the Deodhar decomposition of the Grassmannian

The Deodhar decomposition of the Grassmannian is a refinement of the Schubert, Richardson, and positroid stratifications of the Grassmannian. Go-diagrams are certain fillings of Ferrers diagrams with black stones, white stones, and pluses which index Deodhar components in the Grassmannian. We provide a series of corrective flips on diagrams which may be used to transform arbitrary fillings of Ferrers shapes with black stones, white stones, and pluses into a Go-diagram. This provides an extension of Lam and Williams' Le-moves for transforming reduced diagrams into Le-diagrams to the context of …

2018-07-24math.CO

Decreasing subsequences in permutations and Wilf equivalence for involutions

In a recent paper, Backelin, West and Xin describe a map $ϕ^*$ that recursively replaces all occurrences of the pattern $k... 21$ in a permutation $σ$ by occurrences of the pattern $(k-1)... 21 k$. The resulting permutation $ϕ^*(σ)$ contains no decreasing subsequence of length $k$. We prove that, rather unexpectedly, the map $ϕ^*$ commutes with taking the inverse of a permutation. In the BWX paper, the definition of $ϕ^*$ is actually extended to full rook placements on a Ferrers board (the permutations correspond to square boards), and the construction of the map $ϕ^*$ is the key step in provi…

2004-05-17math.CO

Maximal fillings of moon polyominoes, simplicial complexes, and Schubert polynomials

We exhibit a canonical connection between maximal (0,1)-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity result for Schubert polynomials. For Ferrers shapes, we moreover construct a bijection to maximal fillings avoiding south-east chains of the same length which specializes to a bijection between k-triangulations of the n-gon and k-fans of Dy…

2011-07-05math.CO

更多相关论文收起更多论文

Maximal 0-1 fillings of moon polyominoes with restricted chain-lengths and rc-graphs

We show that maximal 0-1-fillings of moon polynomials with restricted chain lengths can be identified with certain rc-graphs, also known as pipe dreams. In particular, this exhibits a connection between maximal 0-1-fillings of Ferrers shapes and Schubert polynomials. Moreover, it entails a bijective proof showing that the number of maximal fillings of a stack polyomino S with no north-east chains longer than k depends only on k and the multiset of column heights of S. Our main contribution is a slightly stronger theorem, which in turn leads us to conjecture that the poset of rc-graphs with cov…

2011-05-18math.CO

Increasing and Decreasing Sequences in Fillings of Moon Polyominoes

We present an adaptation of jeu de taquin and promotion for arbitrary fillings of moon polyominoes. Using this construction we show various symmetry properties of such fillings taking into account the lengths of longest increasing and decreasing chains. In particular, we prove a conjecture of Jakob Jonsson. We also relate our construction to the one recently employed by Christian Krattenthaler, thus generalising his results.

2009-11-16math.CO

Increasing and Decreasing Sequences of Length Two in 01-Fillings of Moon Polyominoes

We put recent results on the symmetry of the joint distribution of the numbers of crossings and nestings of two edges over matchings, set partitions and linked partitions, in the larger context of the enumeration of increasing and decreasing chains of length 2 in fillings of moon polyominoes.

2008-12-03math.CO

Hecke增长图，以及堆叠多联骨牌填充中的最大递增和递减序列

Hecke growth diagrams, and maximal increasing and decreasing sequences in fillings of stack polyominoes

本文通过建立堆叠多联骨牌$01$-填充与拐角标记的双射，推广了增长图技术，为最长递增递减链对称分布定理提供了新证明与视角。

2024-08-29math.CO

A symmetry theorem on a modified jeu de taquin

For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with $1,2,...,n$ (tabloid) into a standard tableau. Their definition relies on a total order of the cells in the Ferrers diagram induced by a special standard tableau, however, this definition also makes sense for the total order induced by any other standard tableau. Given two standard tableaux $P,Q$ of the same shape we show that the number of tabloids which result i…

2001-12-23math.CO

Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes

We prove that the number of 01-fillings of a given stack polyomino (a polyomino with justified rows whose lengths form a unimodal sequence) with at most one 1 per column which do not contain a fixed-size northeast chain and a fixed-size southeast chain, depends only on the set of row lengths of the polyomino. The proof is via a bijection between fillings of stack polyominoes which differ only in the position of one row and uses the Hecke insertion algorithm by Buch, Kresch, Shimozono, Tamvakis, and Yong and the jeu de taquin for increasing tableaux of Thomas and Yong. Moreover, our bijection g…

2019-11-18math.CO

On the symmetry of ascents and descents over 01-fillings of moon polyominoes

The purpose of this short paper is to put recent results on the symmetry of the joint distribution of the numbers of crossings and nestings of two edges over matchings, set partitions and linked partitions, in the larger context of the enumeration of increasing and decreasing chains of length 2 in fillings of moon polyominoes.

2008-07-06math.CO

NW-SE expansions of non-symmetric Cauchy kernels on near staircases and growth diagrams

Lascoux has given a triangular version of the Cauchy identity where Schur polynomials are replaced by Demazure characters and Demazure atoms. He has then used the staircase expansion to recover expansions for all Ferrers shapes, where the Demazure characters and Demazure atoms are under the action of Demazure operators specified by the cells above the staircase. The characterisation of the tableau-pairs in these last expansions is less explicit. We give here a bijective proof for expansions over near staircases, where the tableau-pairs are made explicit. Our analysis formulates Mason's RSK ana…

2014-12-01math.COmath.RT

词子区间中的严格递增和严格递减序列以及Guo和Poznanović的一个猜想

Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović

我们证明了Guo和Poznanović关于月亮多联骨牌01填充中链的猜想，通过构造词与递增表对之间的对应关系，并利用K-融合算子获得双射，同时引入RSK对应和Knuth等价的新变体。

2023-11-11math.CO