Related papers: Pieri's Formula for Generalized Schur Polynomials
Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…
By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…
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…
Supersymmetric quantum mechanics has many applications, and typically uses a raising and lowering operator formalism. For one dimensional problems, we show how such raising and lowering operators may be generalized to include an arbitrary…
We introduce a probabilistic generalization of the dual Robinson--Schensted--Knuth correspondence, called $qt$RSK${}^*$, depending on two parameters $q$ and $t$. This correspondence extends the $q$RS$t$ correspondence, recently introduced…
Explicit forms are given of matrix elements of generalized coherent operators based on Lie algebras su(1,1) and su(2). We also give a kind of factorization formula of the associated Laguerre polynomials.
A notion of generalized $n$-semimodularity is introduced, which extends that of (sub/super)mod\-ularity in four ways at once. The main result of this paper, stating that every generalized $(n\colon\!2)$-semimodular function on the $n$th…
Let $\Phi:V\to V\otimes U$ be an intertwining operator between representations of a simple Lie algebra (quantum group, affine Lie algebra). We define its generalized character to be the following function on the Cartan subalgebra with…
We introduce interpolation analogues of Schur Q-functions - the multiparameter Schur Q-functions. We obtain for them several results: a combinatorial formula, generating functions for one-row and two-rows functions, vanishing and…
We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.
For a linear ODE with indeterminate coefficients, we explicitly exhibit a fundamental system of solutions, in terms of the coefficients. We show that the generalized Wronskians of the fundamental system are given by an action of the Schur…
We give expansions of reproducing kernels of the Christoffel-Darboux type in terms of Schur polynomials. For this, we use evaluations of averages of characteristic polynomials and Schur polynomials in random matrix ensembles. We explicitly…
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…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
We explain how genomic tableaux [Pechenik-Yong '15] are a semistandard complement to increasing tableaux [Thomas-Yong '09]. From this perspective, one inherits genomic versions of jeu de taquin, Knuth equivalence, infusion and Bender-Knuth…
Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…
We recently generalised the lattice permutation condition for Young tableaux to Kronecker tableaux and hence calculated a large new class of stable Kronecker coefficients labelled by co-Pieri triples. In this extended abstract we discuss…
The celebrated Robinson-Schensted algorithm and each of its variants that have attracted substantial attention can be constructed using Fomin's "growth diagram" construction from a modular lattice that is also a weighted-differential poset.…
We show that sequences of skew Schur polynomials obtained from stretched semi-standard Young tableaux satisfy a linear recurrence, which we give explicitly. Using this, we apply this to finding certain asymptotic behavior of these Schur…
Petrie symmetric functions $G(k,n)$, also known as truncated homogeneous symmetric functions or modular complete symmetric functions, form a class of symmetric functions interpolating between the elementary symmetric functions $e_n$ and the…