We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations of Heisenberg algebras. The resulting framework that we describe is a generalization of the classical Boson-Fermion correspondence, from which Schur functions arise. Our work can be used to understand Hall-Littlewood polynomials, Macdonald polynomials and Lascoux, Leclerc and Thibon's ribbon functions, together with other new families of symmetric functions.
We connect twisted vertex operator presentation of Hall-Littlewood polynomials with the action of charged free fermions, describe a boson-fermion correspondence that relates twisted vertex operators with classical Heisenberg algebra. We also show that the elements of the orthogonal to Schur functions basis of the one-parameter deformation of the ring of symmetric functions $Λ[t]$ are $τ$-functions of KP hierarchy.
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and construct the wavefunctions and their duals. We prove the exact correspondence between the wavefunctions and symmetric polynomials which is a quantum group deformation of the Grothendieck polynomials. This is proved by combining the matrix product method and an analysis on the domain wall boundary partition functions. As applications of the correspondence betwe…
We resolve an open conjecture from algebraic geometry, which states that two generating functions for plane partition-like objects (the "box-counting" formulae for the Calabi-Yau topological vertices in Donaldson-Thomas theory and Pandharipande-Thomas theory) are equal up to a factor of MacMahon's generating function for plane partitions. The main tools in our proof are a Desnanot-Jacobi-type "condensation" identity, and a novel application of the tripartite double-dimer model of Kenyon-Wilson.
We introduce the notion of standard multipartitions and establish a one-to-one correspondence between standard multipartitions and irreducible representations with integral weights for the affine Hecke algebra of type A with a parameter q which is not a root of unity. We then extend the correspondence to all Kleshchev multipartitions for Ariki-Koike algebras of integral type. By the affine Schur--Weyl duality, we further extend this to a correspondence between standard multipartitions and Drinfeld multipolynomials of integral type whose associated irreducible polynomial representations complet…
In the aim to understand the generalization of Stirling numbers occurring in the bosonic normal ordering problem, several combinatorial models have been proposed. In particular, Blasiak \emph{et al.} defined combinatorial objects allowing to interpret the number of $S_{\bf{r,s}}(k)$ appearing in the identity $(a^†)^{r_n}a^{s_n}\cdots(a^†)^{r_1}a^{s_1}=(a^†)^α\displaystyle\sum S_{\bf{r,s}}(k)(a^†)^k a^k$, where $α$ is assumed to be non-negative. These objects are used to define a combinatorial Hopf algebra which specializes to the enveloping algebra of the Heisenberg Lie algebra. Here, we propo…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of Stirling and Bell numbers. The recurrence relations and closed-form expressions (Dobiski-type formulas) are obtained for these quantities by both algebraic and combinatorial methods. By extensive use of methods of combinatorial analysis we prove the equivalence of the aforementioned problem to the enumeration of special families of graphs. This link provides a co…
In this paper we study algebraic and combinatorial properties of Grothendieck polynomials and their dual polynomials by means of the Boson-Fermion correspondence. We show that these symmetric functions can be expressed as a vacuum expectation value of some operator that is written in terms of free-fermions. By using the free-fermionic expressions, we obtain alternative proofs of determinantal formulas and Pieri type formulas.
The wavefunction of the free-fermion six-vertex model was found to give a natural realization of the Tokuyama combinatorial formula for the Schur polynomials by Bump-Brubaker-Friedberg. Recently, we studied the correspondence between the dual version of the wavefunction and the Schur polynomials, which gave rise to another combinatorial formula. In this paper, we extend the analysis to the reflecting boundary condition, and show the exact correspondence between the dual wavefunction and the symplectic Schur functions. This gives a dual version of the integrable model realization of the symplec…
We construct and analyze a family of coherent states built on sequences of integers originating from the solution of the boson normal ordering problem. These sequences generalize the conventional combinatorial Bell numbers and are shown to be moments of positive functions. Consequently, the resulting coherent states automatically satisfy the resolution of unity condition. In addition they display such non-classical fluctuation properties as super-Poissonian statistics and squeezing.
We give a general expression for the normally ordered form of a function F(w(a,a*)) where w is a function of boson annihilation and creation operators satisfying [a,a*]=1. The expectation value of this expression in a coherent state becomes an exact generating function of Feynman-type graphs associated with the zero-dimensional Quantum Field Theory defined by F(w). This enables one to enumerate explicitly the graphs of given order in the realm of combinatorially defined sequences. We give several examples of the use of this technique, including the applications to Kerr-type and superfluidity-t…
Given a sequence of subsets A_n of {0,...,n-1}, the Furstenberg correspondence principle provides a shift-invariant measure on Cantor space that encodes combinatorial information about infinitely many of the A_n's. Here it is shown that this process can be inverted, so that for any such measure there are finite sets whose combinatorial properties approximate it arbitarily well. Moreover, we obtain an explicit upper bound on how large n has to be to obtain a sufficiently good approximation. As a consequence of the inversion theorem, we show that every computable invariant measure on Cantor spac…
Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specificall…
$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients which give the number of $k$-dimensional subspaces in $\mathbb{F}_{q}^{n}$. When $q$ goes to $1$, this reverts to the binomial coefficients which measure the number of $k$-sets in $\left [ n \right ]$. Dot-analogues of $q$-binomial coefficients were studied by Yoo (2019) in order to investigate combinatorics of quadratic spaces over finite fields. The number o…
We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling numbers enumerating partitions of a set. This framework reveals several inherent relations between ordering problems and combinatorial objects, and displays the analytical background to Wick's theorem. The methodology can be straightforwardly generalized from the simple example given herein to a wide class of operators.
We use Kang-Misra's combinatorial description of the crystal graphs for $U_{q}(G_{2})$ to introduce the plactic monoid for type $G_{2}$. Then we describe the corresponding insertion algorithm which yields a Schensted type correspondence. Next we give a simple algorithm for computing the canonical basis of any finite dimensional $U_{q}(G_{2})$-module.
The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that realizes combinatorially this identity. As a consequence we obtain an algorithm that to each minimal matrix associates a minimal component, with respect to the dominance order, in a Kronecker product, and a combinatorial description of the corresponding Kronecker coefficient in terms of minimal matrices and tableau insertion. Our bijection follows from a gener…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. Finally we show that a graphical representation of these combinatorial numbers leads to sets of model field theories, for which the graphs may be interpreted as Feynman diagrams corresponding to the bosons of the theory. The generating functions are the …
We review and present new studies on the relation between the partition functions of integrable lattice models and symmetric polynomials, and its combinatorial representation theory based on the correspondence, including our work. In particular, we examine the correspondence between the wavefunctions of the XXZ type, Felderhof type and the boson type integrable models and symmetric polynomials such as the Schur, Grothendieck and symplectic Schur functions. We also give a brief report of our work on generalizing the correspondence between the Felderhof models and factorial Schur and symplectic …
We study the Felderhof free-fermion six-vertex model, whose wavefunction recently turned out to possess rich combinatorial structure of the Schur polynomials. We investigate the dual version of the wavefunction in this paper, which seems to be a harder object to analyze. We evaluate the dual wavefunction in two ways. First, we give the exact correspondence between the dual wavefunction and the Schur polynomials, for which two proofs are given. Next, we make a microscopic analysis and express the dual wavefunction in terms of strict Gelfand-Tsetlin pattern. As a consequence of these two ways of…
The Kechris-Pestov-Todorcevic correspondence connects extreme amenability of non-Archimedean Polish groups with Ramsey properties of classes of finite structures. The purpose of the present paper is to recast it as one of the instances of a more general construction, allowing to show that Ramsey-type statements actually appear as natural combinatorial expressions of the existence of fixed points in certain compactifications of groups, and that similar correspondences in fact exist in various dynamical contexts.
The number of Monotone Triangles with bottom row k1 < k2 < ... < kn is given by a polynomial alpha(n; k1,...,kn) in n variables. The evaluation of this polynomial at weakly decreasing sequences k1 >= k2 >= ... >= kn turns out to be interpretable as signed enumeration of new combinatorial objects called Decreasing Monotone Triangles. There exist surprising connections between the two classes of objects -- in particular it is shown that alpha(n; 1,2,...,n) = alpha(2n; n,n,n-1,n-1,...,1,1). In perfect analogy to the correspondence between Monotone Triangles and Alternating Sign Matrices, the set …
We deduce decompositions of natural representations of general linear groups and symmetric groups from combinatorial bijections involving tableaux. These include some of Howe's dualities, Gelfand models, the Schur-Weyl decomposition of tensor space, and multiplicity-free decompositions indexed by threshold partitions.
We show that the geometric lifting of the RSK correspondence introduced by A.N. Kirillov (2001) is volume preserving with respect to a natural product measure on its domain, and that the integrand in Givental's integral formula for GL(n,R)-Whittaker functions arises naturally in this context. Apart from providing further evidence that Whittaker functions are the natural analogue of Schur polynomials in this setting, our results also provide a new `combinatorial' framework for the study of random polymers. When the input matrix consists of random inverse gamma distributed weights, the probabili…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition function, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. This in turn leads to a combinatorial graphical description, giving essentially Feynman-type graphs associated with the theory. We illustrate this me…
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they derived two alternating sums by algebraic means and asked for combinatorial proofs. In this note we provide such demonstrations making use of the Robinson-Schensted-Knuth correspondence between symmetric matrices and semi-standard Young Tableau. Additionally, we restate the proof of Brualdi and Ma's main result with this perspective which shortens the argument.
Let f be a function mapping an n dimensional vector space over GF(p) to GF(p). When p is 2, Bernasconi et al. have shown that there is a correspondence between certain properties of f (e.g., if it is bent) and properties of its associated Cayley graph. Analogously, but much earlier, Dillon showed that f is bent if and only if the "level curves" of f had certain combinatorial properties (again, only when p is 2). The attempt is to investigate an analogous theory when p is greater than 2 using the (apparently new) combinatorial concept of a weighted partial difference set. More precisely, we try…
We consider properties of the operators D(r,M)=a^r(a^†a)^M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a^†are boson annihilation and creation operators respectively, satisfying [a,a^†]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation which generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combina…
Pondering upon the grammatical labeling of 0-1-2 increasing plane trees, we come to the realization that the grammatical labels play a role as records of chopped off leaves of the original increasing binary trees. While such an understanding is purely psychological, it does give rise to an efficient apparatus to tackle the partial $γ$-positivity of the Eulearian polynomials on multiset Stirling permutations, as long as we bear in mind the combinatorial meanings of the labels $x$ and $y$ in the Gessel representation of a $k$-Stirling permutation by means of an increasing $(k+1)$-ary tree. More …
In a paper by Ghorpade and Raghavan, they provide an explicit combinatorial description of the Hilbert function of the tangent cone at any point on a Schubert variety in the symplectic Grassmannian, by giving a certain "degree-preserving" bijection between a set of monomials defined by an initial ideal and a "standard monomial basis". We prove here that this bijection is in fact a bounded RSK correspondence.
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are a pure combinatorial algorithm to describe the irreducible decomposition of the tensor product of two irreducible representations of the symmetric group, and new symmetry results on permutation enumeration with respect to descent sets.
We consider certain modules of the symmetric groups whose basis elements are called tabloids. Some of these modules are isomorphic to subspaces of the cohomology rings of subvarieties of flag varieties as modules of the symmetric groups. We give a combinatorial description for some weighted sums of their characters, i.e., we introduce combinatorial objects called $(ρ,\Ll)$-tabloids and rewrite weighted sums of characters as the numbers of these combinatorial objects. We also consider the meaning of these combinatorial objects, i.e., we construct a correspondence between $(ρ,\Ll)$-tabloids and …
We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions - in essence, a combinatorial field theory. We apply these techniques to some examples related to specific physical Hamiltonians.
