Related papers: Operated semigroups, Motzkin paths and rooted tree…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
Rota-Baxter algebras and the closely related dendriform algebras have important physics applications, especially to renormalization of quantum field theory. Braided structures provide effective ways of quantization such as for quantum…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
Orbital semilattices are introduced as bounded semilattices that are, in addition, equipped with an outer multiplication (a semigroup action) and diagonals (a concept borrowed from cylindric algebra), where each semilattice element has a…
We give a new construction of a Hopf algebra defined first by Reading whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e., Baxter permutations, pairs of twin binary trees, etc.). Our construction relies on…
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…
The notion of a modified Rota-Baxter algebra comes from the combination of those of a Rota-Baxter algebra and a modified Yang-Baxter equation. In this paper, we first construct free modified Rota-Baxter algebras. We then equip a free…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…
We give combinatorially controlled series solutions to Dyson--Schwinger equations with multiple insertion places using tubings of rooted trees and investigate the algebraic relation between such solutions and the renormalization group…
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…
As a generalization of skew braces, the notion of skew trusses was introduced by T. Brzezinski. It was shown that every Rota-Baxter group has the structure of skew braces by V. G. Bardakov and V. Gubarev. To investigate an analogue of…
In this letter, we use quantum quasi-shuffle algebras to construct Rota-Baxter algebras, as well as tridendriform algebras. We also propose the notion of braided Rota-Baxter algebras, which is the relevant object of Rota-Baxter algebras in…
In this paper we study associative algebras with a Poisson algebra structure on the center acting by derivations on the rest of the algebra. These structures, which we call Poisson fibred algebras, appear in the study of quantum groups at…
This paper provides a general operadic definition for the notion of splitting the operations of algebraic structures. This construction is proved to be equivalent to some Manin products of operads and it is shown to be closely related to…
We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
We present a bijection from planar reduced trees to planar rooted hypertrees, which extends Knuth's rotation correspondence between planar binary trees and planar rooted trees. The operadic counterpart of the new bijection is explained.…