Set Operads in Combinatorics and Computer Science
This monograph has two main objectives. The first one is to give a self-contained exposition of the relevant facts about set operads, in the context of combinatorial species and its operations. This approach has various advantages: one of them is that the definition of combinatorial operations on sp...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | 図書 |
| 言語: | English |
| 出版事項: |
Springer
2015
|
| 主題: | |
| オンライン･アクセス: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/57777 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| 要約: | This monograph has two main objectives. The first one is to give a self-contained exposition of the relevant facts about set operads, in the context of combinatorial species and its operations. This approach has various advantages: one of them is that the definition of combinatorial operations on species, product, sum, substitution and derivative, are simple and natural. They were designed as the set theoretical counterparts of the homonym operations on exponential generating functions, giving an immediate insight on the combinatorial meaning of them. The second objective is more ambitious. Before formulating it, authors present a brief historic account on the sources of decomposition theory. For more than forty years decompositions of discrete structures have been studied in different branches of discrete mathematics: combinatorial optimization, network and graph theory, switching design or boolean functions, simple multi-person games and clutters, etc. |
|---|