Related papers: Colorful combinatorics and Macdonald polynomials
Macdonald processes are measures on sequences of integer partitions built using the Cauchy summation identity for Macdonald symmetric functions. These measures are a useful tool to uncover the integrability of many probabilistic systems,…
We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
In 1980, Lusztig introduced the periodic Kazhdan-Lusztig polynomials, which are conjectured to have important information about the characters of irreducible modules of a reductive group over a field of positive characteristic, and also…
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…
Brundan and Kleshchev introduced graded decomposition numbers for representations of cyclotomic Hecke algebras of type $A$, which include group algebras of symmetric groups. Graded decomposition numbers are certain Laurent polynomials,…
We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of…
We present the first positive combinatorial rule for expanding the product of a permuted-basement Demazure atom and a Schur polynomial. Special cases of permuted-basement Demazure atoms include Demazure atoms and characters. These cases…
In the present paper, we provide a cohomology group as a categorification of the characteristic polynomial of matroids. The construction depends on the ``quasi-representation'' of a matroid. For a certain choice of the quasi-representation,…
A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for…
Our results can be viewed as applications of algebraic combinatorics in random matrix theory. These applications are motivated by the predictive power of random matrix theory for the statistical behavior of the celebrated Riemann…
We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…
We investigate the connections between various noncommutative analogues of Hall-Littlewood and Macdonald polynomials, and define some new families of noncommutative symmetric functions depending on two sequences of parameters.
The numerical Hilbert series combinatorics and the comodule Hilbert series combinatorics are introduced, and some applications are presented, including the MacMahon Master Theorem.
Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
We give an explicit, nonnegative formula for the expansion of nonsymmetric Macdonald polynomials specialized at $t=0$ in terms of Demazure characters. Our formula results from constructing Demazure crystals whose characters are the…
We prove certain duality properties and present recurrence relations for a four-parameter family of self-dual Koornwinder-Macdonald polynomials. The recurrence relations are used to verify Macdonald's normalization conjectures for these…