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...
Đã lưu trong:
| Hovedforfatter: | |
|---|---|
| Format: | Bog |
| Sprog: | Undetermined |
| Udgivet: |
Zürich
European Mathematical Society
2003.
|
| Fag: | |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|