Displaying similar documents to “A simple symmetry generating operads related to rooted planar m -ary trees and polygonal numbers.”

Sets with two associative operations

Teimuraz Pirashvili (2003)

Open Mathematics

Similarity:

In this paper we consider duplexes, which are sets with two associative binary operations. Dimonoids in the sense of Loday are examples of duplexes. The set of all permutations carries a structure of a duplex. Our main result asserts that it is a free duplex with an explicitly described set of generators. The proof uses a construction of the free duplex with one generator by planary trees.

Free Term Algebras

Grzegorz Bancerek (2012)

Formalized Mathematics

Similarity:

We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler...

A semantic construction of two-ary integers

Gabriele Ricci (2005)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex. We use a semantic construction to get this extension....

Categorification of Hopf algebras of rooted trees

Joachim Kock (2013)

Open Mathematics

Similarity:

We exhibit a monoidal structure on the category of finite sets indexed by P-trees for a finitary polynomial endofunctor P. This structure categorifies the monoid scheme (over Spec ℕ) whose semiring of functions is (a P-version of) the Connes-Kreimer bialgebra H of rooted trees (a Hopf algebra after base change to ℤ and collapsing H 0). The monoidal structure is itself given by a polynomial functor, represented by three easily described set maps; we show that these maps are the same as...

Operads of decorated trees and their duals

Vsevolod Yu. Gubarev, Pavel S. Kolesnikov (2014)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This is an extended version of a talk presented by the second author on the Third Mile High Conference on Nonassociative Mathematics (August 2013, Denver, CO). The purpose of this paper is twofold. First, we would like to review the technique developed in a series of papers for various classes of di-algebras and show how the same ideas work for tri-algebras. Second, we present a general approach to the definition of pre- and post-algebras which turns out to be equivalent to the construction...