大葉大學圖書館 |

Set operads in combinatorics and computer science[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	512.62
書名/作者:	Set operads in combinatorics and computer science/ by Miguel A. Mendez.
作者:	Medez, Miguel A.
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xv, 129 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Operator Theory.
標題:	Operads.
標題:	Decomposition method.
標題:	Computer science - Mathematics.
標題:	Categories (Mathematics)
標題:	Mathematics.
標題:	Special Functions.
標題:	Complex Systems.
ISBN:	9783319117133 (electronic bk.)
ISBN:	9783319117126 (paper)
內容註:	Introduction -- Preliminaries on Species and Set Operads -- Operations on Species and Set Operads -- Decomposition Theory -- Rigid Operads -- Posets from Cancellative Operads and Koszul Duality -- Appendix.
摘要、提要註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-11713-3

Set operads in combinatorics and computer science[electronic resource] /
Medez, Miguel A.

Set operads in combinatorics and computer science[electronic resource] /by Miguel A. Mendez. - Cham :Springer International Publishing :2015. - xv, 129 p. :ill., digital ;24 cm. - SpringerBriefs in mathematics,2191-8198. - SpringerBriefs in mathematics..

Introduction -- Preliminaries on Species and Set Operads -- Operations on Species and Set Operads -- Decomposition Theory -- Rigid Operads -- Posets from Cancellative Operads and Koszul Duality -- Appendix.

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.

ISBN: 9783319117133 (electronic bk.)

Standard No.: 10.1007/978-3-319-11713-3doiSubjects--Topical Terms:

464906
Operator Theory.

LC Class. No.: QA169

Dewey Class. No.: 512.62

Set operads in combinatorics and computer science[electronic resource] /
LDR:02206nam a2200337 a 4500 001 426436
003 DE-He213
005 20150903132038.0
006 m d
007 cr nn 008maaau
008 151119s2015 gw s 0 eng d
020 $a 9783319117133 (electronic bk.)
020 $a 9783319117126 (paper)
024 7 $a 10.1007/978-3-319-11713-3 $2 doi
035 $a 978-3-319-11713-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA169
072 7 $a PBKF $2 bicssc
072 7 $a MAT034000 $2 bisacsh
072 7 $a MAT037000 $2 bisacsh
082 0 4 $a 512.62 $2 23
090 $a QA169 $b .M488 2015
100 1 $a Medez, Miguel A. $3 606451
245 1 0 $a Set operads in combinatorics and computer science $h [electronic resource] / $c by Miguel A. Mendez.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xv, 129 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in mathematics, $x 2191-8198
505 0 $a Introduction -- Preliminaries on Species and Set Operads -- Operations on Species and Set Operads -- Decomposition Theory -- Rigid Operads -- Posets from Cancellative Operads and Koszul Duality -- Appendix.
520 $a 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.
650 2 4 $a Operator Theory. $3 464906
650 0 $a Operads. $3 606452
650 0 $a Decomposition method. $3 455713
650 0 $a Computer science $x Mathematics. $3 382369
650 0 $a Categories (Mathematics) $3 443415
650 1 4 $a Mathematics. $3 172349
650 2 4 $a Special Functions. $3 464115
650 2 4 $a Complex Systems. $3 465366
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a SpringerBriefs in mathematics. $3 465744
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-11713-3
950 $a Mathematics and Statistics (Springer-11649)