Colored operads, series on colored operads, and combinatorial generating systems

DOI10.1016/J.DISC.2019.02.008MaRDI QIDQ1999730zbMATH OpenOpenAlexWikidataFDO

Authors Samuele Giraudo

Publication date 27 June 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.04697

zbMATH Keywords

colored operadcombinatorial generationformal power seriesgrammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Abstract: We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way. The theory of bud generating systems uses colored operads. Indeed, an object is generated by a bud generating system if it satisfies a certain equation in a colored operad. To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these. Series on colored operads are crucial to express the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics. Some examples of bud generating systems are constructed; in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.

Recommendations

• Nonsymmetric operads in combinatorics
• On generating series of finitely presented operads
• On generating series of coloured planar trees
• Operads and algebraic combinatorics of trees
• Colored operads

Cites work

• A rooted-trees q-series lifting a one-parameter family of Lie idempotents
• Algebraic operads
• Analytic combinatorics
• Automata, Languages and Programming
• Categorical algebra
• Colored operads
• Combinatorial operads from monoids
• Compression of individual sequences via variable-rate coding
• Context-free series on trees
• Data compression via textual substitution
• Elements of automata theory. Translated from the French by Reuben Thomas
• Encyclopedia of Types of Algebras 2010
• Enveloping operads and bicolored noncrossing configurations
• Groups of tree-expanded series.
• Homotopy invariant algebraic structures on topological spaces
• scientific article; zbMATH DE number 1644416 (Why is no real title available?)
• scientific article; zbMATH DE number 6010972 (Why is no real title available?)
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 4075068 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3225176 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• Intervals of balanced binary trees in the Tamari lattice
• Introduction to algorithms.
• On certain formal properties of grammars
• On the definition of a family of automata
• Operadic construction of the renormalization group
• Operads and algebraic combinatorics of trees
• Operads and PROPs
• Operads from posets and Koszul duality
• Operads of finite posets
• Optimal 2,3-Trees
• Periodic oscillations of coefficients of power series that satisfy functional equations
• Pluriassociative algebras. I: The pluriassociative operad.
• Pre-Lie algebras and the rooted trees operad
• Recognizable formal power series on trees
• Set Operads in Combinatorics and Computer Science
• Term Rewriting and All That
• The algebra of binary search trees
• The cohomology structure of an associative ring
• The complexity of tree automata and XPath on grammar-compressed trees
• The geometry of iterated loop spaces

Cited in

(6)

• Duality of graded graphs through operads
• Tree series and pattern avoidance in syntax trees
• Colored operads
• Multilinear representations of free pros
• The (co)homology of the Deligne-Mumford moduli spaces of marked rational curves
• Clones of pigmented words and realizations of special classes of monoids

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Colored operads, series on colored operads, and combinatorial generating systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999730)