Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by Frame, Robinson and Thrall. We present a generalization of the determinant formula for semistandard Young tableaux of given shape and of given content. Our counting formula -- though not a determinant -- is a generalization of the determinant formula by Frobenius and Young.
We obtain an explicit combinatorial formula for certain parabolic Kostka-Shoji polynomials associated with the cyclic quiver, generalizing results of Shoji and of Liu and Shoji.
An iterative formula for the Kostka-Foulkes polynomials is given using the vertex operator realization of the Hall-Littlewood polynomials. The operational formula can handle large Kostka-Foulkes polynomials, and a stability property for the Kostka-Foulkes polynomials is shown. We also use our algorithm to give a formula of $K_{λμ}(t)$ for $μ$ being hook-shaped.
We provide a type-uniform formula for the degree of the stretched Kostka quasi-polynomial $K_{λ,μ}(N)$ in all classical types, improving a previous result by McAllister in $\mathfrak{sl}_r(\mathbb{C})$. Our proof relies on a combinatorial model for the weight multiplicity by Berenstein and Zelevinsky.
We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing cocyclage in terms of which the conjecture is described. Our algorithm is free of local constraints, which were the main obstacle in Lecouvey's original construction. In particular, we show that our model is governed by the situation in type A. This approach works for arbitrary weight and we expect it to lead to a proof of the conjecture in full generality.
Littlewood-Richardson (LR) coefficients and Kostka Numbers appear in representation theory and combinatorics related to $GL_n$. It is known that Kostka numbers can be represented as special Littlewood-Rischardson coefficient. In this paper, we show how one can represent LR coefficient as a signed sum of Kostka numbers, and use the formulation to give a polynomial time algorithm for the same, hence showing that they belong to the same class of decision problems. As a corollary, we will prove Steinberg's formula using Kostant's partition function.
We use Kashiwara-Nakashima's combinatorics of crystal graphs associated to the roots sytems $B_{n}$ and $D_{n}$ to extend the results of \QCITE{cite}{}{lec3} and \QCITE{cite}{}{Mor} by showing that Morris type recurrence formulas also exist for the orthogonal root systems. We derive from these formulas a statistic on Kashiwara-Nakashima's tableaux of types $B_{n},C_{n}$ and $D_{n}$ generalizing Lascoux-Sch\UNICODE{0xfc}tzenberger's charge and from which it is possible to compute the Kostka-Foulkes polynomials $K_{λ,μ}(q)$ with restrictive conditions on $(λ,μ)$ . This statistic is different fro…
The problem of finding fermionic formulas for the many generalizations of Kostka polynomials and for the characters of conformal field theories has been a very exciting research topic for the last few decades. In this dissertation we present new fermionic formulas for the unrestricted Kostka polynomials extending the work of Kirillov and Reshetikhin. We also present new fermionic formulas for the characters of N=1 and N=2 superconformal algebras which extend the work of Berkovich, McCoy and Schilling. Fermionic formulas for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ in the cas…
We show that certain weighted average of the alpha-determinant of a $kn$ by $kn$ matrix of the form $A\otimes1_{1,k}$, the Kronecker product of a $kn$ by $n$ matrix $A$ and $1$ by $k$ all one matrix $1_{1,k}$, over permutations of $kn$ letters is reduced to the $k$-wreath determinant of $A$ up to constant. The constant is exactly given by the modified content polynomial for the Young diagram $(k^n)$. As a corollary, we give a `determinantal' formula for certain functions on the symmetric groups which are invariant under the left and right translation by a Young subgroup, especially the values …
We present both a combinatorial characterization and a recurrent formula for the entries of the inverse Kostka matrix. An application to the topology of the classifying space BU(n) is obtained.
A new fermionic formula for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ is presented. This formula is different from the one given by Hatayama et al. and is valid for all crystal paths based on Kirillov-Reshetihkin modules, not just for the symmetric and anti-symmetric case. The fermionic formula can be interpreted in terms of a new set of unrestricted rigged configurations. For the proof a statistics preserving bijection from this new set of unrestricted rigged configurations to the set of unrestricted crystal paths is given which generalizes a bijection of Kirillov and Reshet…
Level-restricted paths play an important role in crystal theory. They correspond to certain highest weight vectors of modules of quantum affine algebras. We show that the recently established bijection between Littlewood--Richardson tableaux and rigged configurations is well-behaved with respect to level-restriction and give an explicit characterization of level-restricted rigged configurations. As a consequence a new general fermionic formula for the level-restricted generalized Kostka polynomial is obtained. Some coset branching functions of type $A$ are computed by taking limits of these fe…
We study two different one-parameter generalizations of Littlewood--Richardson coefficients, namely Hall polynomials and generalized inverse Kostka polynomials, and derive new combinatorial formulae for them. Our combinatorial expressions are closely related to puzzles, originally introduced by Knutson and Tao in their work on the equivariant cohomology of the Grassmannian.
In this paper, we continue our study of the Hilbert polynomials of coinvariants begun in our previous work math.QA/0205324 (paper I). We describe the sl_n-fusion products for symmetric tensor representations following the method of Feigin and Feigin, and show that their Hilbert polynomials are A_{n-1}-supernomials. We identify the fusion product of arbitrary irreducible sl_n-modules with the fusion product of their resctriction to sl_{n-1}. Then using the equivalence theorem from paper I and the results above for sl_3, we give a fermionic formula for the Hilbert polynomials of a class of affin…
We establish a Morris type recurrence formula for the root system $C_{n}$.\ Next we introduce cyclage graphs for the corresponding Kashiwara-Nakashima's tableaux and use them to define a charge statistic. Finally we conjecture that this charge may be used to compute the Kostka-Foulkes polynomials for type $C_{n}.$
We present two symmetric function operators $H_3^{qt}$ and $H_4^{qt}$ that have the property $H_{3}^{qt} H_{(2^a1^b)}[X;q,t] = H_{(32^a1^b)}[X;q,t]$ and $H_4^{qt} H_{(2^a1^b)}[X;q,t] = H_{(42^a1^b)}[X;q,t]$. These operators are generalizations of the analogous operator $H_2^{qt}$ and also have expressions in terms of Hall-Littlewood vertex operators. We also discuss statistics, $a_μ(T)$ and $b_μ(T)$, on standard tableaux such that the $q,t$ Kostka polynomials are given by the sum over standard tableaux of shape $\la$, $K_{\laμ}(q,t) = \sum_T t^{a_μ(T)} q^{b_μ(T)}$ for the case when when $μ$ is…
We will look at the Catalan numbers from the {\it Rigged Configurations} point of view originated \cite{Kir} from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our strategy is to take a combinatorial interpretation of Catalan numbers $C_n$ as the number of standard Young tableaux of rectangular shape $(n^2)$, or equivalently, as the Kostka number $K_{(n^2),1^{2n}}$, as the starting point of research. We observe that the rectangular (or multidimensional) Catalan numbers $ C(m,n)$ introduced and studied by P. MacMahon \cit…
We take an elementary approach to derive a generalization of Kunth's formula using Lassalle's explicit formula. In particular, we give a formula for the Kostka numbers of a shape $μ\vdash n$ and weight $(m,1^{n-m})$ for $m=3,\;4$.
We show that the Galois group of any Schubert problem involving lines in projective space contains the alternating group. This constitutes the largest family of enumerative problems whose Galois groups have been largely determined. Using a criterion of Vakil and a special position argument due to Schubert, our result follows from a particular inequality among Kostka numbers of two-rowed tableaux. In most cases, a combinatorial injection proves the inequality. For the remaining cases, we use the Weyl integral formula to obtain an integral formula for these Kostka numbers. This rewrites the ineq…
A combinatorial proof of the unimodality of the generalized q-Gaussian coefficients based on the explicit formula for Kostka-Foulkes polynomials is given.
We interpret a formula established by Lapid-M\'ınguez on real regular representations of ${\rm GL}_n$ over a local non-archimedean field as a matrix determinant. We use the Lewis Carroll determinant identity to prove new relations between real regular representations. Through quantum affine Schur-Weyl duality, these relations generalize Mukhin-Young's Extended $T$-systems, for representations of the quantum affine algebra $U_q(\widehat{\mathfrak{sl}}_k)$, which are themselves generalizations of the celebrated $T$-system relations.
This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.
We propose a new formula to compute Witten--Kontsevich intersection numbers. It is a closed formula, not involving recursion neither solving equations. It only involves sums over partitions of products of factorials, double factorials and Kostka numbers (numbers of semi-standard tableau of given shape and weight) with bounded weights. As an application, we prove a conjecture of [ELO21] stating that the generating polynomials of the intersection numbers expressed in the basis of elementary symmetric polynomials have an unexpected vanishing of their coefficients.
We give a simple proof of a major index determinant formula in the symmetric group discovered by Krattenthaler and first proved by Thibon using noncommutative symmetric functions. We do so by proving a factorization of an element in the group ring of the symmetric group. By applying similar methods to the groups of signed permutations and colored permutations, we prove determinant formulas in these groups as conjectured by Krattenthaler.
In this paper we prove a homogenous generalization of the lambda determinant formula of Mills, Robbins and Rumsey. In our formula the parameters depends on two indices. Our result also extends a recent formula of Di Francesco.
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…
In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindström-Gessel-Viennot interpretation of semistandard Young tableaux and the Jacobi-Trudi identity together with elementary observations. After some preparations, this point of view provides very simple "graphical proofs" for classical determinantal identities like the Cauchy--Binet formula, Dodgson's condensation formula, the Plücker relations and Laplace's expansion. Also, a determinantal identity generalizing Dodgson's condensation formula is presented, which m…
We prove a formula which generalizes both Onn's colorful determinantal formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove some results similar in spirit to the statement of Rota's basis conjecture. We prove such a result using Svrtan's $n!$ formula, generalizing one of Svrtan's arguments to a combinatorial setting.
Using the expansion of the inverse of the Kostka matrix in terms of tabloids as presented by Egecioglu and Remmel, we show that the fusion coefficients can be expressed as an alternating sum over cylindric tableaux. Cylindric tableaux are skew tableaux with a certain cyclic symmetry. When the skew shape of the tableau has a cutting point, meaning that the cylindric skew shape is not connected, or if its weight has at most two parts, we give a positive combinatorial formula for the fusion coefficients. The proof uses a slight modification of a sign-reversing involution introduced by Remmel and …
We give an algebraic proof of the determinant formulas for factorial Grothendieck polynomials obtained by Hudson--Ikeda--Matsumura--Naruse and by Hudson--Matsumura.
From a transfer formula in multivariate finite operator calculus, comes an expansion for the determinant similar to Ryser's formula for the permanent. Although this one contains many more terms than the usual determinant formula. To prove it, we consider the poset of ordered partitions, properties of the permutahedron, and some good old fashioned combinatorial techniques.
We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several tableau formulas for difference operators in Types A and C, as well as other operators that appear in the "enriched", or "back-stable" Schubert polynomials. There are also tableau formulas for the enriched Schubert polynomials for vexillary and $321$-avoiding permutations.
Recently, Bieñ [A. Bieñ, The problem of singularity for planar grids, Discrete Math. 311 (2011), 921--931] obtained a recursive formula for the determinant of a grid. Also, recently, Pragel [D. Pragel, Determinants of box products of paths, Discrete Math. 312 (2012), 1844--1847], independently, obtained an explicit formula for this determinant. In this paper, we give a short proof for this problem. Furthermore, applying the same technique, we get explicit formulas for the determinant of a torus, a cylinder, and a Möbius ladder.
We use the Jacobi-Trudi formula to execute "explicit" evaluation of determinants of Stirling numbers of both kinds. We also offer a Maple package accompanying the paper on the personal websites at the end of the second page.
We give alternative proofs to (block case versions of) some formulas for Toeplitz and Fredholm determinants established recently by the authors of the title. Our proof of the Borodin-Okounkov formula is very short and direct. The proof of the Baik-Deift-Rains formulas is based on standard manipulations with Wiener-Hopf factorizations.
A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices, with sign patterns as an important special case. A number of corollaries and applications of this formula are given.
We present determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.
We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in the eigenvalues of the adjacency operator of the graph.
In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, which is believed to be new. The evaluating formula is proved by showing that the determinant coincides with the number of lattice paths with (1,0), (0,1)-steps in the plane that stay below a boundary line of rational slope.
Chen et al. recently established bijections for $(d+1)$-noncrossing/ nonnesting matchings, oscillating tableaux of bounded height $d$, and oscillating lattice walks in the $d$-dimensional Weyl chamber. Stanley asked what is the total number of such tableaux of length $n$ and of any shape. We find a determinant formula for the exponential generating function. The same idea applies to prove Gessel's remarkable determinant formula for permutations with bounded length of increasing subsequences. We also give short algebraic derivations for some results of the reflection principle.
Let $p_n(x)$, $n=0,1,\dots$, be the orthogonal polynomials with respect to a given density $dμ(x)$. Furthermore, let $dν(x)$ be a density which arises from $dμ(x)$ by multiplication by a rational function in $x$. We prove a formula that expresses the Hankel determinants of moments of $dν(x)$ in terms of a determinant involving the orthogonal polynomials $p_n(x)$ and associated functions $q_n(x)=\int p_n(u) \,dμ(u)/(x-u)$. Uvarov's formula for the orthogonal polynomials with respect to $dν(x)$ is a corollary of our theorem. Our result generalises a Hankel determinant formula for the case where …
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the determinant is the alternating sum of the number of quasi-trees of genus j of the dessin of a non-alternating link. Furthermore, we obtain formulas for other link invariants by counting quantities on dessins. In particular we will show that the $j$-th coefficient of the Jones polynomial is given by sub-dessins of genus less or equal to $j$.
Since every even power of the Vandermonde determinant is a symmetric polynomial, we want to understand its decomposition in terms of the basis of Schur functions. We investigate several combinatorial properties of the coefficients in the decomposition. In particular, we give recursive formulas for the coefficient of the Schur function $s_{\m}$ in the decomposition of an even power of the Vandermonde determinant in $n + 1$ variables in terms of the coefficient of the Schur function $s_ł$ in the decomposition of the same even power of the Vandermonde determinant in $n$ variables if the Young dia…
