Logarithmic combinatorial structures A probabilitic approach

The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible factors, mappings into connected components. In all of these examples, and in many more, there are strong...

Полное описание

Сохранить в:

Библиографические подробности
Главный автор:	Arratia, Richard
Формат:	‌
Язык:	Undetermined
Опубликовано:	Zürich European Mathematical Society 2003.
Предметы:	Asymptotic distribution (Probability theory),Combinatorial probabilities.,Stochastic processes.,Asymptotic expansions.,Phân phối tiệm cận (thuyết xác suất)
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!

Thư viện lưu trữ:	Trung tâm Học liệu Trường Đại học Cần Thơ

Logarithmic combinatorial structures A probabilitic approach

Схожие документы