Analytic combinatorics

Analytic combinatorics

Analytic combinatorics is a branch of combinatorics that describes combinatorial classes using generating functions, which are often analytic functions, but sometimes formal power series.

Two types of generating functions are commonly used — ordinary and exponential generating functions.

An important technique for deriving generating functions is symbolic combinatorics.

Given a generating function, analytic combinatorics attempts to describe the asymptotic behavior of a counting sequence using algebraic techniques. This often involves analysis of the function's singularities.

References

* Herbert Wilf, "Generatingfunctionology", Academic Press, 1990, ISBN 0127519556.
* Philippe Flajolet and Robert Sedgewick, "Analytic Combinatorics", Cambridge University Press, 2008, ISBN 0521898064 (Not published yet).


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… …   Wikipedia

  • Analytic — See also: Analysis Contents 1 Natural sciences 2 Philosophy 3 Social sciences …   Wikipedia

  • Combinatorics and dynamical systems — The mathematical disciplines of combinatorics and dynamical systems interact in a number of ways. The ergodic theory of dynamical systems has recently been used to prove combinatorial theorems about number theory which has given rise to the field …   Wikipedia

  • Outline of combinatorics — See also: Index of combinatorics articles The following outline is presented as an overview of and topical guide to combinatorics: Combinatorics – branch of mathematics concerning the study of finite or countable discrete structures. Contents 1… …   Wikipedia

  • Symbolic combinatorics — in mathematics is a technique of analytic combinatorics that uses symbolic representations of combinatorial classes to derive their generating functions. The underlying mathematics, including the Pólya enumeration theorem, are explained on the… …   Wikipedia

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Small set (combinatorics) — In combinatorial mathematics, a small set of positive integers:S = {s 0,s 1,s 2,s 3,dots}is one such that the infinite sum:frac{1}{s 0}+frac{1}{s 1}+frac{1}{s 2}+frac{1}{s 3}+cdots converges. A large set is any other set of positive integers (i.e …   Wikipedia

  • Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”