Related papers: Free dendriform dialgebras: reformulation and appl…
Dendriform structures arise naturally in algebraic combinatorics (where they allow, for example, the splitting of the shuffle product into two pieces) and through Rota-Baxter algebra structures (the latter appear, among others, in…
We generalize to arbitrary categories of algebras the notion of an NS-algebra. We do this by using a bimodule property, as we did for defining the general notions of a dendriform and tridendriform algebra. We show that several types of…
We consider an array of random variables, taking values in a complete and separable metric space, that exhibits a kind of symmetry which we call row exchangeability. Given such an array, a natural model for Bayesian nonparametric inference…
Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races. HCP is a reformulation of CP which addresses a fundamental shortcoming: the…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
We develop the notion of the composition of two coalgebras, which arises naturally in higher category theory and the theory of species. We prove that the composition of two cofree coalgebras is cofree and give conditions which imply that…
One can build an operatorial model for freeness by considering either the right-handed or the left-handed representation of algebras of operators acting on the free product of the underlying pointed Hilbert spaces. Considering both at the…
Derived $A_\infty$-algebras have a wealth of theoretical advantages over regular $A_\infty$-algebras. However, due to their bigraded nature, in practice they are often unwieldy to work with. We develop a framework involving brace algebras…
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…
This research introduces a new parsing approach, based on earlier syntactic work on context free grammar (CFG) and generalized phrase structure grammar (GPSG). The approach comprises both a new parsing algorithm and a set of syntactic rules…
This paper is a sequel to "Computing diagonal form and Jacobson normal form of a matrix using Groebner bases", J. of Symb. Computation, 46 (5), 2011. We present a new fraction-free algorithm for the computation of a diagonal form of a…
In this work, we introduce multi-Novikov algebras, a generalisation of Novikov algebras with several binary operations indexed by a given set, and show that the multi-indices recently introduced in the context of singular stochastic partial…
We briefly review and illustrate our procedure to 'decouple' by transformation of generators: either a Hopf algebra $H$ from a $H$-module algebra $A_1$ in their cross-product $A_1 >\triangleleft H$; or two (or more) $H$-module algebras…
To a planar algebra P in the sense of Jones we associate a natural non- commutative ring, which can be viewed as the ring of non-commutative polynomials in several indeterminates, invariant under a symmetry encoded by P. We show that this…
We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The latter notion is a simple generalization of the former…
The category of crossed complexes gives an algebraic model of CW-complexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to…
We define higher order infinitesimal noncommutative probability space and infinitesimal non-crossing cumulant functionals. In this framework, we generalize to higher order the notion of infinitesimal freeness, via a vanishing of mixed…
We introduce a noncommutative binary operation on matroids, called free product. We show that this operation respects matroid duality, and has the property that, given only the cardinalities, an ordered pair of matroids may be recovered, up…
This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…