269 research outputs found
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
Combinatoire des cartes et polynome de Tutte
Les cartes sont les plongements, sans intersection d'arĂȘtes, des graphes dans des surfaces. Les cartes constituent une discrĂ©tisation naturelle des surfaces et apparaissent aussi bien en informatique (codage d'informations visuelles) quĂ©n physique (surfaces alĂ©atoires de la physique statistique et quantique). Nous Ă©tablissons des rĂ©sultats Ă©numĂ©ratifs pour de nouvelles familles de cartes. En outre, nous dĂ©finissons des bijections entre les cartes et des classes combinatoires plus simples (chemins planaires, couples d'arbres). Ces bijections rĂ©vĂšlent des propriĂ©tĂ©s structurelles importantes des cartes et permettent leur comptage, leur codage et leur gĂ©nĂ©ration alĂ©atoire. Enfin, nous caractĂ©risons un invariant fondamental de la thĂ©orie des graphes, le polynĂŽme de Tutte, en nous appuyant sur les cartes. Cette caractĂ©risation permet d'Ă©tablir des bijections entre plusieurs structures (arbres cou- vrant, suites de degrĂ©s, configurations du tas de sable) comptĂ©es par le polynĂŽme de Tutte.A map is a graph together with a particular (proper) embedding in a surface. Maps are a natural way of representing discrete surfaces and as such they appear both in computer science (encoding of visual data) and in physics (random lattices of statistical physics and quantum gravity). We establish enumerative results for new classes of maps. Moreover, we define several bijections between maps and simpler combinatorial classes (planar walks, pairs of trees). These bijections highlight some important structural properties and allows one to count, sample randomly and encode maps efficiently. Lastly, we give a new characterization of an important graph invariant, the Tutte polynomial, by making use of maps. This characterization allows us to establish bijections between several structures (spanning trees, sandpile configurations, outdegree sequences) counted by the Tutte polynomial
Chromatic roots are dense in the whole complex plane
I show that the zeros of the chromatic polynomials P_G(q) for the generalized
theta graphs \Theta^{(s,p)} are, taken together, dense in the whole complex
plane with the possible exception of the disc |q-1| < 1. The same holds for
their dichromatic polynomials (alias Tutte polynomials, alias Potts-model
partition functions) Z_G(q,v) outside the disc |q+v| < |v|. An immediate
corollary is that the chromatic zeros of not-necessarily-planar graphs are
dense in the whole complex plane. The main technical tool in the proof of these
results is the Beraha-Kahane-Weiss theorem on the limit sets of zeros for
certain sequences of analytic functions, for which I give a new and simpler
proof.Comment: LaTeX2e, 53 pages. Version 2 includes a new Appendix B. Version 3
adds a new Theorem 1.4 and a new Section 5, and makes several small
improvements. To appear in Combinatorics, Probability & Computin
Chromatic roots are dense in the whole complex plane
I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) Z(G)(q,upsilon) outside the disc \q + upsilon\ < \upsilon\. An immediate corollary is that the chromatic roots of not-necessarily-planar graphs are dense in the whole complex plane. The main technical tool in the proof of these results is the Beraha-Kahane-Weiss theorem oil the limit sets of zeros for certain sequences of analytic functions, for which I give a new and simpler proof
Arbeitsgemeinschaft: Limits of Structures
The goal of the Arbeitsgemeinschaft is to review current progress in the study of very large structures. The main emphasis is on the analytic approach that considers large structures as approximations of infinite analytic objects. This approach enables one to study graphs, hypergraphs, permutations, subsets of groups and many other fundamental structures
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information about the graph (indeed, in the matroid case it encodes the full structure of the matroid). It contains as a special case the familiar two-variable Tutte polynomial -- and therefore also its one-variable specializations such as the chromatic polynomial, the flow polynomial and the reliability polynomial -- but is considerably more flexible. I begin by giving an introduction to all these problems, stressing the advantages of working with the multivariate version. I then discuss some questions concerning the complex zeros of the multivariate Tutte polynomial, along with their physical interpretations in statistical mechanics (in connection with the Yang--Lee approach to phase transitions) and electrical circuit theory. Along the way I mention numerous open problems. This survey is intended to be understandable to mathematicians with no prior knowledge of physics
- âŠ