Kvant Selecta: Combinatorics, I
About this Title
Serge Tabachnikov, University of Arkansas at Fayetteville, Fayetteville, AR, Editor. Translated by Professor Harold McFaden
Publication: Mathematical World
Publication Year 2002: Volume 17
ISBN: 978-0-8218-2171-8 (print)
MathSciNet review: MR1872245
MSC: Primary 00B55; Secondary 00B60, 05-01
This volume is not part of this online collection, but can be purchased through our online bookstore.
There is a tradition in Russia that holds that mathematics can be both challenging and fun. One fine outgrowth of that tradition is the magazine, Kvant, which has been enjoyed by many of the best students since its founding in 1970. The articles in Kvant assume only a minimal background, that of a good high school student, yet are capable of entertaining mathematicians of almost any level. Sometimes the articles require careful thought or a moment's work with a pencil and paper. However, the industrious reader will be generously rewarded by the elegance and beauty of the subjects.
This book is the third collection of articles from Kvant to be published by the AMS. The volume is devoted mainly to combinatorics and discrete mathematics. Several of the topics are well known: nonrepeating sequences, detecting a counterfeit coin, and linear inequalities in economics, but they are discussed here with the entertaining and engaging style typical of the magazine. The two previous collections treat aspects of algebra and analysis, including connections to number theory and other topics. They were published as Volumes 14 and 15 in the Mathematical World series.
The articles are written so as to present genuine mathematics in a conceptual, entertaining, and accessible way. The books are designed to be used by students and teachers who love mathematics and want to study its various aspects, deepening and expanding upon the school curriculum.
Graduate students and research mathematicians interested in combinatorics and discrete mathematics.
Table of Contents
- 1. Two games with matchsticks
- 2. Economics and linear inequalities
- 3. Economics and linear inequalities (Continuation)
- 4. Switching networks
- 5. Who will go to Rio?
- 6. From the life of units
- 7. Nonrepeating sequences
- 8. Words with restrictions
- 9. Planar switching circuits
- 10. Classification algorithms
- 11. How to detect a counterfeit coin
- 12. The generalized problem of counterfeit coins
- 13. Truthtellers, liars, and deceivers
- 14. Solvable and unsolvable algorithmic problems
- 15. Best bet for simpletons