Related papers: 3-Plethysms of homogeneous and elementary symmetri…
The elementary symmetric partition function is a map on the set of partitions. It sends a partition lambda to the partition whose parts are the summands in the evaluation of the elementary symmetric function on the parts of lambda. These…
Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…
Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…
We introduce the edge Schur functions $E^{\lambda}$ that are defined as a generating series over edge labeled tableaux. We formulate $E^{\lambda}$ as the partition function for a solvable lattice model, which we use to show they are…
We consider an operator of Bernstein for symmetric functions, and give an explicit formula for its action on an arbitrary Schur function. This formula is given in a remarkably simple form when written in terms of some notation based on the…
We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are…
We consider a type of divided symmetrization $\overrightarrow{D}_{\lambda,G}$ where $\lambda$ is a nonincreasing partition on $n$ and where $G$ is a graph. We discover that in the case where $\lambda$ is a hook shape partition with first…
We study the representation theory of the uniform block permutation algebra in the context of the representation theory of factorizable inverse monoids. The uniform block permutation algebra is a subalgebra of the partition algebra and is…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
To find crystals of $\mathfrak{sl}_2$ representations of the form $\Lambda^n\text{Sym}^r\mathbb{C}^2$ it suffices to solve the combinatorial problem of decomposing Young's lattice into symmetric, saturated chains. We review the literature…
Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formula using A. Schilling's bijection between ribbon tableaux and…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
We use crystals of tableaux and descent compositions to understand the decomposition of Schur functions $s_\lambda$ into Gessel's fundamental quasisymmetric functions $F_\alpha$. The connected crystal of tableaux $B(\lambda)$, associated to…
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…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
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…
This paper proves a combinatorial rule expressing the product $s_\tau(s_{\lambda/\mu} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur…
We show that a ratio of Schur polynomials $s_{\lambda}/s_{\rho}$ associated to partitions $\lambda$ and $\rho$ such that $\lambda\subsetneq\rho$ has a negative partial derivative at any point where all variables are positive. This is…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…