arXiv 0902.36372009-02-20math.CO

Major Index for 01-Fillings of Moon Polyominoes

William Y. C. Chen, Svetlana Poznanovik, Catherine H. Yan, Arthur L. B. Yang

备注：: 28 pages, 14 figures

英文摘要：

We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. We consider the set F(M, s; A) of all 01-fillings of a moon polyomino M with given column sum s whose empty rows are A, and prove that this major index has the same distribution as the number of north-east chains, which are the natural extension of inversions (resp. crossings) for permutations (resp. set partitions). Hence our result generalizes the classical equidistribution results for the permutation statistics inv and maj. Two proofs are presented. The first is an algebraic one using generating functions, and the second is a bijection on 01-fillings of moon polyominoes in the spirit of Foata's second fundamental transformation on words and permutations.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

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

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

Maximal increasing sequences in fillings of almost-moon polyominoes

It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino that do not contain a northeast chain of size $k$ depends only on the set of columns of the polyomino, but not the shape of the polyomino. Rubey's proof is an adaption of jeu de taquin and promotion for arbitrary fillings of moon polyominoes. In this paper we present a bijective proof for this result by considering fillings of almost-moon polyominoes, which are moon polyominoes after removing one of the rows. Explicitly, we construct a bijection which preserves the size of the largest northeast cha…

2014-03-25math.CO

矩形与月亮多米诺中的分段线性提升与RSK

Piecewise-linear promotion and RSK in rectangles and moon polyominoes

本研究探讨月亮多米诺与矩形中Schützenberger提升、清空及RSK对应的分段线性/双有理提升，证明链统计量的偏移规律，构建保统计量的Rubey双射版本并验证其交换性，推导相关链多面体类似物的Ehrhart性质。

2023-05-02math.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

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

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

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

2024-08-29math.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

Mixed Statistics on 01-Fillings of Moon Polyominoes

We establish a stronger symmetry between the numbers of northeast and southeast chains in the context of 01-fillings of moon polyominoes. Let $\M$ be a moon polyomino with $n$ rows and $m$ columns. Consider all the 01-fillings of $\M$ in which every row has at most one 1. We introduce four mixed statistics with respect to a bipartition of rows or columns of $\M$. More precisely, let $S \subseteq \{1,2,..., n\}$ and $\mathcal{R}(S)$ be the union of rows whose indices are in $S$. For any filling $M$, the top-mixed (resp. bottom-mixed) statistic $α(S; M)$ (resp. $β(S; M)$) is the sum of the numbe…

2009-08-01math.CO