Nonsymmetric Operads in Combinatorics
Seiten
2019
|
1st ed. 2018
Springer International Publishing (Verlag)
978-3-030-02073-6 (ISBN)
Springer International Publishing (Verlag)
978-3-030-02073-6 (ISBN)
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.
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.
Samuele Giraudo is an associate professor at LIGM, University of Paris-Est Marne-la-Vallée in France. He received a PhD and then an accreditation to supervise research, both in computer science. His research interests are primarily in combinatorics and algebraic combinatorics. His research works focus on Hopf bialgeras, operads, and applications of methods coming from algebra to solve enumerative problems.
Combinatorial Structures.- Trees and rewrite rules.- Combinatorial operands.- Main combinatorial operands.- Constructions, applications and generalizations.
Erscheinungsdatum | 20.01.2019 |
---|---|
Reihe/Serie | SpringerBriefs in Computer Science |
Zusatzinfo | IX, 172 p. 161 illus., 157 illus. in color. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 433 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Mathematik / Informatik ► Mathematik ► Computerprogramme / Computeralgebra | |
Schlagworte | combinatorics • Formal power series • Nonsymmetric operands • Rewrite rules • Trees |
ISBN-10 | 3-030-02073-8 / 3030020738 |
ISBN-13 | 978-3-030-02073-6 / 9783030020736 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95