193 research outputs found
Realizability and uniqueness in graphs
AbstractConsider a finite graph G(V,E). Let us associate to G a finite list P(G) of invariants. To any P the following two natural problems arise: (R) Realizability. Given P, when is P=P(G) for some graph G?, (U) Uniqueness. Suppose P(G)=P(H) for graphs G and H. When does this imply G ≅ H? The best studied questions in this context are the degree realization problem for (R) and the reconstruction conjecture for (U). We discuss the problems (R) and (U) for the degree sequence and the size sequence of induced subgraphs for undirected and directed graphs, concentrating on the complexity of the corresponding decision problems and their connection to a natural search problem on graphs
Mixed volumes of hypersimplices, root systems and shifted young tableaux
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 40-41).This thesis consists of two parts. In the first part, we start by investigating the classical permutohedra as Minkowski sums of the hypersimplices. Their volumes can be expressed as polynomials whose coefficients - the mixed Eulerian numbers - are given by the mixed volumes of the hypersimplices. We build upon results of Postnikov and derive various recursive and combinatorial formulas for the mixed Eulerian numbers. We generalize these results to arbitrary root systems [fee], and obtain cyclic, recursive and combinatorial formulas for the volumes of the weight polytopes ([fee]-analogues of permutohedra) as well as the mixed [fee]-Eulerian numbers. These formulas involve Cartan matrices and weighted paths in Dynkin diagrams, and thus enable us to extend the theory of mixed Eulerian numbers to arbitrary matrices whose principal minors are invertible. The second part deals with the study of certain patterns in standard Young tableaux of shifted shapes. For the staircase shape, Postnikov found a bijection between vectors formed by the diagonal entries of these tableaux and lattice points of the (standard) associahedron. Using similar techniques, we generalize this result to arbitrary shifted shapes.by Dorian Croitoru.Ph.D
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
Partition identity bijections related to sign-balance and rank
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.Includes bibliographical references (p. 81-83).In this thesis, we present bijections proving partitions identities. In the first part, we generalize Dyson's definition of rank to partitions with successive Durfee squares. We then present two symmetries for this new rank which we prove using bijections generalizing conjugation and Dyson's map. Using these two symmetries we derive a version of Schur's identity for partitions with successive Durfee squares and Andrews' generalization of the Rogers-Ramanujan identities. This gives a new combinatorial proof of the first Rogers-Ramanujan identity. We also relate this work to Garvan's generalization of rank. In the second part, we prove a family of four-parameter partition identities which generalize Andrews' product formula for the generating function for partitions with respect number of odd parts and number of odd parts of the conjugate. The parameters which we use are related to Stanley's work on the sign-balance of a partition.by Cilanne Emily Boulet.Ph.D
Dominance Over N
Abstract.This paper provides an overview of the b-dominance order over the natural numbers, N, using the base b expansion of natural numbers. The b-dominance order is an accessible partially-ordered set that is less complex than the divisor relation but more complex than ≤; thus, it supplies a good medium through which an undergraduate can be exposed to the subject of order theory. Here we discuss many ideas in order theory, including the Poincaré polynomial and the Möbius function. Acknowledgements: The authors thank the M.J. Murdock Charitable Trust and the Pacific Lutheran University Division of Natural Sciences for their generous support. They would also like to extend their thanks to Dr. Tom Edgar for the project idea and all his help throughout their summer program. Page 24 RHIT Undergrad. Math. J., Vol. 14, no. 2
Some of my Favourite Problems in Number Theory, Combinatorics, and Geometry
To the memor!l of m!l old friend Professor George Sved.I heard of his untimel!l death while writing this paper
Recommended from our members
The life and work of Major Percy Alexander MacMahon
This thesis describes the life and work of the mathematician Major Percy Alexander MacMahon (1854 - 1929). His early life as a soldier in the Royal Artillery and events which led to him embarking on a career in mathematical research and teaching are dealt with in the first two chapters. Succeeding chapters explain the work in invariant theory and partition theory which brought him to the attention of the British mathematical community and eventually resulted in a Fellowship of the Royal Society, the presidency of the London Mathematical Society, and the award of three prestigious mathematical medals and four honorary doctorates. The development and importance of his recreational mathematical work is traced and discussed. MacMahon's career in the Civil Service as Deputy Warden of the Standards at the Board of Trade is also described. Throughout the thesis, his involvement with the British Association for the Advancement of Science and other scientific organisations is highlighted. The thesis also examines possible reasons why MacMahon's work, held in very high regard at the time, did not lead to the lasting fame accorded to some of his contemporaries. Details of his personal and social life are included to give a picture of MacMahon as a real person working hard to succeed in a difficult context
- …