Related papers: Polygraphic resolutions for operated algebras
In this article we give a construction of a polynomial 2-monad from an operad and describe the algebras of the 2-monads which then arise. This construction is different from the standard construction of a monad from an operad in that the…
Two sets of mutually commuting $q-$difference operators $x_i$ and $y_j$, $i,j=1, ...,N$ such that $x_i$ and $y_i$ generate a homomorphic image of the $q-$Onsager algebra for each $i$ are introduced. The common polynomial eigenfunctions of…
We construct integrals of motion for multidimensional classical systems from ladder operators of one-dimensional systems. This method can be used to obtain new systems with higher order integrals. We show how these integrals generate a…
We establish the Gr\"obner-Shirshov bases theory for differential Lie $\Omega$-algebras. As an application, we give a linear basis of a free differential Lie Rota-Baxter algebra on a set.
In these notes, we define a new simplicial structure on a connected multiplicative operad and call it connected multiplicative simplicial operad (for short; simplicial operad). Next we introduce on this simplicial operad a brace algebra…
We present the plactic algebra on an arbitrary alphabet set $A$ by row generators and column generators respectively. We give Gr\"{o}bner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"{o}bner-Shirshov…
In this paper, we give a linear basis of a free Rota-Baxter system on a set by using the Gr\"{o}bner-Shirshov bases method and then we obtain a left counital Hopf algebra structure on a free Rota-Baxter system.
In this paper, we obtain respectively some new linear bases of free unitary (modified) weighted differential algebras and free nonunitary (modified) Rota-Baxter algebras, in terms of the method of Gr\"{o}bner-Shirshov bases.
We study diverse parametrized versions of the operad of associative algebra, where the parameter are taken in an associative semigroup $\Omega$ (generalization of matching or family associative algebras) or in its cartesian square…
A Rota-Baxter algebra, also known as a Baxter algebra, is an algebra with a linear operator satisfying a relation, called the Rota-Baxter relation, that generalizes the integration by parts formula. Most of the studies on Rota-Baxter…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
Using the combinatorial species setting, we propose two new operad structures on multigraphs and on pointed oriented multigraphs. The former can be considered as a canonical operad on multigraphs, directly generalizing the…
A classical E-infinity operad is formed by the bar construction of the symmetric groups. Such an operad has been introduced by M. Barratt and P. Eccles in the context of simplicial sets in order to have an analogue of the Milnor…
We develop an operator algebraic framework for generalized Cardano polynomials and show how their structure naturally leads to an operator formulation of Cardano method that is compatible with tools and concepts from quantum information…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We set up an algebraic theory of multivariable integration, based on a hierarchy of Rota-Baxter operators and an action of the matrix monoid as linear substitutions. Given a suitable coefficient domain with a bialgebra structure, this…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not…
This dissertation concerns the classification of groupoid and higher-rank graph C*-algebras and has two main components. Firstly, for a groupoid it is shown that the notions of strength of convergence in the orbit space and…