Wilf classes of non-symmetric operads

by   Andrey T. Cherkasov, et al.

Two operads are said to belong to the same Wilf class if they have the same generating series. We discuss possible Wilf classifications of non-symmetric operads with monomial relations. As a corollary, this would give the same classification for the operads with a finite Groebner basis. Generally, there is no algorithm to decide whether two finitely presented operads belong to the same Wilf class. Still, we show that if an operad has a finite Groebner basis, then the monomial basis of the operad forms an unambiguous context-free language. Moreover, we discuss the deterministic grammar which defines the language. The generating series of the operad can be obtained as a result of an algorithmic elimination of variables from the algebraic system of equations defined by the Chomsky–Schutzenberger enumeration theorem. We then focus on the case of binary operads with a single relation. The approach is based on the results by Rowland on pattern avoidance in binary trees. We improve and refine Rowland's calculations and empirically confirm his conjecture. Here we use both the algebraic elimination and the direct calculation of formal power series from algebraic systems of equations. Finally, we discuss the connection of Wilf classes with algorithms for the Quillen homology of operads calculation.


page 1

page 2

page 3

page 4


Multiplicity Problems on Algebraic Series and Context-Free Grammars

In this paper we obtain complexity bounds for computational problems on ...

Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables

In this paper we study systems of autonomous algebraic ODEs in several d...

Bounds for elimination of unknowns in systems of differential-algebraic equations

Elimination of unknowns in systems of equations, starting with Gaussian ...

Notes on Computational Graph and Jacobian Accumulation

The optimal calculation order of a computational graph can be represente...

Stream/block ciphers, difference equations and algebraic attacks

In this paper we model a class of stream and block ciphers as systems of...

A New Foundation for Finitary Corecursion and Iterative Algebras

This paper contributes to a theory of the behaviour of "finite-state" sy...

A Class of Trees Having Near-Best Balance

Full binary trees naturally represent commutative non-associative produc...

Please sign up or login with your details

Forgot password? Click here to reset