Related papers: Bijective proofs for Schur function identities whi…
A series of bilinear identities on the Schur symmetric functions is obtained with the use of Pluecker relations.
We derive several identities involving Ikeda and Naruse's $K$-theoretic Schur $P$- and $Q$-functions. Our main result is a formula conjectured by Lewis and the second author which expands each $K$-theoretic Schur $Q$-function in terms of…
We use earlier defined notion of $n$- determinant to investigate sub-determinants of an extended Vandermonde matrix. Firstly, we demonstrate our method on a number of particular cases. Then we prove that all these results may be stated in…
We discuss several well known results about Schur functions that can be proved using cancellations in alternating summations; notably we shall discuss the Pieri and Murnaghan-Nakayama rules, the Jacobi-Trudi identity and its dual (Von…
Applying the theory of elliptic functions we establish two Jacobi theta function identities. From these identities we confirm two q-trigonometric identities conjectured by Gosper. As an application, we give a new and simple proof of a…
It was proved by Macdonald that the Giambelli identity holds if we define the Schur functions using the Jacobi-Trudi identity. Previously for the super Chern-Simons matrix model (the spherical one-point function of the superconformal…
By interpreting Kostka numbers as tensor product multiplicities in the BGG category O for the special linear Lie algebras, we provide a new proof of the classical Jacobi--Trudi identities for skew Schur polynomials, derived from the…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
We introduce the notion of the cutting strip of an outside decomposition of a skew shape, and show that cutting strips are in one-to-one correspondence with outside decompositions for a given skew shape. Outside decompositions are…
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direct bijections.
We prove a new determinantal formula for the characters of irreducible representations of orthosymplectic Lie superalgebras analogous to the formula developed by Moens and Jeugt (J. Algebraic Combin., 2003) for general linear Lie…
We prove new double summation hypergeometric $q$-series representations for several families of partitions, including those that appear in the famous product identities of G\"ollnitz, Gordon, and Schur. We give several different proofs for…
We obtain a common generalization of two types of Sylvester formulas for compound determinants and its Pfaffian analogue. As applications, we give generalizations of the Giambelli identity to skew Schur functions and the Schur identity to…
We prove new determinantal identities for a family of flagged Schur polynomials. As a corollary of these identities we obtain determinantal expressions of Schubert polynomials for certain vexillary permutations.
This paper gives a bijective proof of Andrews' refinement of the Alladi-Schur theorem. Moreover, it demonstrates that the bijective framework introduced here can be used to reproduce and provide a bijective account of Andrews' recursive…
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized…
We construct a vertex model whose partition function is a refined dual Grothendieck polynomial, where the states are interpreted as nonintersecting lattice paths. Using this, we show refined dual Grothendieck polynomials are multi-Schur…
We conjecture affine or Hall-Littlewood analogues of the dual Jacobi-Trudi formulas for orthogonal and symplectic Schur functions indexed by rectangular partitions of maximal height. These conjectures are then used to derive $t$-analogues…
We extend Agler's notion of a function algebra defined in terms of test functions to include products, in analogy with the practice in real algebraic geometry, and hence the term preordering in the title. This is done over abstract sets and…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…