English
Related papers

Related papers: Chromatic quasisymmetric functions for signed grap…

200 papers

The quasisymmetric generating function of the set of permutations whose inverses have a fixed descent set is known to be symmetric and Schur-positive. The corresponding representation of the symmetric group is called the descent…

Combinatorics · Mathematics 2023-09-26 Vassilis Dionyssis Moustakas

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

Combinatorics · Mathematics 2010-11-18 Matthias Beck , Benjamin Braun

In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…

Combinatorics · Mathematics 2007-05-23 Michiel Hazewinkel

We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…

Combinatorics · Mathematics 2016-05-10 Matthias Beck , Mela Hardin

The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…

Combinatorics · Mathematics 2025-05-06 Shamil Asgarli , Sara Krehbiel , Howard W. Levinson , Heather M. Russell

In our previous works we introduced a $q$-deformation of the generating functions for enriched $P$-partitions. We call the evaluation of this generating functions on labelled chains, the $q$-fundamental quasisymmetric functions. These…

Combinatorics · Mathematics 2024-10-30 Darij Grinberg , Ekaterina A. Vassilieva

We introduce and study a generalization $s_{(\mu|\lambda)}$ of the Schur functions called the almost symmetric Schur functions. These functions simultaneously generalize the finite variable key polynomials and the infinite variable Schur…

Combinatorics · Mathematics 2024-05-03 Milo Bechtloff Weising

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…

Combinatorics · Mathematics 2025-09-30 Matthias Beck , Benjamin Braun , Alvaro Cornejo

Let $D=\left( V,A\right) $ be a digraph with $n$ vertices, where each arc $a\in A$ is a pair $\left( u,v\right) $ of two vertices. We study the \emph{Redei--Berge symmetric function} $U_{D}$, defined as the quasisymmetric function% \[ \sum…

Combinatorics · Mathematics 2023-07-13 Darij Grinberg , Richard P. Stanley

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

Combinatorics · Mathematics 2023-03-17 Philippe Nadeau , Vasu Tewari

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…

Algebraic Geometry · Mathematics 2022-12-29 Alex Abreu , Antonio Nigro

A signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G) \to \{+,-\}$. A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) number of negative edges, counting repetitions. A…

Discrete Mathematics · Computer Science 2020-09-28 Julien Bensmail , Sandip Das , Soumen Nandi , Théo Pierron , Sagnik Sen , Eric Sopena

The equivariant cohomology ring of a regular semisimple Hessenberg variety in type A is a free module over the equivariant cohomology ring of a point. When equipped with Tymoczko's dot action, it becomes a twisted representation of the…

Combinatorics · Mathematics 2025-07-09 Mathieu Guay-Paquet

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…

Mathematical Physics · Physics 2020-02-05 Carlos I. Pérez-Sánchez

The abstract chromatic number was introduced by Razborov and Coregliano in 2020 in using the language of model theory, and was used to extend the Erd\H os-Stone-Simonovits theorem to graphs with extra structures. A purely combinatorial…

Combinatorics · Mathematics 2026-03-13 Dániel Gerbner

In the context of generating functions for $P$-partitions, we revisit three flavors of quasisymmetric functions: Gessel's quasisymmetric functions, Chow's type B quasisymmetric functions, and Poirier's signed quasisymmetric functions. In…

Combinatorics · Mathematics 2007-05-23 T. Kyle Petersen

We introduce a weighted quasisymmetric enumerator function associated to generalized permutohedra. It refines the Billera, Jia and Reiner quasisymmetric function which also includes the Stanley chromatic symmetric function. Beside that it…

Combinatorics · Mathematics 2017-10-24 Vladimir Grujić , Marko Pešović , Tanja Stojadinović

In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra $U_q \big( \widehat{\mathfrak{sl}} (1 | n)…

Combinatorics · Mathematics 2021-05-11 Amol Aggarwal , Alexei Borodin , Michael Wheeler

Skewing operators play a central role in the symmetric function theory because of the importance of the product structure of the symmetric function space. The theory of noncommutative symmetric functions is a useful tool for studying…

Combinatorics · Mathematics 2023-05-16 Byung-Hak Hwang

The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$ for each $m \in \mathbb{N}$. In 1990, Kostochka and Sidorenko introduced the list color function of graph $G$, denoted…

‹ Prev 1 8 9 10 Next ›