Related papers: Reynolds algebras and their free objects from brac…
W. Magnus introduced a particular differential equation characterizing the logarithm of the solution of linear initial value problems for linear operators. The recursive solution of this differential equation leads to a peculiar Lie series,…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
In the present paper derivations and *-automorphisms of algebras of unbounded operators over the ring of measurable functions are investigated and it is shown that all L^0-linear derivations and L^{0}-linear *-automorphisms are inner.…
These pedagogical lecture notes address to the students in theoretical physics for helping them to understand the mechanisms of the linear operators defined on finite-dimensional vector spaces equipped with definite or indefinite inner…
Many interesting examples of operator algebras, both self-adjoint and non-self-adjoint, can be constructed from directed graphs. In this survey, we overview the construction of $C^*$-algebras from directed graphs and from two…
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
For every operator space $X$ the $C^\ast$-algebra containing it in a universal way is residually finite-dimensional (that is, has a separating family of finite-dimensional representations). In particular, the free $C^\ast$-algebra on any…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
This paper defines the algebraic structure of tracial post-Lie-Rinehart algebras and describes the free object in this category. Post-Lie-Rinehart algebras is a generalisation of pre-Lie-Rinehart algebras, and of post-Lie algebroids.
Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive…
This paper studies Rota-Baxter, Reynolds, Nijenhuis, and Averaging operators on 2-dimensional pre-Lie algebras over $\mathbb{C}$. Using the classification of 2-dimensional pre-Lie algebras and computational tools like Mathematica or Maple,…
These are lecture notes for a course on the theory of Clifford algebras, with special emphasis on their wide range of applications in mathematics and physics. Clifford algebra is introduced both through a conventional tensor algebra…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
Bracketed words are basic structures both in mathematics (such as Rota-Baxter algebras) and mathematical physics (such as rooted trees) where the locations of the substructures are important. In this paper we give the classification of the…