Hyperoctahedral Eulerian idempotents, hodge decompositions, and signed graph coloring complexes

Benjamin Braun; Sarah Crown Rundell

doi:10.37236/3636

Hyperoctahedral Eulerian idempotents, hodge decompositions, and signed graph coloring complexes

Benjamin Braun, Sarah Crown Rundell

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperocta- hedral Eulerian idempotents.

Original language	English
Article number	P2.35
Journal	Electronic Journal of Combinatorics
Volume	21
Issue number	2
DOIs	https://doi.org/10.37236/3636
State	Published - May 22 2014

Keywords

Chromatic polynomial
Coloring complex
Eulerian idempotent
Hodge decomposition
Signed graph

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/3636

Cite this

@article{e3ea77d6f6dd44bb8f77a4af26240ad2,

title = "Hyperoctahedral Eulerian idempotents, hodge decompositions, and signed graph coloring complexes",

abstract = "Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperocta- hedral Eulerian idempotents.",

keywords = "Chromatic polynomial, Coloring complex, Eulerian idempotent, Hodge decomposition, Signed graph",

author = "Benjamin Braun and Rundell, {Sarah Crown}",

year = "2014",

month = may,

day = "22",

doi = "10.37236/3636",

language = "English",

volume = "21",

number = "2",

}

TY - JOUR

T1 - Hyperoctahedral Eulerian idempotents, hodge decompositions, and signed graph coloring complexes

AU - Braun, Benjamin

AU - Rundell, Sarah Crown

PY - 2014/5/22

Y1 - 2014/5/22

N2 - Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperocta- hedral Eulerian idempotents.

AB - Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperocta- hedral Eulerian idempotents.

KW - Chromatic polynomial

KW - Coloring complex

KW - Eulerian idempotent

KW - Hodge decomposition

KW - Signed graph

UR - http://www.scopus.com/inward/record.url?scp=84901350626&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901350626&partnerID=8YFLogxK

U2 - 10.37236/3636

DO - 10.37236/3636

M3 - Article

AN - SCOPUS:84901350626

SN - 1077-8926

VL - 21

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2

M1 - P2.35

ER -

Hyperoctahedral Eulerian idempotents, hodge decompositions, and signed graph coloring complexes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this