Related papers: Colorful combinatorics and Macdonald polynomials
In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…
We use Rogers-Szego polynomials to unify some well-known identities for Hall-Littlewood symmetric functions due to Macdonald and Kawanaka.
Given a graph $G=(V,E)$ and a linear form $\lambda \in \mathbb{Z}_{ > 0 }^V$, Bajo et al. (2025) introduced the $q$-chromatic polynomial $\chi_G^\lambda(q,n) := \sum q^{\sum_{v \in V} \lambda_v c(v)}$ where the sum is over all proper…
We refine an idea of Deodhar, whose goal is a counting formula for Kazhdan-Lusztig polynomials. This is a consequence of a simple observation that one can use the solution of Soergel's conjecture to make ambiguities involved in defining…
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
Integer compositions with certain colored parts were introduced by Andrews in 2007 to address a number-theoretic problem. Integer compositions allowing zero as some parts were introduced by Ouvry and Polychronakos in 2019. We give a…
The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This…
In this PhD thesis we will discuss some aspects in Commutative Algebra which have interactions with Algebraic Geometry, Representation Theory and Combinatorics. In particular, in the first chapter we will focus on understanding when certain…
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…
We introduce the category of bicomodules for a comonad in a Grothendieck category whose underlying functor is right exact and preserves direct sums. We characterize comonads with a separable forgetful functor by means of cohomology groups…
Given a central integral arrangement, the reduction of the arrangement modulo positive integers $q$ gives rise to a subgroup arrangement in $(\mathbb{Z}/q\mathbb{Z})^\ell$. Kamiya-Takemura-Terao (2008) introduced the notion of…
The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric…
An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…
Kazhdan-Lusztig polynomials are important and mysterious objects in representation theory. Here we present a new formula for their computation for symmetric groups based on the Bruhat graph. Our approach suggests a solution to the…
There are representations of the type-A Hecke algebra on spaces of polynomials in anti-commuting variables. Luque and the author [S\'em. Lothar. Combin. 66 (2012), Art. B66b, 68 pages, arXiv:1106.0875] constructed nonsymmetric Macdonald…
We discuss semicanonical bases from the point of view of Cohomological Hall algebras via the "dimensional reduction" from 3-dimensional Calabi-Yau categories to 2-dimensional ones. Also, we discuss the notion of motivic Donaldson-Thomas…
We introduce a new operator $\Gamma$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron,…
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…
We introduce a new model of random multigraphs with colored vertices and weighted edges. It is similar to the "inhomogeneous random graph model" of S\"oderberg (2002), extended by Bollob\'as, Janson and Riordan (2007). By means of analytic…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…