We give another proof for the (-1)-enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley's proof for the ordinary enumeration. In addition, we obtain enumerations of 180-degree symmetric rhombus tilings of hexagons with a barrier of arbitrary length along the central line.
We prove a determinantal identity concerning Schur functions for 2-staircase diagrams lambda=(ln+l',ln,l(n-1)+l',l(n-1),...,l+l',l,l',0). When l=1 and l'=0 these functions are related to the partition function of the 6-vertex model at the combinatorial point and hence to enumerations of Alternating Sign Matrices. A consequence of our result is an identity concerning the doubly-refined enumerations of Alternating Sign Matrices.
Any Schur ring is uniquely determined by a partition of the elements of the group. In this paper we present a general technique for enumerating Schur rings over cyclic groups using traditional Schur rings. We also survey recent efforts to enumerate Schur rings over cyclic groups of specific orders.
We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic hypergeometric series, and as determinants and pfaffians of continuous q-ultraspherical or continuous q-Jacobi polynomials. As special cases, we obtain simple closed formulas for staircase-type partitions.
The Alladi-Gordon identity plays an important role for the Alladi-Gordon generalization of Schur's partition theorem. By using Joichi-Stanton's insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key identity. Based on this interpretation, we further obtain a combinatorial proof of the Alladi-Gordon key identity by establishing an involution on the underlying set of overpartitions.
In this work, we establish a general relationship between the enumeration of weighted directed paths and skew Schur functions, extending work by Bousquet-Mélou, who expressed generating functions of discrete excursions in terms of rectangular Schur functions.
We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified according to their parities or values mod 3 are also considered. Direct combinatorial interpretations of the series are provided.
A recent paper of Bump, McNamara and Nakasuji introduced a factorial version of Tokuyama's identity, expressing the partition function of a six vertex model as the product of a t-deformed Vandermonde and a Schur function. Here we provide an extension of their result by exploiting the language of primed shifted tableaux, with its proof based on the use of non-intersecting lattice paths.
In the literature there are several determinant formulas for Schur functions: the Jacobi-Trudi formula, the dual Jacobi-Trudi formula, the Giambelli formula, the Lascoux-Pragacz formula, and the Hamel-Goulden formula, where the Hamel-Goulden formula implies the others. In this paper we use an identity proved by Bazin in 1851 to derive determinant identities involving Macdonald's 9th variation of Schur functions. As an application we prove a determinant identity for factorial Schur functions conjectured by Morales, Pak, and Panova. We also obtain a generalization of the Hamel-Goulden formula, w…
We present some corollaries to a symplectic primed shifted tableaux version of Tokuyama's identity expressed in terms of other combinatorial constructs, namely generalised $U$-turn alternating sign matrices and strict symplectic Gelfand-Tsetlin patterns.
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.
In this article, we use Lindström Gessel Viennot Lemma to give a short, combinatorial, visualizable proof of the identity of Schur polynomials -- the sum of monomials of Young tableaux equals to the quotient of determinants. As a by-product, we have a proof of Vandermonde determinant without words. We also prove the cauchy identity. In the remarks, we discuss factorial Schur polynomials, dual Cauchy identity and the relation beteen Newton interpolation formula.
Gurevich, Pyatov and Saponov recently stated an expansion for the product of two Schur functions and gave a proof based on the Pluecker relations. Here we show that this identity is in fact a special case of a quite general Schur function identity, which was stated and proved in a paper by Fulmek and Kleber, where it was used to prove bijectively Dodgsons condensation formula and the Pluecker relations, but was not paid further attention: So we take the opportunity to make obvious the range of applicability of this identity by giving concrete examples, accompanied by many graphical illustratio…
We present a Pfaffian identity involving elliptic functions, whose rational limit gives a generalization of Schur's Pfaffian identity for Pf ((x_j - x_i)/(x_j + x_i)). This identity is regarded as a Pfaffian counterpart of Frobenius identity, which is an elliptic generalization of Cauchy's determinant identity for det (1/ (x_i + x_j)).
We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kurşungöz. We also present some related polynomial and $q$-series identities.
We compute the number of perfect matchings of an $M\times N$ Aztec rectangle where $|N-M|$ vertices have been removed along a line. A particular case solves a problem posed by Propp. Our enumeration results follow from certain identities for Schur functions, which are established by the combinatorics of nonintersecting lattice paths.
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 Schur's skew $Q$-functions.
We present a ``method'' for bijective proofs for determinant identities, which is based on translating determinants to Schur functions by the Jacobi--Trudi identity. We illustrate this ``method'' by generalizing a bijective construction (which was first used by Goulden) to a class of Schur function identities, from which we shall obtain bijective proofs for Dodgson's condensation formula, Plücker relations and a recent identity of the second author.
Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. As in the reverse plane partition case, the right hand side of this identity admits a simple factorization form in terms of the "hook lengths" of the individual boxes in the underlying shape. The main result of this paper is a new bijective proof of Borodin's identity which makes use of Fomin's growth diagram framework for generalized RSK correspondences.
Gustafson and Milne proved an identity on the Schur function indexed by a partition of the form $(λ_1-n+k,λ_2-n+k,\ldots,λ_k-n+k)$. On the other hand, Fehér, Némethi and Rimányi found an identity on the Schur function indexed by a partition of the form $(m-k,\ldots,m-k, λ_1,\ldots,λ_k)$. Fehér, Némethi and Rimányi gave a geometric explanation of their identity, and they raised the question of finding a combinatorial proof. In this paper, we establish a Gustafson-Milne type identity as well as a Fehér-Némethi-Rimányi type identity for factorial Grothendieck polynomials. Specializing a factorial…
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 introduced by Hamel and Goulden and are used to give an identity for the skew Schur function that unifies the determinantal expressions for the skew Schur functions including the Jacobi-Trudi determinant, its dual, the Giambelli determinant and the rim ribbon determinant due to Lascoux and Pragacz. Using cutting strips, one obtains a formula for the number of outside…
We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.
Our results revolve around a new operation on partitions, which we call overlap. We prove two overlap identities for so-called Littlewood-Schur functions. Littlewood-Schur functions are a generalization of Schur functions, whose study was introduced by Littlewood. More concretely, the Littlewood-Schur function $LS_λ(X; Y)$ indexed by the partition $λ$ is a polynomial in the variables $X \cup Y$ that is symmetric in both $X$ and $Y$ separately. The first overlap identity represents $LS _λ(X; Y)$ as a sum over subsets of $X$, while the second overlap identity essentially represents $LS_λ(X; Y)$ …
Recently Okada defined algebraically ninth variation skew Q-functions, in parallel to Macdonald's ninth variation skew Schur functions. Here we introduce a skew shifted tableaux definition of these ninth variation skew Q-functions, and prove by means of a non-intersecting lattice path model a Pfaffian outside decomposition result in the form of a ninth variation version of Hamel's Pfaffian outside decomposition identity. As corollaries to this we derive Pfaffian identities generalizing those of Josefiak-Pragacz, Nimmo, and most recently Okada. As a preamble to this we present a parallel develo…
We give bijective proofs of orthosymplectic analogues of the Cauchy identity and dual Cauchy identity for orthosymplectic Schur functions. To do so, we present two insertion algorithms; these are orthosymplectic versions of Berele's symplectic insertion algorithms, which were used by Sundaram to give bijective proofs of Cauchy identities for symplectic Schur functions.
We consider the problem of determining when the difference of two ribbon Schur functions is a single Schur function. We fully classify the five infinite families of pairs of ribbon Schur functions whose difference is a single Schur function with corresponding partition having at most two parts at least $2$. We also prove an identity for differences of ribbon Schur functions and we determine some necessary conditions for such a difference to be Schur-positive, depending on the distribution of $1$'s and the end row lengths.
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 study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating functions are similar to classical MacMahon's formulas; one of these statistics is equidistributed with the usual volume. We also show natural connections with the longest increasing subsequences of words.
A group valued function on a graph is called balanced if the product of its values along any cycle is equal to the identity element of the group. We compute the number of balanced functions from edges and vertices of a directed graph to a finite group.
We introduce and study a generalization of Schur's $P$-/$Q$-functions associated to a polynomial sequence, which can be viewed as ``Macdonald's ninth variation'' for $P$-/$Q$-functions. This variation includes as special cases Schur's $P$-/$Q$-functions, Ivanov's factorial $P$-/$Q$-functions and the $t=-1$ specialization of Hall--Littlewood functions associated to the classical root systems. We establish several identities and properties such as generalizations of Schur's original definition of Schur's $Q$-functions, Cauchy-type identity, Józefiak--Pragacz--Nimmo formula for skew $Q$-functions…
Grassmann (or anti-commuting) variables are extensively used in theoretical physics. In this paper we use Grassmann variable calculus to give new proofs of celebrated combinatorial identities such as the Lindström-Gessel-Viennot formula for graphs with cycles and the Jacobi-Trudi identity. Moreover, we define a one parameter extension of Schur polynomials that obey a natural convolution identity.
The classical Peter-Weyl theorem describes the structure of the space of functions on a semi-simple algebraic group. On the level of characters (in type A) this boils down to the Cauchy identity for the products of Schur polynomials. We formulate and prove the analogue of the Peter-Weyl theorem for the current groups. In particular, in type A the corresponding characters identity is governed by the Cauchy identity for the products of q-Whittaker functions. We also formulate and prove a version of the Schur-Weyl theorem for current groups. The link between the Peter-Weyl and Schur-Weyl theorems…
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 N{ä}gelsbach-Kostka) identity, their proofs using the correspondence with lattice paths of Gessel and Viennot, and finally the Littlewood-Richardson rule. Our our goal is to show that the mentioned statements are closely related, and can be proved using variations of the same basic technique. We also want to emphasise the central part that is played by matrices o…
We continue to investigate the properties of the earlier defined functions fm and gm, which depend on an initial arithmetic function f0. In this papers values of f0 are the Fine numbers. We investigate functions fi; gi; (i = 1; 2; 3; 4). For each function, we derive an explicit formula and give a combinatorial interpretation. It appears that g2 and g3 are well-known combinatoric object called the Catalan triangles. We finish with an identity consisting of ten items.
We give yet-another illustration of using Herb Wilf's Snake Oil Method, by proving a certain identity between the entries of the so-called Motzkin Triangle, that arose in a recent study of enumeration of certain classes of integer partitions. We also briefly illustrate how this method can be applied to general `triangles'.
Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. The first result of this paper is a $(q,t)$-analog of Borodin's identity which extends previous work by Okada in the reverse plane partition case. Our proof uses commutation relations for $(q,t)$-vertex operators acting on Macdonald polynomials as given by Garsia, Haiman and Tesla. The second result of this paper is an explicit combinatorial interpreation of the $(q,t)$-Macdonald weight in term…
This paper deals with decreasing operators on back stable Schubert polynomials. We study two operators $ξ$ and $\nabla$ of degree $-1$, which satisfy the Leibniz rule. Furthermore, we show that all other such operators are linear combinations of $ξ$ and $\nabla$. For the case of Schur functions, these two operators fully determine the product of Schur functions, i.e., it is possible to define the Littlewood-Richardson coefficients only from $ξ$ and $\nabla$. This new point of view on Schur functions gives us an elementary proof of the Giambelli identity and of Jacobi-Trudi identities. For the …
The double Schur functions form a distinguished basis of the ring Λ(x||a) which is a multiparameter generalization of the ring of symmetric functions Λ(x). The canonical comultiplication on Λ(x) is extended to Λ(x||a) in a natural way so that the double power sums symmetric functions are primitive elements. We calculate the dual Littlewood-Richardson coefficients in two different ways thus providing comultiplication rules for the double Schur functions. We also prove multiparameter analogues of the Cauchy identity. A new family of Schur type functions plays the role of a dual object in the ide…
An identity is derived expressing Schur functions as sums over products of pairs of Schur $Q$-functions, generalizing previously known special cases. This is shown to follow from their representations as vacuum expectation values (VEV's) of products of either charged or neutral fermionic creation and annihilation operators, Wick's theorem and a factorization identity for VEV's of products of two mutually anticommuting sets of neutral fermionic operators.
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher label. This solves a problem posed by Shin and Zeng in a recent article. We also provide a generalization of this identity that translates to a formula for the number of rooted spanning forests with given indegree sequence.
The determinantal identities of Hamel and Goulden have recently been shown to apply to a tableau-based ninth variation of skew Schur functions. Here we extend this approach and its results to the analogous tableau-based ninth variation of supersymmetric skew Schur functions. These tableaux are built on entries taken from an alphabet of unprimed and primed numbers and that may be ordered in a myriad of different ways, each leading to a determinantal identity. At the level of the ninth variation the corresponding determinantal identities are all distinct but the original notion of supersymmetry …
We obtain a new expression for the partition function of the 8VSOS model with domain wall boundary conditions, which we consider to be the natural extension of the Izergin-Korepin formula for the six-vertex model. As applications, we find dynamical (in the sense of the dynamical Yang-Baxter equation) generalizations of the enumeration and 2-enumeration of alternating sign matrices. The dynamical enumeration has a nice interpretation in terms of three-colourings of the square lattice.
We use Young's raising operators to derive a Pieri rule for the ring generated by the indeterminates $h_{r,s}$ given in Macdonald's 9th Variation of the Schur functions. Under an appropriate specialisation of $h_{r,s}$, we derive the Pieri rule for the ring $\La(a)$ of double symmetric functions, which has a basis consisting of the double Schur functions. Together with a suitable interpretation of the Jacobi--Trudi identity, our Pieri rule allows us to obtain a new proof of a rule to calculate the Littlewood--Richardson polynomials, which gives a multiplication rule for the double Schur functi…
Polya's fundamental enumeration theorem is generalized in terms of Schur-Macdonald's theory (S-MT) of invariant matrices. Given a permutation group $W\leq S_d$ and a one-dimensional character $χ$ of $W$, the polynomial functor $F_χ$ corresponding via S-MT to the induced monomial representation $U_χ= ind_W^{S_d}(χ)$ of $S_d$, is studied. It turns out that the characteristic $ch(F_χ)$ is the weighted inventory of some set $J(χ)$ of $W$-orbits in the integer-valued hypercube $[0,\infty)^d$. The elements of $J(χ) can be distinguished among all $W$-orbits by a maximum property. The identity $ch(F_χ…
We give an interpretation of the boson-fermion correspondence as a direct consequence of Jacobi-Trudi identity. This viewpoint enables us to construct from a generalized version of the Jacobi-Trudi identity the action of Clifford algebra on polynomial algebras that arrives as analogues of the algebra of symmetric functions. A generalized Giambelli identity is also proved to follow from that identity. As applications, we obtain explicit formulas for vertex operators corresponding to characters of the classical Lie algebras, shifted Schur functions, and generalized Schur symmetric functions asso…
Plane partitions have been widely studied in Mathematics since MacMahon. See, for example, the works by Andrews, Macdonald, Stanley, Sagan and Krattenthaler. The Schur process approach, introduced by Okounkov and Reshetikhin, and further developed by Borodin, Corwin, Corteel, Savelief and Vuletić, has been proved to be a powerful tool in the study of various kinds of plane partitions. The exact enumerations of ordinary plane partitions, shifted plane partitions and cylindric partitions could be derived from two summation formulas for Schur processes, namely, the open summation formula and the …
In this paper, we extend recent results of Assaf and McNamara on skew Pieri rule and skew Murnaghan-Nakayama rule to a more general identity, which gives an elegant expansion of the product of a skew Schur function with a quantum power sum function in terms of skew Schur functions. We give two proofs, one completely bijective in the spirit of Assaf-McNamara's original proof, and one via Lam-Lauve-Sotille's skew Littlewood-Richardson rule. We end with some conjectures for skew rules for Hall-Littlewood polynomials.
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given starting point to a given end point evaluates to an elliptic generalization of the binomial coefficient. Convolution gives an identity equivalent to Frenkel and Turaev's 10-V-9 summation. This appears to be the first combinatorial proof of the latter, and at the same time of some important degenerate cases including Jackson's 8-phi-7 and Dougall's 7-F-6 summation.…
The ring of symmetric functions $Λ$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the symmetric group. One may define a coproduct on $Λ$ by the plethystic addition on alphabets. In this way the ring of symmetric functions becomes a Hopf algebra. The Littlewood--Richardson numbers may be viewed as the structure constants for the co-product in the Schur basis. In the first part of this thesis we show that by using a generalization of the classical umbral cal…
We evaluate the determinant $\det_{1\leq i,j\leq n}(\binom{x+y+j}{x-i+2j}-\binom{x+y+j}{x+i+2j})$, which gives the number of lozenge tilings of a hexagon with cut off corners. A particularly interesting feature of this evaluation is that it requires the proof of a certain hypergeometric identity which we accomplish by using Gosper's algorithm in a non-automatic fashion.
