Problem-Solving Methods in Combinatorics - Pablo Soberón

Problem-Solving Methods in Combinatorics

An Approach to Olympiad Problems

(Autor)

Buch | Softcover
IX, 174 Seiten
2013 | 2013
Springer Basel (Verlag)
978-3-0348-0596-4 (ISBN)
80,24 inkl. MwSt
Yearly math olympiads include at least one combinatrics problem. This book reviews problem-solving techniques for tackling such problems, with examples from recent contests. Includes problems for each topic, with hints and full solutions for reader practice.
Every year there is at least one combinatorics problem in each of the major international mathematical olympiads. These problems can only be solved with a very high level of wit and creativity. This book explains all the problem-solving techniques necessary to tackle these problems, with clear examples from recent contests. It also includes a large problem section for each topic, including hints and full solutions so that the reader can practice the material covered in the book. The material will be useful not only to participants in the olympiads and their coaches but also in university courses on combinatorics.

Pablo Soberón (born 1988) is the first Mexican to obtain a gold medal in the International Mathematical Olympiad. After participating in mathematical olympiads, he has also trained Mexican teams for various international mathematical contests. He currently does research in discrete geometry at University College London and enjoys olympiad problem-solving in his free time.

Introduction.- 1 First concepts.- 2 The pigeonhole principle.- 3 Invariants.- 4 Graph theory.- 5 Functions.- 6 Generating Functions.- 7 Partitions.- 8 Hints for the problems.- 9 Solutions to the problems.- Notation.- Further reading.- Index.

From the reviews:

"Soberón (Univ. College London, UK) presents tools, techniques, and some tricks to tackle problems of varying difficulty in combinatorial mathematics in this well-written book. ... Salient features include the wealth of examples, exercises, and problems and two additional chapters with hints and solutions to the problems. Valuable for all readers interested in combinatorics and useful as a course resource on the subject. Summing Up: Highly recommended. Upper-division undergraduate through professional mathematics collections." (D. V. Chopra, Choice, Vol. 51 (4), December, 2013)

Erscheint lt. Verlag 5.4.2013
Zusatzinfo IX, 174 p. 65 illus., 10 illus. in color.
Verlagsort Basel
Sprache englisch
Maße 170 x 242 mm
Gewicht 217 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
Schlagworte combinatorics • Functions • graph theory • Invariants • olympiad • Partitions • pigeonhole principle
ISBN-10 3-0348-0596-9 / 3034805969
ISBN-13 978-3-0348-0596-4 / 9783034805964
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
64,95