相关论文: Combinatorial proof of the skew K-saturation theor…

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

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…

In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…

Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…

If $[\lambda(j)]$ is a multipartition of the positive integer $n$ (a sequence of partitions with total size $n$), and $\mu$ is a partition of $n$, we study the number $K_{[\lambda(j)]\mu}$ of sequences of semistandard Young tableaux of…

In this paper, we investigate the combinatorial structure and asymptotic distribution of the solution set of the equation $\sigma(n+1) = k\sigma(n)$ for a given integer $k>1$. From a combinatorial perspective, the solutions to this equation…

Kerov's polynomials give irreducible character values in term of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method,…

Kostka functions $K^{\pm}_{\lambda, \mu}(t)$ associated to complex reflection groups are a generalization of Kostka polynomials, which are indexed by a pair $\lambda, \mu$ of $r$-partitions and a sign $+, -$. It is expected that there…

Set-valued tableaux play an important role in combinatorial $K$-theory. Separately, semistandard skyline fillings are a combinatorial model for Demazure atoms and key polynomials. We unify these two concepts by defining a set-valued…

We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…

Kostka-Foulkes polynomials are Lusztig's $q$-analogues of weight multiplicities for irreducible representations of semisimple Lie algebras. It has long been known that these polynomials have non-negative coefficients. A statistic on…

Egecioglu and Remmel gave an interpretation for the entries of the inverse Kostka matrix K^{-1} in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK^{-1}=I but were unable to…

The number of standard Young tableaux of a skew shape $\lambda/\mu$ can be computed as a sum over excited diagrams inside $\lambda$. Excited diagrams are in bijection with certain lozenge tilings, with flagged semistandard tableaux and also…

We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…

We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…

In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $\lambda>\mu\geq LS(\mathcal{K})$ and $\theta$ is a limit ordinal $<\lambda^+$. If…

The classical hook length formula of enumerative combinatorics expresses the number of standard Young tableaux of a given partition shape as a single fraction. In recent years, two generalizations of this formula have emerged: one by Pak…

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…

We give an elementary proof of a well-known result on Kostka numbers, following a question from Mark Wildon on MathOverflow. Namely, we show that given partitions $\lambda,\mu,\nu$ of $n$ with $\mu\trianglerighteq\nu$, we have…

In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…