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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Llyfr |
| Iaith: | Undetermined |
| Cyhoeddwyd: |
Zürich
European Mathematical Society
2003.
|
| Pynciau: | |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|