Search arXivSearch

arXiv · math/9809126

Lattice Diagram Polynomials and Extended Pieri Rules

Abstract

The lattice cell in the ${i+1}^{st}$ row and ${j+1}^{st}$ column of the positive quadrant of the plane is denoted $(i,j)$. If $μ$ is a partition of $n+1$, we denote by $μ/ij$ the diagram obtained by removing the cell $(i,j)$ from the (French) Ferrers diagram of $μ$. We set $Δ_{μ/ij}=\det \| x_i^{p_j}y_i^{q_j} \|_{i,j=1}^n$, where $(p_1,q_1),... ,(p_n,q_n)$ are the cells of $μ/ij$, and let ${\bf M}_{μ/ij}$ be the linear span of the partial derivatives of $Δ_{μ/ij}$. The bihomogeneity of $Δ_{μ/ij}$ and its alternating nature under the diagonal action of $S_n$ gives ${\bf M}_{μ/ij}$ the structure of a bigraded $S_n$-module. We conjecture that ${\bf M}_{μ/ij}$ is always a direct sum of $k$ left regular representations of $S_n$, where $k$ is the number of cells that are weakly north and east of $(i,j)$ in $μ$. We also make a number of conjectures describing the precise nature of the bivariate Frobenius characteristic of ${\bf M}_{μ/ij}$ in terms of the theory of Macdonald polynomials. On the validity of these conjectures, we derive a number of surprising identities. In particular, we obtain a representation theoretical interpretation of the coefficients appearing in some Macdonald Pieri Rules.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. Bergeron, N. Bergeron, A. M. Garsia, M. Haiman, G. Tesler. 1998-09-22. Lattice Diagram Polynomials and Extended Pieri Rules. https://doi.org/10.1006/aima.1998.1791

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