東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Set operads in combinatorics and com...

Medez, Miguel A.

Linked to FindBook

Google Book

Amazon

博客來

Set operads in combinatorics and computer science

Record Type:	Electronic resources : Monograph/item
Title/Author:	Set operads in combinatorics and computer science/ by Miguel A. Mendez.
Author:	Medez, Miguel A.
Published:	Cham :Springer International Publishing : : 2015.,
Description:	xv, 129 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Operads. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-11713-3
ISBN:	9783319117133 (electronic bk.)

Set operads in combinatorics and computer science
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:

752049
Operads.

LC Class. No.: QA169

Dewey Class. No.: 512.62

Set operads in combinatorics and computer science
LDR:02206nmm a2200337 a 4500 001 1995042
003 DE-He213
005 20150903132038.0
006 m d
007 cr nn 008maaau
008 151019s2015 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 2134218
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 0 $a Operads. $3 752049
650 0 $a Decomposition method. $3 606981
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Categories (Mathematics) $3 525955
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Special Functions. $3 897326
650 2 4 $a Complex Systems. $3 1566441
650 2 4 $a Operator Theory. $3 897311
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a SpringerBriefs in mathematics. $3 1566700
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-11713-3
950 $a Mathematics and Statistics (Springer-11649)