Koha online

Your cart is empty.
Normal view MARC view ISBD view

A Course in Enumeration [electronic resource] /by Martin Aigner.

by Aigner, Martin [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Graduate Texts in Mathematics: 238Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: X, 565 p. 55 illus. online resource.ISBN: 9783540390350.Subject(s): Mathematics | Computational complexity | Combinatorics | Mathematical physics | Mathematics | Combinatorics | Mathematical and Computational Physics | Discrete Mathematics in Computer ScienceDDC classification: 511.6 Online resources: Click here to access online
Contents:
Basics -- Fundamental Coefficients -- Formal Series and Infinite Matrices -- Methods -- Generating Functions -- Hypergeometric Summation -- Sieve Methods -- Enumeration of Patterns -- Topics -- The Catalan Connection -- Symmetric Functions -- Counting Polynomials -- Models from Statistical Physics.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
MAIN LIBRARY
QA164-167.2 (Browse shelf) Available

Basics -- Fundamental Coefficients -- Formal Series and Infinite Matrices -- Methods -- Generating Functions -- Hypergeometric Summation -- Sieve Methods -- Enumeration of Patterns -- Topics -- The Catalan Connection -- Symmetric Functions -- Counting Polynomials -- Models from Statistical Physics.

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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha