arXiv math/01090922001-09-14math.COmath.RT

The Rank and Minimal Border Strip Decompositions of a Skew Partition

Richard P. Stanley

备注：: 31 pages, 10 figures

英文摘要：

Nazarov and Tarasov recently generalized the notion of the rank of a partition to skew partitions. We give several characterizations of the rank of a skew partition and one possible characterization that remains open. One of the characterizations involves the decomposition of a skew shape into a minimal number of border strips, and we develop a theory of these MBSD's as well as of the closely related minimal border strip tableaux. An application is given to the value of a character of the symmetric group S_n indexed by a skew shape z at a permutation whose number of cycles is the rank of z.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Enumeration of border-strip decompositions & Weil-Petersson volumes

We describe an injection from border-strip decompositions of certain shapes to permutations. This allows us to provide enumeration results, as well as $q$-analogues of enumeration formulas. Finally, we use this injection to prove a connection between the number of border-strip decompositions of the $n\times 2n$ rectangle and the Weil-Petersson volume of the moduli space of an $n$-punctured Riemann sphere.

2018-05-26math.CO

A Refinement of the Murnaghan-Nakayama Rule by Descents for Border Strip Tableaux

Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields the number of border strip tableaux with all strips of size $k$, up to sign. This is essentially the special case of the Murnaghan-Nakayama rule for evaluating an irreducible character of the symmetric group at a rectangular partition. We refine this result to standard Young tableaux and border strip tableaux with a given number of descents. To do so, we intr…

2021-05-28math.CO

Transformations of Border Strips and Schur Function Determinants

We introduce the notion of the cutting strip of an outside decomposition of a skew shape, and show that cutting strips are in one-to-one correspondence with outside decompositions for a given skew shape. Outside decompositions are introduced by Hamel and Goulden and are used to give an identity for the skew Schur function that unifies the determinantal expressions for the skew Schur functions including the Jacobi-Trudi determinant, its dual, the Giambelli determinant and the rim ribbon determinant due to Lascoux and Pragacz. Using cutting strips, one obtains a formula for the number of outside…

2004-06-12math.CO

Outside nested decompositions of skew diagrams and Schur function determinants

In this paper we describe the thickened strips and the outside nested decompositions of any skew shape $λ/μ$. For any such decomposition $Φ=(Θ_1,Θ_2,\ldots,Θ_g)$ of the skew shape $λ/μ$ where $Θ_i$ is a thickened strip for every $i$, if $r$ is the number of boxes that are contained in any two distinct thickened strips of $Φ$, we establish a determinantal formula of the function $s_{λ/μ}(X)p_{1^r}(X)$ with the Schur functions of thickened strips as entries, where $s_{λ/μ}(X)$ is the Schur function of the skew shape $λ/μ$ and $p_{1^r}(X)$ is the power sum symmetric function index by the partitio…

2016-07-06math.CO

Hook formulas for skew shapes II. Combinatorial proofs and enumerative applications

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of Naruse's formula: for the skew Schur functions, and for counting reverse plane partitions of skew shapes. In this paper we give an elementary proof of Naruse's formula based on the case of border strips. For special border strips, we obtain curious new formulas for the Euler and $q$-Euler numbers in terms of certain Dyck path summations.

2020-06-02math.CO

The Decomposition Algorithm of Skew-symmetrizable Exchange Matrices

Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that determines if a given skew-symmetrizable matrix is of such type. This algorithm generalizes the one in \cite{WG}. As a corollary, we use this algorithm to determine if a given skew-symmetrizable matrix has finite mutation type.

2012-02-04math.AGmath.CO

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

On the three-rowed skew standard Young tableaux

Let $\mathcal{T}_3$ be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with $n-3$ entries in the "skew three-rowed strip" $\mathcal{T}_3 / (2,1,0)$ is $m_{n-1}-m_{n-3}$, a difference of two Motzkin numbers. This conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard …

2010-05-12math.CO

Enumeration formulas for Young tableaux in a diagonal strip

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The analysis uses a transfer operator approach extending the method of Elkies, combined with an identity expressing the volume of a certain polytope in terms of a Schur function.

2007-09-04math.CO

极小斜半标准表与Hillman--Grassl对应

Minimal skew semistandard tableaux and the Hillman--Grassl correspondence

本文定义极小斜半标准表，通过新的Hillman--Grassl双射描述与激发图对应，并证明NHLF加数少于OOF加数，刻画两者加数相等的形状。

2023-11-15math.CO

循环筛分、斜麦克唐纳多项式与Schur正性

Cyclic sieving, skew Macdonald polynomials and Schur positivity

该研究证明了分拆部分为n的倍数时，特殊化非对称麦克唐纳多项式对应的填充集合满足循环筛分现象，引入其斜版本并证明Schur正性，还得到一类新LLT多项式的组合Schur展开。

2019-07-31math.COmath.RT

The Zrank Conjecture and Restricted Cauchy Matrices

The rank of a skew partition $λ/μ$, denoted $rank(λ/μ)$, is the smallest number $r$ such that $λ/μ$ is a disjoint union of $r$ border strips. Let $s_{λ/μ}(1^t)$ denote the skew Schur function $s_{λ/μ}$ evaluated at $x_1=...=x_t=1, x_i=0$ for $i>t$. The zrank of $λ/μ$, denoted $zrank(λ/μ)$, is the exponent of the largest power of $t$ dividing $s_{λ/μ}(1^t)$. Stanley conjectured that $rank(λ/μ)=zrank(λ/μ)$. We show the equivalence between the validity of the zrank conjecture and the nonsingularity of restricted Cauchy matrices. In support of Stanley's conjecture we give affirmative answers for s…

2005-04-24math.CO

Reverse plane partitions of skew staircase shapes and $q$-Euler numbers

Recently, Naruse discovered a hook length formula for the number of standard Young tableaux of a skew shape. Morales, Pak and Panova found two $q$-analogs of Naruse's hook length formula over semistandard Young tableaux (SSYTs) and reverse plane partitions (RPPs). As an application of their formula, they expressed certain $q$-Euler numbers, which are generating functions for SSYTs and RPPs of a zigzag border strip, in terms of weighted Dyck paths. They found a determinantal formula for the generating function for SSYTs of a skew staircase shape and proposed two conjectures related to RPPs of t…

2017-11-07math.CO

用于 Euler 数和 Catalan 数的混合二聚体模型

Mixed Dimer Models for Euler and Catalan Numbers

本文研究带状斜 Young 图的混合二聚体覆盖计数，证明直线形和之字形分别对应 Euler 数与 Catalan 数，并借助偏序同构得到相应 q-类似物。

2025-03-15math.CO

Vacillating Hecke Tableaux and Linked Partitions

We introduce the structure of vacillating Hecke tableaux, and establish a one-to-one correspondence between vacillating Hecke tableaux and linked partitions by using the Hecke insertion algorithm developed by Buch, Kresch, Shimozono, Tamvakis and Yong. Linked partitions arise in free probability theory. Motivated by the Hecke insertion algorithm, we define a Hecke diagram as a Young diagram possibly with a marked corner. A vacillating Hecke tableau is defined as a sequence of Hecke diagrams subject to certain addition and deletion of rook strips. The notion of a rook strip was introduced by Bu…

2014-05-15math.AGmath.CO