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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Knjiga |
| Jezik: | Undetermined |
| Izdano: |
Zürich
European Mathematical Society
2003.
|
| Teme: | |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
Budi prvi tko komentira!