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...
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Boek |
| Taal: | Undetermined |
| Gepubliceerd in: |
Zürich
European Mathematical Society
2003.
|
| Onderwerpen: | |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|