A Course in Enumeration

  • Martin Aigner
Part of the Graduate Texts in Mathematics book series (GTM, volume 238)

Table of contents

  1. Front Matter
    Pages I-X
  2. Introduction

    1. Pages 1-2
  3. Basics

    1. Front Matter
      Pages 3-3
  4. Methods

    1. Front Matter
      Pages 91-91
    2. Pages 93-141
    3. Pages 143-178
    4. Pages 179-238
    5. Pages 239-285
  5. Topics

    1. Front Matter
      Pages 287-287
    2. Pages 289-344
    3. Pages 345-392
    4. Pages 393-450
  6. Back Matter
    Pages 519-565

About this book

Introduction

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.

Keywords

Algebra Pólya theory combinatorial coefficients generating functions graph and knot polynomials hypergeometric summation orthogonal polynomials sieve methods statisical physics statistical physics symmetric functions

Authors and affiliations

  • Martin Aigner
    • 1
  1. 1.Fachbereich Mathematik und Informatik Institut für Mathematik IIFreie Universität BerlinBerlinGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-39035-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-540-39032-9
  • Online ISBN 978-3-540-39035-0
  • Series Print ISSN 0072-5285
  • About this book