Problems in Positional Games and Extremal Combinatorics
Title | Problems in Positional Games and Extremal Combinatorics PDF eBook |
Author | Christopher Kusch |
Publisher | |
Pages | 0 |
Release | 2017 |
Genre | |
ISBN |
On Combinatorial Problems of Extremal Nature and Games
Title | On Combinatorial Problems of Extremal Nature and Games PDF eBook |
Author | Humberto Silva Naves |
Publisher | |
Pages | 80 |
Release | 2014 |
Genre | |
ISBN |
Extremal graph theory is a branch of discrete mathematics and also the central theme of extremal combinatorics. It studies graphs which are extremal with respect to some parameter under certain restrictions. A typical result in extremal graph theory is Mantel's theorem. It states that the complete bipartite graph with equitable parts is the graph the maximizes the number of edges among all triangle-free graphs. One can say that extremal graph theory studies how local properties of a graph influence its global structure. Another fundamental topic in the field of combinatorics is the probabilistic method, which is a nonconstructive method pioneered by Paul Erdos for proving the existence of a prescribed kind of mathematical object. One particular application of the probabilistic method lies in the field of positional games, more specifically Maker-Breaker games. My dissertation focus mainly on various Turan-type questions and their applications to other related areas as well as the employment of the probabilistic method to study extremal problems and positional games.
Positional Games
Title | Positional Games PDF eBook |
Author | Dan Hefetz |
Publisher | Springer |
Pages | 154 |
Release | 2014-06-13 |
Genre | Mathematics |
ISBN | 3034808259 |
This text is based on a lecture course given by the authors in the framework of Oberwolfach Seminars at the Mathematisches Forschungsinstitut Oberwolfach in May, 2013. It is intended to serve as a thorough introduction to the rapidly developing field of positional games. This area constitutes an important branch of combinatorics, whose aim it is to systematically develop an extensive mathematical basis for a variety of two player perfect information games. These ranges from such popular games as Tic-Tac-Toe and Hex to purely abstract games played on graphs and hypergraphs. The subject of positional games is strongly related to several other branches of combinatorics such as Ramsey theory, extremal graph and set theory, and the probabilistic method. These notes cover a variety of topics in positional games, including both classical results and recent important developments. They are presented in an accessible way and are accompanied by exercises of varying difficulty, helping the reader to better understand the theory. The text will benefit both researchers and graduate students in combinatorics and adjacent fields.
Extremal Combinatorics
Title | Extremal Combinatorics PDF eBook |
Author | Stasys Jukna |
Publisher | Springer Science & Business Media |
Pages | 414 |
Release | 2011-08-31 |
Genre | Computers |
ISBN | 3642173640 |
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text. This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.
Games of No Chance 3
Title | Games of No Chance 3 PDF eBook |
Author | Michael H. Albert |
Publisher | Cambridge University Press |
Pages | 577 |
Release | 2009-05-29 |
Genre | Mathematics |
ISBN | 0521861349 |
This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, on impartial games such as Chomp and Wythoff's Nim, and on aspects of games with infinitesimal values, plus analyses of the complexity of some games and puzzles and surveys on algorithmic game theory, on playing to lose, and on coping with cycles. The volume is rounded out with an up-to-date bibliography by Fraenkel and, for readers eager to get their hands dirty, a list of unsolved problems by Guy and Nowakowski. Highlights include some of Siegel's groundbreaking work on loopy games, the unveiling by Friedman and Landsberg of the use of renormalization to give very intriguing results about Chomp, and Nakamura's "Counting Liberties in Capturing Races of Go." Like its predecessors, this book should be on the shelf of all serious games enthusiasts.
More Games of No Chance
Title | More Games of No Chance PDF eBook |
Author | Richard Nowakowski |
Publisher | Cambridge University Press |
Pages | 552 |
Release | 2002-11-25 |
Genre | Mathematics |
ISBN | 9780521808323 |
This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with a bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts.
Contemporary Combinatorics
Title | Contemporary Combinatorics PDF eBook |
Author | Bela Bollobas |
Publisher | Springer Science & Business Media |
Pages | 310 |
Release | 2002-05-28 |
Genre | Mathematics |
ISBN | 9783540427254 |
This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erdös Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental results and appreciate some of the latest developments. An important feature of the articles, very much in the spirit of Erdös, is the abundance of open problems.