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...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | ספר |
| שפה: | 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ơ |
|---|
היה/י הראשונ/ה לכתוב הערה!