Averaging algebras, Schröder numbers, rooted trees and operads

Abstract

In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to obtain one and two variable generating functions for subsets of averaging words when the averaging operator is taken to be idempotent. When the averaging algebra has an idempotent generator, the generating function in one variable is twice the generating function for large Schröder numbers, leading us to give interpretations of large Schröder numbers in terms of bracketed words and rooted trees, as well as a recursive formula for these numbers. We also give a representation of free averaging algebras by unreduced trees and apply it to give a combinatorial description of the operad of averaging algebras.

30 pages

Cited by in corpus (8)

• Simple finite-dimensional double algebras
• The controlling $L_{\infty }$-algebra, cohomology and homotopy of embedding tensors and Lie-Leibniz triples
• Rota-Baxter operators on the polynomial algebras, integration and averaging operators
• Homogeneous conformal averaging operators on semisimple Lie algebras
• Nonabelian embedding tensors
• Deformations and cohomologies of embedding tensors on 3-Lie algebras
• A new classification of algebraic identities for linear operators on associative algebras
• Dg Loday-Pirashvili modules over Lie algebras