國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Nonsymmetric operads in combinatorics

Giraudo, Samuele.

Nonsymmetric operads in combinatorics

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Nonsymmetric operads in combinatoricsby Samuele Giraudo.
作者:	Giraudo, Samuele.
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	ix, 172 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Operads.
電子資源:	https://doi.org/10.1007/978-3-030-02074-3
ISBN:	9783030020743$q(electronic bk.)

Nonsymmetric operads in combinatorics
Giraudo, Samuele.

Nonsymmetric operads in combinatorics[electronic resource] /by Samuele Giraudo. - Cham :Springer International Publishing :2018. - ix, 172 p. :ill., digital ;24 cm.

Combinatorial Structures -- Trees and rewrite rules -- Combinatorial operands -- Main combinatorial operands -- Constructions, applications and generalizations.

Operads are algebraic devices offering a formalization of the concept of operations with several inputs and one output. Such operations can be naturally composed to form more complex ones. Coming historically from algebraic topology, operads intervene now as important objects in computer science and in combinatorics. A lot of operads involving combinatorial objects highlight some of their properties and allow to discover new ones. This book portrays the main elements of this theory under a combinatorial point of view and exposes the links it maintains with computer science and combinatorics. Examples of operads appearing in combinatorics are studied. The modern treatment of operads consisting in considering the space of formal power series associated with an operad is developed. Enrichments of nonsymmetric operads as colored, cyclic, and symmetric operads are reviewed.

ISBN: 9783030020743$q(electronic bk.)

Standard No.: 10.1007/978-3-030-02074-3doiSubjects--Topical Terms:

348596
Operads.

LC Class. No.: QA169

Dewey Class. No.: 512.62

Nonsymmetric operads in combinatorics
LDR:01970nmm a2200325 a 4500 001 546711
003 DE-He213
005 20190104203610.0
006 m d
007 cr nn 008maaau
008 190627s2018 gw s 0 eng d
020 $a 9783030020743$q(electronic bk.)
020 $a 9783030020736$q(paper)
024 7 $a 10.1007/978-3-030-02074-3 $2 doi
035 $a 978-3-030-02074-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA169
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 512.62 $2 23
090 $a QA169 $b .G522 2018
100 1 $a Giraudo, Samuele. $3 825719
245 1 0 $a Nonsymmetric operads in combinatorics $h [electronic resource] / $c by Samuele Giraudo.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a ix, 172 p. : $b ill., digital ; $c 24 cm.
505 0 $a Combinatorial Structures -- Trees and rewrite rules -- Combinatorial operands -- Main combinatorial operands -- Constructions, applications and generalizations.
520 $a Operads are algebraic devices offering a formalization of the concept of operations with several inputs and one output. Such operations can be naturally composed to form more complex ones. Coming historically from algebraic topology, operads intervene now as important objects in computer science and in combinatorics. A lot of operads involving combinatorial objects highlight some of their properties and allow to discover new ones. This book portrays the main elements of this theory under a combinatorial point of view and exposes the links it maintains with computer science and combinatorics. Examples of operads appearing in combinatorics are studied. The modern treatment of operads consisting in considering the space of formal power series associated with an operad is developed. Enrichments of nonsymmetric operads as colored, cyclic, and symmetric operads are reviewed.
650 0 $a Operads. $3 348596
650 0 $a Combinatorial analysis. $3 182280
650 1 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Math Applications in Computer Science. $3 273991
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u https://doi.org/10.1007/978-3-030-02074-3
950 $a Computer Science (Springer-11645)