English
Related papers

Related papers: A proof of the Stanley--Stembridge conjecture

200 papers

We show that the Stanley's Conjecture holds for an intersection of three monomial primary ideals of a polynomial algebra S over a field.

Commutative Algebra · Mathematics 2011-07-19 Andrei Zarojanu

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

These are (mostly) expository notes for lectures on affine Stanley symmetric functions given at the Fields Institute in 2010. We focus on the algebraic and combinatorial parts of the theory. The notes contain a number of exercises and open…

Combinatorics · Mathematics 2010-07-20 Thomas Lam

In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…

Combinatorics · Mathematics 2023-11-21 Martin Dzúrik

We obtain the Schur positivity of spider graphs of the forms $S(a,2,1)$ and $S(a,4,1)$, which are considered to have the simpliest structures for which the Schur positivity was unknown. The proof outline has four steps. First, we find…

Combinatorics · Mathematics 2023-05-16 Jean-Yves Thibon , David G. L. Wang

The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…

Dynamical Systems · Mathematics 2022-09-15 Theo Morrison

We study a $q$-version of the chromatic polynomial of a given graph $G=(V,E)$, namely, \[ \chi_G^\lambda(q,n) \ := \sum_{\substack{\text{proper colorings}\\ c\,:\,V\to[n]}} q^{ \sum_{ v \in V } \lambda_v c(v) }, \] where $\lambda \in…

Combinatorics · Mathematics 2026-03-02 Esme Bajo , Matthias Beck , Andrés R. Vindas-Meléndez

Egge, Loehr, and Warrington proved a formula for the Schur function expansion of a symmetric function in terms of its expansion in fundamental quasi-symmetric functions. Their formula involves the coefficients of a modified inverse Kostka…

Combinatorics · Mathematics 2019-12-25 Ira M. Gessel

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

Group Theory · Mathematics 2017-01-09 Florent Jouve , Jean-Sébastien Sereni

In this paper we prove an asymptotic multipartite version of a well-known theorem of K\"uhn and Osthus by establishing, for any graph $H$ with chromatic number $r$, the asymptotic multipartite minimum degree threshold which ensures that a…

Combinatorics · Mathematics 2017-07-17 Ryan R. Martin , Richard Mycroft , Jozef Skokan

This paper realizes of two families of combinatorial symmetric functions via the complex character theory of the finite general linear group $\mathrm{GL}_{n}(\mathbb{F}_{q})$: chromatic quasisymmetric functions and vertical strip LLT…

Combinatorics · Mathematics 2024-09-25 Lucas Gagnon

In this paper we prove pluripolarity of graphs of Denjoy quasianalytic functions of several variables on the spanning set

Complex Variables · Mathematics 2012-02-14 Sevdiyor Imomkulov , Zafar Ibragimov

This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…

Combinatorics · Mathematics 2022-04-18 William Chan , Logan Crew

We prove a continued fraction expansion for a certain $q$-tangent function that was conjectured by the present writer, then proved by Fulmek, now in a completely elementary way.

Combinatorics · Mathematics 2008-05-13 Helmut Prodinger

We explore several generalizations of Whitney's theorem -- a classical formula for the chromatic polynomial of a graph. Following Stanley, we replace the chromatic polynomial by the chromatic symmetric function. Following Dohmen and Trinks,…

Combinatorics · Mathematics 2023-05-08 Darij Grinberg

We prove a variant of a square function estimate for the extension operator associated to the moment curve in non-archimedean local fields. The arguments rely on a structural analysis of congruences (sublevel sets) of univariate polynomials…

Classical Analysis and ODEs · Mathematics 2022-03-28 Jonathan Hickman , James Wright

In 1995 Stanley introduced a generalization of the chromatic polynomial of a graph $G$, called the chromatic symmetric function, $X_G$, which was generalized to noncommuting variables, $Y_G$, by Gebhard-Sagan in 2001. Recently there has…

Combinatorics · Mathematics 2019-12-17 Samantha Dahlberg , Stephanie van Willigenburg

Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…

Combinatorics · Mathematics 2017-06-15 Seung Jin Lee

A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class $\Lambda_*$.…

Complex Variables · Mathematics 2012-11-13 Leonid V. Kovalev , Jani Onninen

This paper is concerned with two conjectures which are intimately related. The first is a generalization to hypergraphs of Vizing's Theorem on the chromatic index of a graph and the second is the well-known conjecture of Erd\H{o}s, Faber…

Combinatorics · Mathematics 2024-03-12 Alain Bretto , Alain Faisant , Francois Hennecart