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...
Đã lưu trong:
主要作者: | |
---|---|
格式: | 图书 |
语言: | Undetermined |
出版: |
Zürich
European Mathematical Society
2003.
|
主题: | |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
---|