Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from the basic notions to a variety of topics, ranging from algebra to statistical physics. Its aim is to introduce the student to a fascinating field, and to be a source of information for the professional mathematician who wants to learn more about the subject. The book is organized in three parts: Basics, Methods, and Topics. There are 666 exercises, and as a special feature every chapter ends with a highlight, discussing a particularly beautiful or famous result.
This book takes the reader on a mathematical journey from the number-theoretic setting of the Theorem of Markov and its Uniqueness Conjecture, gradually unfolding many beautiful connections, until in the proof of the Theorem everything falls into place.
First, there exist several older books on the subject, such as Ryser [1] (which I still think is the most seductive introduction to combinatorics), Hall [2], and more recent ones such as Cameron-Van Lint [1] on groups and designs, and Blake-Mullin [1] on coding theory, whereas no compre hensive book exists on (a) and (b).
Paul Erdos amava parlare del Libro in cui Dio conserva le dimostrazioni perfette per i teoremi matematici, seguendo il detto di G. H. Hardy secondo il quale non vi è posto perenne per la matematica brutta. Erdos disse anche che non è necessario credere in Dio, tuttavia in quanto matematici si deve credere nel Libro. Alcuni anni fa gli autori gli suggerirono di scrivere una prima (e assai modesta) approssimazione del Libro. Egli fu entusiasta e, come gli era peculiare, si mise immediatamente al lavoro, riempiendo pagine su pagine con i suoi suggerimenti. Essendo sfortunatamente morto nell'estate del 1996, Paul non compare come co-autore. Tuttavia questo libro è dedicato alla sua memoria.
Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from basic notions of combinatorial enumeration to a variety of topics, ranging from algebra to statistical physics.
Proceedings of the NATO Advanced Study Institute, Berlin, Germany, September 1-10, 1976
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 recommended first of all to students interested in combinatorics." Publicationes Mathematicae Debrecen
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.