Related papers: LLT cumulants and graph coloring
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…
In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…
Generalized Macdonald polynomials (GMP) are eigenfunctions of specifically-deformed Ruijsenaars Hamiltonians and are built as triangular polylinear combinations of Macdonald polynomials. They are orthogonal with respect to a modified scalar…
We provide a construction for the kromatic symmetric function $\overline{X}_G$ of a graph introduced by Crew, Pechenik, and Spirkl using combinatorial (linearly compact) Hopf algebras. As an application, we show that $\overline{X}_G$ has a…
In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…
Cylindric skew Schur functions, which are a generalisation of skew Schur functions, arise naturally in the study of P-partitions. Also, recent work of A. Postnikov shows they have a strong connection with a problem of considerable current…
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…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
We introduce the notion of coherent graphs, and show how those can be used to define dynamic semantics for Multiplicative Linear Logic (MLL) extended with non-determinism. Thanks to the use of a coherence relation rather than mere formal…
We propose a relationship between the cohomology of arithmetic groups, and the motivic cohomology of certain (Langlands-)attached motives. The motivic cohomology group in question is that related, by Beilinson's conjecture, to the adjoint…
Chen proposed a conjecture on the log-concavity of the generating function for the symmetric group with respect to the length of longest increasing subsequences of permutations. Motivated by Chen's log-concavity conjecture, B\'{o}na,…
We define a D_0 graph to be a graph whose vertex set is a subset of permutations of n, with edges of the form ...bac... <--> ...bca... or ...acb... <--> ...cab... (Knuth transformations), or ...bac... <--> ...acb... or ...bca... <-->…
In this paper, we study shifted Schur functions $S_\mu^\star$, as well as a new family of shifted symmetric functions $\mathfrak{K}_\mu$ linked to Kostka numbers. We prove that both are polynomials in multi-rectangular coordinates, with…
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…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a…
Let G be the group of points of a quasi-split reductive algebraic group over a local field F. It follows from the local Langlands conjectures that to every non-trivial additive character of F and every representation of the Langlands dual…
Macdonald polynomials are an important class of symmetric functions, with connections to many different fields. Etingof and Kirillov showed an intimate connection between these functions and representation theory: they proved that Macdonald…
We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
A new descent set statistic on involutions, defined geometrically via their interpretation as matchings, is introduced in this paper, and shown to be equi-distributed with the standard one. This concept is then applied to construct explicit…