Search arXivSearch

arXiv · 1711.02337

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

Abstract

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 the same shape. One conjecture is a determinantal formula for the number of \emph{pleasant diagrams} in terms of Schröder paths and the other conjecture is a determinantal formula for the generating function for RPPs of a skew staircase shape in terms of $q$-Euler numbers. In this paper, we show that the results of Morales, Pak and Panova on the $q$-Euler numbers can be derived from previously known results due to Prodinger by manipulating continued fractions. These $q$-Euler numbers are naturally expressed as generating functions for alternating permutations with certain statistics involving \emph{maj}. It has been proved by Huber and Yee that these $q$-Euler numbers are generating functions for alternating permutations with certain statistics involving \emph{inv}. By modifying Foata's bijection we construct a bijection on alternating permutations which sends the statistics involving \emph{maj} to the statistic involving \emph{inv}. We also prove the aforementioned two conjectures of Morales, Pak and Panova.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Byung-Hak Hwang, Jang Soo Kim, Meesue Yoo, Sun-mi Yun. 2017-11-07. Reverse plane partitions of skew staircase shapes and $q$-Euler numbers. https://arxiv.org/abs/1711.02337

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO