𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Combinatorial Theory (Classics in Mathematics)

✍ Scribed by Martin Aigner


Publisher
Springer
Year
1997
Tongue
German
Leaves
492
Series
Classics in Mathematics
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Along with statistics, combinatorics is one of the most maligned fields of mathematics. Often it is not even considered a field in its own right but merely a grab-bag of disparate tricks to be exploited by other, nobler endeavours. Where is the glory in simply counting things? This book goes a long way towards shattering these old stereotypes. By unifying enumerative combinatorics under a strong algebraic framework, Aigner finally bestows upon the humble act of counting the respect it so surely deserves.

At first, it may be somewhat trying to make sense of his presentation as he reworks familiar results in this algebraic view. Often, I was left wondering why it is necessary to go through the trouble of all these high-powered techniques just to obtain results we've already obtained through much simpler means. However, as I progressed through the chapters, it became clear that the only consistent way to tackle the truly difficult problems in enumeration was with these algebraic tools.

If you are serious about combinatorics or merely interested in what combinatorics has to offer, this volume is certainly a valuable addition to your library.

✦ Subjects


ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;ДискрСтная ΠΌΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;


πŸ“œ SIMILAR VOLUMES


Combinatorial Group Theory (Classics in
✍ Roger C. Lyndon, Paul E. Schupp πŸ“‚ Library πŸ“… 2001 🌐 English

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 339 pages. [...] a valuable and welcome addition to the literature, containing many results not pre

Combinatorial Group Theory (Classics in
✍ Roger C. Lyndon, Paul E. Schupp πŸ“‚ Library πŸ“… 2001 🌐 English

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 339 pages. [...] a valuable and welcome addition to the literature, containing many results not pre

Algorithms and Classification in Combina
✍ Gilbert Baumslag (editor), Charles F. III Miller (editor) πŸ“‚ Library πŸ“… 2011 πŸ› Springer 🌐 English

<span>In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and Stallings. The organisers of the workshop were G

Algorithms and Classification in Combina
✍ Charles F. Miller III (auth.), Gilbert Baumslag, Charles F. Miller III (eds.) πŸ“‚ Library πŸ“… 1992 πŸ› Springer-Verlag New York 🌐 English

The papers in this volume are the result of a workshop held in January 1989 at the Mathematical Sciences Research Institute. Topics covered include decision problems, finitely presented simple groups, combinatorial geometry and homology, and automatic groups and related topics.