Nonsymmetric Operads in Combinatorics

ISBN-13: 9783030020736 / Angielski / Twarda / 2019 / 172 str.

Samuele Giraudo

Opis

This book presents the theory of nonsymmetric operads from a combinatorial point-of-view. It portrays the main elements of this theory and the links it maintains with several areas of computer science and combinatorics. Many examples of operads appearing in combinatorics are studied and some constructions relating operads with known algebraic structures are presented. The modern treatment of operads consisting in considering the space of formal power series associated with an operad is developed. This text is addressed to any computer scientist or combinatorist who looks for a complete and modern description of the theory of nonsymmetric operads.

Spis treści

- Chapter 1. Combinatorial Structures

 1. Combinatorial sets and combinatorial objects

 1.1 Combinatorial sets

 1.2 Operations over combinatorial sets

 1.3 Main combinatorial sets

 2. Combinatorial spaces

 2.1 Polynomials on combinatorial sets

 2.2 Operations over combinatorial spaces

 2.3 Combinatorial bialgebras

 2.4 Types of combinatorial bialgebras

- Chapter 2. Trees and rewrite rules

 1. Syntax trees

 1.1 planar rooted trees

 1.2 Families of planar rooted trees

 1.3 syntax trees

 2 Rewrite rules

 2.1 Combinatorial posets

 2.2 Rewrite rules on combinatorial sets

 2.3 Rewrite ruls on combinatorial spaces

 2.4 Syntax tree patterns and rewrite rules

- Chapter 3 Combinatorial operands

 1. Nonsymmetric operands

 2 Free operands

 3 Presentation by generators and relations

 4 Algebras over operands

 5 Koszul operands and Koszul duality

- Chapter 4 Main combinatorial operands

 1. Associative and magmatic operands

 2 Operands and permutations

 3 Dendriform operand

 4 operands of rational fractions

- Chapter 5 Constructions, applications and generalizations

 1. Series on operands

 2 Functors to operands

 3 Functors from operands

 4 Beyond operands

O autorze

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.

Blurb

​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.