93 research outputs found
The chromatic polynomial of fatgraphs and its categorification
Motivated by Khovanov homology and relations between the Jones polynomial and
graph polynomials, we construct a homology theory for embedded graphs from
which the chromatic polynomial can be recovered as the Euler characteristic.
For plane graphs, we show that our chromatic homology can be recovered from the
Khovanov homology of an associated link. We apply this connection with Khovanov
homology to show that the torsion-free part of our chromatic homology is
independent of the choice of planar embedding of a graph.
We extend our construction and categorify the Bollobas-Riordan polynomial (a
generalisation of the Tutte polynomial to embedded graphs). We prove that both
our chromatic homology and the Khovanov homology of an associated link can be
recovered from this categorification.Comment: A substantial revision. To appear in Advances in Mathematic
Some root invariants at the prime 2
The first part of this paper consists of lecture notes which summarize the
machinery of filtered root invariants. A conceptual notion of "homotopy Greek
letter element" is also introduced, and evidence is presented that it may be
related to the root invariant. In the second part we compute some low
dimensional root invariants of v_1-periodic elements at the prime 2.Comment: This is the version published by Geometry & Topology Monographs on 29
January 200
A splitting property of the chromatic homology of the complete graph
Khovanov introduced a bigraded cohomology theory of links whose graded Euler
characteristic is the Jones polynomial. The theory was subsequently applied to
the chromatic polynomial of graph, resulting in a categorification known as the
``chromatic homology''. Much as in the Khovanov homology, the chromatic
polynomial can be obtained by taking the Euler characteristic of the chromatic
homology. In the present paper, we introduce a combinatorial description of
enhanced states that can be applied to analysis of the homology in an explicit
way by hand. Using the new combinatorial description, we show a splitting
property of the chromatic homology for a certain class of graphs. Finally, as
an application of the description, we compute the chromatic homology of the
complete graph.Comment: 20 pages, 5 figure
Recommended from our members
Graph theory in America 1876-1950
This narrative is a history of the contributions made to graph theory in the United States of America by American mathematicians and others who supported the growth of scholarship in that country, between the years 1876 and 1950.
The beginning of this period coincided with the opening of the first research university in the United States of America, The Johns Hopkins University (although undergraduates were also taught), providing the facilities and impetus for the development of new ideas. The hiring, from England, of one of the foremost mathematicians of the time provided the necessary motivation for research and development for a new generation of American scholars. In addition, it was at this time that home-grown research mathematicians were first coming to prominence.
At the beginning of the twentieth century European interest in graph theory, and to some extent the four-colour problem, began to wane. Over three decades, American mathematicians took up this field of study - notably, Oswald Veblen, George Birkhoff, Philip Franklin, and Hassler Whitney. It is necessary to stress that these four mathematicians and all the other scholars mentioned in this history were not just graph theorists but worked in many other disciplines. Indeed, they not only made significant contributions to diverse fields but, in some cases, they created those fields themselves and set the standards for others to follow. Moreover, whilst they made considerable contributions to graph theory in general, two of them developed important ideas in connection with the four-colour problem. Grounded in a paper by Alfred Bray Kempe that was notorious for its fallacious 'proof' of the four-colour theorem, these ideas were the concepts of an unavoidable set and a reducible configuration.
To place the story of these scholars within the history of mathematics, America, and graph theory, brief accounts are presented of the early years of graph theory, the early years of mathematics and graph theory in the USA, and the effects of the founding of the first institute for postgraduate study in America. Additionally, information has been included on other influences by such global events as the two world wars, the depression, the influx of European scholars into the United States of America, mainly during the 1930s, and the parallel development of graph theory in Europe.
Until the end of the nineteenth century, graph theory had been almost entirely the prerogative of European mathematicians. Perhaps the first work in graph theory carried out in America was by Charles Sanders Peirce, arguably America's greatest logician and philosopher at the time. In the 1860s, he studied the four-colour conjecture and claimed to have written at least two papers on the subject during that decade, but unfortunately neither of these has survived. William Edward Story entered the field in 1879, with unfortunate consequences, but it was not until 1897 that an American mathematician presented a lecture on the subject, albeit only to have the paper disappear. Paul Wernicke presented a lecture on the four-colour problem to the American Mathematician Society, but again the paper has not survived. However, his 1904 paper has survived and added to the story of graph theory, and particularly the four-colour conjecture.
The year 1912 saw the real beginning of American graph theory with Veblen and Birkhoff publishing major contributions to the subject. It was around this time that European mathematicians appeared to lose interest in graph theory. In the period 1912 to 1950 much of the progress made in the subject was from America and by 1950 not only had the United States of America become the foremost country for mathematics, it was the leading centre for graph theory
- …