Related papers: On semi-Peano algebras
In a recent work of Matteo Mio on compact quantitative equational theories (here compact means that all its consequences are derivable by means of finite proofs) convex algebras on the carrier set [0,1] whose operations are monotone and…
It is known that there are Lie algebras with non-semigroup gradings, i.e. such that the binary operation on the grading set is not associative. We provide a similar example in the class of associative algebras.
In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of algebra, the seed algebra, which describes exactly the behavior of a process within a…
We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…
This is a proposal of an algebra which aims at distributed array processing. The focus lies on re-arranging and distributing array data, which may be multi-dimensional. The context of the work is scientific processing; thus, the core…
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
In analogy with the semi-Fibonacci partitions studied recently by Andrews, we define semi-Pell compositions and semi-$m$-Pell compositions. We find that these are in bijection with certain weakly unimodal $m$-ary compositions. We give…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
General mathematical reasoning is computationally undecidable, but humans routinely solve new problems. Moreover, discoveries developed over centuries are taught to subsequent generations quickly. What structure enables this, and how might…
Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…
Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…
We define a class of associative algebras generalizing 'clannish algebras', as introduced by the second author, but also incorporating semilinear structure, like a skew polynomial ring. Clannish algebras generalize the well known 'string…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
We consider supersymmetry algebras in space-times with arbitrary signature and minimal number of spinor generators. The interrelation between super Poincar\'e and super conformal algebras is elucidated. Minimal super conformal algebras are…
Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri…
For an arbitrary octonion algebra, we determine all subalgebras. It turns out that every subalgebra of dimension less than four is associative, while every subalgebra of dimension greater than four is not associative. In any split octonion…
"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
Many previously studied path algebras or self-similar group algebras may be viewed as Steinberg algebras of self-similar groupoids. By way of inverse semigroup algebras, we characterize when the Steinberg algebra of a self-similar groupoid…