Related papers: Colorful combinatorics and Macdonald polynomials
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…
The ring of symmetric functions $\Lambda$, 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…
The charge is an intricate statistic on words, due to Lascoux and Schutzenberger, which gives positive combinatorial formulas for Lusztig's q-analogue of weight multiplicities and the energy function on affine crystals, both of type A. As…
Interpolation polynomials were introduced by Knop--Sahi in type $A$, and Okounkov in type $BC$. They are inhomogeneous polynomials whose top terms are Jack and Macdonald polynomials. Thus the expansion coefficients for the product of two…
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t) =…
George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…
For any unbranched double covering of compact Riemann surfaces, we study the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We introduce $k>0$…
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…
Three decades ago, Stanley and Brenti initiated the study of the Kazhdan--Lusztig--Stanley (KLS) functions, putting on common ground several polynomials appearing in algebraic combinatorics, discrete geometry, and representation theory. In…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics.…
A famous and wide-open problem, going back to at least the early 1970's, concerns the classification of chromatic polynomials of graphs. Toward this classification problem, one may ask for necessary inequalities among the coefficients of a…
We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials,…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
We characterize the $k$-Schur functions as the graded characters of simple objects in an additive module category. This confirms a set of conjectures formulated in the Ph.D. thesis of Chen, written under the direction of Mark Haiman, and…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…
The characters of Kazhdan--Lusztig elements of the Hecke algebra over $S_n$ (and in particular, the chromatic symmetric function of indifference graphs) are completely encoded in the (intersection) cohomology of certain subvarieties of the…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…