Related papers: Wreath Product Symmetric Functions
An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section…
Skewing operators play a central role in the symmetric function theory because of the importance of the product structure of the symmetric function space. The theory of noncommutative symmetric functions is a useful tool for studying…
Symplectic $Q$-functions are a symplectic analogue of Schur $Q$-functions and defined as the $t=-1$ specialization of Hall--Littlewood functions associated with the root system of type $C$. In this paper we prove that symplectic…
In previous work with Mikhail Khovanov and Aaron Lauda we introduced two odd analogues of the Schur functions: one via the combinatorics of Young tableaux (odd Kostka numbers) and one via the odd symmetrization operator. In this paper we…
The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…
In this paper, using the theory of category, we generalize known properties of symmetric polynomials and functions and characterize the multi-indicial symmetric functions. Examples have been given on Schur functions.
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…
We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur…
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…
For a finitely generated regular wreath product, the metric is known, but its computation can be an NP-complete problem. Also, it is not known for the nonregular case. In this article, a metric estimate is defined for regular wreath…
We present a set of algebraic relations among Schur functions which are a multi-time generalization of the ``discrete Hirota relations'' known to hold among the Schur functions of rectangular partitions. We prove the relations as an…
Asvin G and Andrew O'Desky recently introduced the graded algebra P$\Lambda$ of polysymmetric functions as a generalization of the algebra $\Lambda$ of symmetric functions. This article develops combinatorial formulas for some…
The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…
We show that certain differences of products of $P$-partition generating functions are positive in the basis of fundamental quasi-symmetric functions L_\alpha. This result interpolates between recent Schur positivity and monomial positivity…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
In 2004 Rosas and Sagan asked whether there was a way to define a basis in the algebra of symmetric functions in noncommuting variables, NCSym, having properties analogous to the classical Schur functions. This was because they had…
Plethysm is a fundamental operation in symmetric function theory, derived directly from its connection with representation theory. However, it does not admit a simple combinatorial interpretation, and finding coefficients of Schur function…
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…
The Pieri rule is a nonnegative, multiplicity-free formula for the Schur function expansion of the product of an arbitrary Schur function with a single row Schur function. Key polynomials are characters of Demazure modules for the general…