My Account Log in

1 option

Nonsymmetric Operads in Combinatorics / by Samuele Giraudo.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Author/Creator:
Giraudo, Samuele, author.
Contributor:
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Language:
English
Subjects (All):
Logic, Symbolic and mathematical.
Computer science--Mathematics.
Computer science.
Mathematical Logic and Formal Languages.
Math Applications in Computer Science.
Discrete Mathematics in Computer Science.
Local Subjects:
Mathematical Logic and Formal Languages.
Math Applications in Computer Science.
Discrete Mathematics in Computer Science.
Physical Description:
1 online resource (IX, 172 pages) : 161 illustrations, 157 illustrations in color
Edition:
First edition 2018.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2018.
System Details:
text file PDF
Summary:
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.
Contents:
Combinatorial Structures
Trees and rewrite rules
Combinatorial operands
Main combinatorial operands
Constructions, applications and generalizations.
Other Format:
Printed edition:
ISBN:
978-3-030-02074-3
9783030020743
9783030020736
9783030020750
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account