Search arXivSearch

arXiv · math/0405136

Order ideals in weak subposets of Young's lattice and associated unimodality conjectures

Abstract

The k-Young lattice Y^k is a weak subposet of the Young lattice containing partitions whose first part is bounded by an integer k>0. The Y^k poset was introduced in connection with generalized Schur functions and later shown to be isomorphic to the weak order on the quotient of the affine symmetric group by a maximal parabolic subgroup. We prove a number of properties for $Y^k$ including that the covering relation is preserved when elements are translated by rectangular partitions with hook-length $k$. We highlight the order ideal generated by an $m\times n$ rectangular shape. This order ideal, L^k(m,n), reduces to L(m,n) for large k, and we prove it is isomorphic to the induced subposet of L(m,n) whose vertex set is restricted to elements with no more than k-m+1 parts smaller than m. We provide explicit formulas for the number of elements and the rank-generating function of L^k(m,n). We conclude with unimodality conjectures involving q-binomial coefficients and discuss how implications connect to recent work on sieved q-binomial coefficients.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luc Lapointe, Jennifer Morse. 2004-05-07. Order ideals in weak subposets of Young's lattice and associated unimodality conjectures. https://arxiv.org/abs/math/0405136

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