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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Livro |
| Idioma: | Undetermined |
| Publicado em: |
Zürich
European Mathematical Society
2003.
|
| Assuntos: | |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|