Search arXivSearch

arXiv · 0711.0016

Tutte chromatic identities from the Temperley-Lieb algebra

Abstract

This paper introduces a conceptual framework, in the context of quantum topology and the algebras underlying it, for analyzing relations obeyed by the chromatic polynomial χ(Q) of planar graphs. Using it we give new proofs and substantially extend a number of classical results concerning the combinatorics of the chromatic polynomial. In particular, we show that Tutte's golden identity is a consequence of level-rank duality for SO(N) topological quantum field theories and Birman-Murakami-Wenzl algebras. This identity is a remarkable feature of the chromatic polynomial relating χ({ϕ+2}) for any triangulation of the sphere to (χ({ϕ+1}))^2 for the same graph, where ϕdenotes the golden ratio. The new viewpoint presented here explains that Tutte's identity is special to these values of the parameter Q. A natural context for analyzing such properties of the chromatic polynomial is provided by the {\em chromatic algebra}, whose Markov trace is the chromatic polynomial of an associated graph. We use it to show that another identity of Tutte's for the chromatic polynomial at Q=ϕ+1 arises from a Jones-Wenzl projector in the Temperley-Lieb algebra. We generalize this identity to each value Q= 2+2\cos(2πj/(n+1)) for j< n positive integers. When j=1, these Q are the Beraha numbers, where the existence of such identities was conjectured by Tutte. We present a recursive formula for this sequence of chromatic polynomial relations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Fendley, Vyacheslav Krushkal. 2008-07-19. Tutte chromatic identities from the Temperley-Lieb algebra. https://doi.org/10.2140/gt.2009.13.709

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO