Search for: All records

Abstract We study the lattice of submonoids of the uniform block permutation monoid containing the symmetric group (which is its group of units). We prove that this lattice is distributive under union and intersection by relating the submonoids containing the symmetric group to downsets in a new partial order on integer partitions. Furthermore, we show that the sizes of the$$\mathscr {J}$$ $J$-classes of the uniform block permutation monoid are sums of squares of dimensions of irreducible modules of the monoid algebra. 

Abstract We introduce the immersion poset$$({\mathcal {P}}(n), \leqslant _I)$$ $(P\left(n\right),{⩽}_I)$on partitions, defined by$$\lambda \leqslant _I \mu $$ $\lambda {⩽}_I\mu$if and only if$$s_\mu (x_1, \ldots , x_N) - s_\lambda (x_1, \ldots , x_N)$$ $s_{\mu }(x_1,\dots ,x_N)-s_{\lambda }(x_1,\dots ,x_N)$is monomial-positive. Relations in the immersion poset determine when irreducible polynomial representations of$$GL_N({\mathbb {C}})$$ $G{L}_N\left(C\right)$form an immersion pair, as defined by Prasad and Raghunathan [7]. We develop injections$$\textsf{SSYT}(\lambda , \nu ) \hookrightarrow \textsf{SSYT}(\mu , \nu )$$ $\mathrm{SSYT}(\lambda ,\nu )\hookrightarrow \mathrm{SSYT}(\mu ,\nu )$on semistandard Young tableaux given constraints on the shape of$$\lambda $$ $\lambda$, and present results on immersion relations among hook and two column partitions. The standard immersion poset$$({\mathcal {P}}(n), \leqslant _{std})$$ $(P\left(n\right),{⩽}_{\mathrm{std}})$is a refinement of the immersion poset, defined by$$\lambda \leqslant _{std} \mu $$ $\lambda {⩽}_{\mathrm{std}}\mu$if and only if$$\lambda \leqslant _D \mu $$ $\lambda {⩽}_D\mu$in dominance order and$$f^\lambda \leqslant f^\mu $$ $f^{\lambda }⩽f^{\mu }$, where$$f^\nu $$ $f^{\nu }$is the number of standard Young tableaux of shape$$\nu $$ $\nu$. We classify maximal elements of certain shapes in the standard immersion poset using the hook length formula. Finally, we prove Schur-positivity of power sum symmetric functions on conjectured lower intervals in the immersion poset, addressing questions posed by Sundaram [12]. 

We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $$w_{n,k,m}$$ is the number of Dyck paths of semilength $$n$$ with $$k$$ occurrences of $UD$ and $$m$$ occurrences of $UUD$, then $$w_{2k+1,k,m}=w_{2k+1,k,k+1-m}$$. We give a combinatorial proof of this fact, relying on the cycle lemma, and showing that the numbers $$w_{2k+1,k,m}$$ are multiples of the Narayana numbers. We prove a more general fact establishing a relationship between the numbers $$w_{n,k,m}$$ and a family of generalized Narayana numbers due to Callan. A closed-form expression for the even more general numbers $$w_{n,k_{1},k_{2},\ldots, k_{r}}$$ counting the semilength-$$n$$ Dyck paths with $$k_{1}$$ $UD$-factors, $$k_{2}$$ $UUD$-factors, $$\ldots$$, and $$k_{r}$$ $$U^{r}D$$-factors is also obtained, as well as a more general form of the discussed symmetry for these numbers in the case when all rise runs are of certain minimal length. Finally, we investigate properties of the polynomials $$W_{n,k}(t)= \sum_{m=0}^k w_{n,k,m} t^m$$, including real-rootedness, $$\gamma$$-positivity, and a symmetric decomposition. 

It is an important problem in algebraic combinatorics to deduce the Schur function expansion of a symmetric function whose expansion in terms of the fundamental quasisymmetric function is known. For example, formulas are known for the fundamental expansion of a Macdonald symmetric function and for the plethysm of two Schur functions, while the Schur expansions of these expressions are still elusive. Based on work of Egge, Loehr and Warrington, Garsia and Remmel provided a method to obtain the Schur expansion from the fundamental expansion by replacing each quasisymmetric function by a Schur function (not necessarily indexed by a partition) and using straightening rules to obtain the Schur expansion. Here we provide a new method that only involves the coefficients of the quasisymmetric functions indexed by partitions and the quasi-Kostka matrix. As an application, we identify the lexicographically largest term in the Schur expansion of the plethysm of two Schur functions. We provide the Schur expansion of $$s_w[s_h](x,y)$$ for $w=2,3,4$ using novel symmetric chain decompositions of Young's lattice for partitions in a $$w\times h$$ box. For $w=4$, this is the first known combinatorial expression for the coefficient of $$s_{\lambda}$$ in $$s_{w}[s_{h}]$$ for two-row partitions $$\lambda$$, and for $w=3$ the combinatorial expression is new. 

Composing two representations of the general linear groups gives rise to Littlewood’s (outer) plethysm. On the level of characters, this poses the question of finding the Schur expansion of the plethysm of two Schur functions. A combinatorial interpretation for the Schur expansion coefficients of the plethysm of two Schur functions is, in general, still an open problem. We identify a proof technique of combinatorial representation theory, which we call the “s-perp trick”, and point out several examples in the literature where this idea is used. We use the s-perp trick to give algorithms for computing monomial and Schur expansions of symmetric functions. In several special cases, these algorithms are more efficient than those currently implemented in SageMath. 

We construct an injection from the set of r-fans of Dyck paths of length n into the set of chord diagrams on [n] that intertwines promotion and rotation. This is done in two different ways, namely as fillings of promotion matrices and in terms of Fomin growth diagrams. Our analysis uses the fact that r-fans of Dyck paths can be viewed as highest weight elements of weight zero in crystals of type Br, which in turn can be analyzed using virtual crystals. On the level of Fomin growth diagrams, the virtualization process corresponds to the Roby–Krattenthaler blow up construction. Our construction generalizes to vacillating tableaux as well. We give a cyclic sieving phenomenon on r-fans of Dyck paths using the promotion action.