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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Kirja |
| Kieli: | Undetermined |
| Julkaistu: |
Zürich
European Mathematical Society
2003.
|
| Aiheet: | |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
Lisää ensimmäinen kommentti!