CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Chromatic polynomials of graphs from Kac-Moody algebras

by: R. Venkatesh, Sankaran Viswanath
(5 Mar 2013)  Key: citeulike:12115573

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie algebra evaluated on the sum of the simple roots. Applying the Peterson recurrence formula for root multiplicities, we obtain a new realization of the chromatic polynomial as a weighted sum of paths in the bond lattice of G.


nclisby's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles from these CiteULike users

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.