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...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Llibre |
| Idioma: | Undetermined |
| Publicat: |
Zürich
European Mathematical Society
2003.
|
| Matèries: | |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
Sigues el primer a deixar un comentari!