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...

詳細記述

保存先:
書誌詳細
第一著者: Arratia, Richard
フォーマット: 図書
言語: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ơ

類似資料