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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Libro |
| Lingua: | Undetermined |
| Pubblicazione: |
Zürich
European Mathematical Society
2003.
|
| Soggetti: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|