Related papers: Averaging algebras, Schr\"oder numbers, rooted tre…
We examine two nonselfadjoint operator algebras: the weighted shift algebra, and the Volterra operator algebra. In both cases, the operator algebra is the norm closure of the polynomials in the operator norm. In the case of the weighted…
We exhibit a singly generated, semisimple commutative operator algebra with a contractive approximate identity, such that the spectrum of the generator is a null sequence and zero, but the algebra is not the closed linear span of the…
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators $\mathfrak{G}$…
We propose an operadic framework suitable for describing algebraic structures with operations being multilinear differential operators of varying orders or, more generally, formal series of such operators. The framework is built upon the…
Vertex operator algebras are mathematically rigorous objects corresponding to chiral algebras in conformal field theory. Operads are mathematical devices to describe operations, that is, $n$-ary operations for all $n$ greater than or equal…
In this paper, we prove results on enumerations of sets of Rota-Baxter words in a finite number of generators and a finite number of unary operators. Rota-Baxter words are words formed by concatenating generators and images of words under…
We decribe the correspondence between normalised $\omega$-operads and certain lax monoidal structures on the category of globular sets. As with ordinary monoidal categories, one has a notion of category enriched in a lax monoidal category.…
We continue our reformulation of free dendriform algebras, dealing this time with the free dendriform trialgebra generated be Y over planar rooted trees. We propose a 'deformation' of a vectorial coding used in Part I, giving a LL-lattice…
Clifford geometric algebras of multivectors are treated in detail. These algebras are build over a graded space and exhibit a grading or multivector structure. The careful study of the endomorphisms of this space makes it clear, that…
We study the structure and properties of free skew Boolean algebras. For finite generating sets, these free algebras are finite and we give their representation as a product of primitive algebras and provide formulas for calculating their…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…
We study composition operators on the weighted Banach spaces of an infinite tree. We characterize the bounded and the compact operators, as well as determine the operator norm and the essential norm. In addition, we study the isometric…
We study the ring of regular functions on the space of planar electrical networks, which we coin the grove algebra. This algebra is an electrical analogue of the Pl\"ucker ring studied classically in invariant theory. We develop the…
A set-operad is a monoid in the category of combinatorial species with respect to the operation of substitution. From a set-operad, we give here a simple construction of a Hopf algebra that we call {\em the natural Hopf algebra} of the…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Projection operators are important in Analysis, Optimization and Algorithm. It is well known that these operators are firmly nonexpansive. In this paper, we provide an exact result that sharpens this well-known result. We develop the theory…
The associative operad is a certain algebraic structure on the sequence of group algebras of the symmetric groups. The weak order is a partial order on the symmetric group. There is a natural linear basis of each symmetric group algebra,…
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…