Wilf H.S. Generatingfunctionology

формат pdf
размер 1.54 МБ
добавлен 03 июля 2011 г.

A K Peters, 2006. - 245 pages.
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in.
* Combinatorics.
* Probability Theory.
* Statistics.
* Theory of Markov Chains.
* Number Theory.
One of the most important and relevant recent applications of combinatorics lies in the development of Inteet search engines whose incredible capabilities dazzle even the mathematically trained user.

Похожие разделы

Смотрите также

Blanchet-Sadri F. Algorithmic Combinatorics on Partial Words

формат pdf
размер 2.35 МБ
добавлен 06 октября 2011 г.

Издательство Chapman & Hall/CRC, 2008, -391 pp. biology, nano-technology, data communication, and DNA computing [104]. Partial words are currently being considered, in particular, for finding good encodings for DNA computations. Courses, covering different sets of topics, are already being taught at some universities. The time seems right for a book that develops, in a clear manner, some of the central ideas and results of this area, as well...

Nijenhuis A., Wilf H.S. Combinatorial Algorithms for Computers and Calculators

формат pdf
размер 5.37 МБ
добавлен 04 октября 2011 г.

Издательство Academic Press, 1978, -316 pp. Описан набор эффективных по скорости и памяти комбинаторных алгоритмов. Содержит подробное описание алгоритмов и код на Фортране. Combinatorial families. Next Subset of an n-Set. Random Subset of an n-Set. Next k-Subset of an n-Set. Random k-Subset of an n-Set. Next Composition of n into k Parts. Random Composition of n into k Parts. Next Permutation of n Letters. Random Permutation of n Letters. Next P...

Nowakowski R.J. Games of no Chance

формат pdf
размер 6.32 МБ
добавлен 28 октября 2011 г.

Издательство MRSI, 1996, -482 pp. Combinatorial Game Theory, as an academic discipline, is still in its infancy. Many analyses of individual games have appeared in print, starting in 1902 with C. L. Bouton's analysis of the game of Nim. (For exact references to the works mentioned here, please see A. Fraenkel's bibliography on pages 493. It is was not until the 1930's that a consistent theory for impartial games was developed, independently, by...

Wilf H.S. Lectures on Integer Partitions

формат pdf
размер 285.6 КБ
добавлен 30 января 2012 г.

University of Pennsylvania, 2000. - 35 pages. Contents. Overview. Basic Generating Functions. Identities and Asymptotics. Pentagonal Numbers and Prefabs. The Involution Principle. Remmel’s bijection machine. Sieve equivalence. Gordon’s algorithm. The accelerated algorithm of Kathy O’Hara. Equidistributed partition statistics. Counting the rational numbers. References.