Combinatorial Set Theory

This book contains the notes of the lectures delivered at an Advanced Course on Combinatorial Matrix Theory held at Centre de Recerca Matemàtica (CRM) in Barcelona. These notes correspond to five seri

This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory.Following an overview of basic notions in combinatorics and first-order

This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. This subject concerns itself with the use of matrix theory and linear algebra in proving results in combinatorics (and vice versa), and with the intrinsic properties of matrices viewed as arrays of numbers rather than algebraic objects in themselves. There are chapters dealing with the many connections between matrices, graphs, digraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorial properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix, and Latin squares. The final chapter deals with algebraic characterizations of combinatorial properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jordan Canonical Form. The book is sufficiently self-contained for use

This book provides a self-contained introduction to modern set theory and also opens up some more advanced areas of current research in this field. The first part offers an overview of classical set t

From the reviews: "This book [...] defines the boundaries of the subject now called combinatorial group theory. [...] it is a considerable achievement to have concentrated a survey of the subject into

This book offers a well-organized, easy-to-follow introduction to combinatorial theory, with examples, notes and exercises. ". . . a very good introduction to combinatorics. This book can warmly be re

A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are req

This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. This subject concerns itself with the use of matrix theory and linear algebra in proving results in combinatorics (and vice versa), and with the intrinsic properties of matrices viewed as arrays of numbers rather than algebraic objects in themselves. There are chapters dealing with the many connections between matrices, graphs, digraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorial properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix, and Latin squares. The final chapter deals with algebraic characterizations of combinatorial properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jordan Canonical Form. The book is sufficiently self-contained for use

Includes proof of van der Waerden's 1926 conjecture on permanents, Wilson's theorem on asymptotic existence, and other developments in combinatorics since 1967. Also covers coding theory and its impor

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based

This book explores combinatorial problems and insights in quantum field theory. It is not comprehensive, but rather takes a tour, shaped by the author’s biases, through some of the important ways that

Topological dynamics and ergodic theory usually have been treated independently. H. Furstenberg, instead, develops the common ground between them by applying the modern theory of dynamical systems to

This book discusses the representation theory of symmetric groups, the theory of symmetric functions and the polynomial representation theory of general linear groups. The first chapter provides a detailed account of necessary representation-theoretic background. An important highlight of this book is an innovative treatment of the Robinson–Schensted–Knuth correspondence and its dual by extending Viennot's geometric ideas. Another unique feature is an exposition of the relationship between these correspondences, the representation theory of symmetric groups and alternating groups and the theory of symmetric functions. Schur algebras are introduced very naturally as algebras of distributions on general linear groups. The treatment of Schur–Weyl duality reveals the directness and simplicity of Schur's original treatment of the subject. In addition, each exercise is assigned a difficulty level to test readers' learning. Solutions and hints to most of the exercises are provided at the end.

Topological dynamics and ergodic theory usually have been treated independently. H. Furstenberg, instead, develops the common ground between them by applying the modern theory of dynamical systems to

This monograph covers the recent major advances in various areas of set theory. From the reviews:"One of the classical textbooks and reference books in set theory....The present ‘Third Millennium’ edi

Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where brute force study is impractical. In this comprehensive volume, József Beck shows readers how to escape from the combinatorial chaos via the fake probabilistic method, a game-theoretic adaptation of the probabilistic method in combinatorics. Using this, the author is able to determine the exact results about infinite classes of many games, leading to the discovery of some striking new duality principles. Available for the first time in paperback, it includes a new appendix to address the results that have appeared since the book's original publication.

Additive combinatorics is a relatively recent term coined to comprehend the developments of the more classical additive number theory, mainly focussed on problems related to the addition of integers.

Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where brute force study is impractical. In this comprehensive volume, József Beck shows readers how to escape from the combinatorial chaos via the fake probabilistic method, a game-theoretic adaptation of the probabilistic method in combinatorics. Using this, the author is able to determine the exact results about infinite classes of many games, leading to the discovery of some striking new duality principles. Available for the first time in paperback, it includes a new appendix to address the results that have appeared since the book's original publication.

The new edition of this practice-oriented handbook features thoroughly updated contents, including recent developments in parallel synthesis.A new chapter on screening complements the overview of comb

This monograph covers the recent major advances in various areas of set theory. From the reviews:"One of the classical textbooks and reference books in set theory....The present ‘Third Millennium’ edi

This is a classic introduction to set theory in three parts. The first part gives a general introduction to set theory, suitable for undergraduates; complete proofs are given and no background in logic is required. Exercises are included, and the more difficult ones are supplied with hints. An appendix to the first part gives a more formal foundation to axiomatic set theory, supplementing the intuitive introduction given in the first part. The final part gives an introduction to modern tools of combinatorial set theory. This part contains enough material for a graduate course of one or two semesters. The subjects discussed include stationary sets, delta systems, partition relations, set mappings, measurable and real-valued measurable cardinals. Two sections give an introduction to modern results on exponentiation of singular cardinals, and certain deeper aspects of the topics are developed in advanced problems.

This is a classic introduction to set theory in three parts. The first part gives a general introduction to set theory, suitable for undergraduates; complete proofs are given and no background in logic is required. Exercises are included, and the more difficult ones are supplied with hints. An appendix to the first part gives a more formal foundation to axiomatic set theory, supplementing the intuitive introduction given in the first part. The final part gives an introduction to modern tools of combinatorial set theory. This part contains enough material for a graduate course of one or two semesters. The subjects discussed include stationary sets, delta systems, partition relations, set mappings, measurable and real-valued measurable cardinals. Two sections give an introduction to modern results on exponentiation of singular cardinals, and certain deeper aspects of the topics are developed in advanced problems.

The ICMS Workshop on Geometric and Combinatorial Methods in Group Theory, held at Heriot-Watt University in 1993, brought together some of the leading research workers in the subject. Some of the survey articles and contributed papers presented at the meeting are collected in this volume. The former cover a number of areas of current interest and include papers by: S. M. Gersten, R. I. Grigorchuk, P. H. Kropholler, A. Lubotzky, A. A. Razborov and E. Zelmanov. The contributed articles, all refereed, range over a wide number of topics in combinatorial and geometric group theory and related topics. The volume represents a summary of the state of knowledge of the field, and as such will be indispensable to all research workers in the area.

Basic work on two-dimensional homotopy theory dates back to K. Reidemeister and J. H. C. Whitehead. Much work in this area has been done since then, and this book considers the current state of knowledge in all the aspects of the subject. The editors start with introductory chapters on low-dimensional topology, covering both the geometric and algebraic sides of the subject, the latter including crossed modules, Reidemeister-Peiffer identities, and a concrete and modern discussion of Whitehead's algebraic classification of 2-dimensional homotopy types. Further chapters have been skilfully selected and woven together to form a coherent picture. The latest algebraic results and their applications to 3- and 4-dimensional manifolds are dealt with. The geometric nature of the subject is illustrated to the full by over 100 diagrams. Final chapters summarize and contribute to the present status of the conjectures of Zeeman, Whitehead, and Andrews-Curtis. No other book covers all these topics.

This is a well-balanced introduction to topology that stresses geometric aspects. Focusing on historical background and visual interpretation of results, it emphasizes spaces with few dimensions, wher

David Armstrong's book is a contribution to the philosophical discussion about possible worlds. Taking Wittgenstein's Tractatus as his point of departure, Professor Armstrong argues that nonactual possibilities and possible worlds are recombinations of actually existing elements, and as such are useful fictions. There is an extended criticism of the alternative-possible-worlds approach championed by the American philosopher David Lewis. This major work will be read with interest by a wide range of philosophers.