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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | Undetermined |
| Published: |
Zürich
European Mathematical Society
2003.
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institutions: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|