Related papers: Arrow type impossibility theorems over median alge…
If $\mathcal{C}$ is a category of algebras closed under finite direct products, and $M_\mathcal{C}$ the commutative monoid of isomorphism classes of members of $\mathcal{C},$ with operation induced by direct product, A.Tarski defined a…
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…
We discuss the internal structure of graph products of right LCM semigroups and prove that there is an abundance of examples without property (AR). Thereby we provide the first examples of right LCM semigroups lacking this seemingly common…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
We define a basic class of algebras which we call homotopy path algebras. We find that such algebras always admit a cellular resolution and detail the intimate relationship between these algebras, stratifications of topological spaces, and…
In this paper, we investigate the ideals of semidirect products of L-algebras and the structure of simple L-algebras. We provide a precise characterization of the ideals of semidirect products and describe the structure of their prime…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the…
First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…
Motivated by M-theory, we define a new type of non-associative algebra involving usual and cubic matrices at the same time. The resulting algebra can be regarded as a two-term truncated $L_\infty$ algebra giving rise to a fundamental…
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The…
We give a classification of semisimple and separable algebras in a multi-fusion category over an arbitrary field in analogy to Wedderben-Artin theorem in classical algebras. It turns out that, if the multi-fusion category admits a…
The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…
Curved algebras are algebras endowed with a predifferential, which is an endomorphism of degree -1 whose square is not necessarily 0. This makes the usual definition of quasi-isomorphism meaningless and therefore the homotopical study of…
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…
Generalizing von Neumann's result on type II$_1$ von Neumann algebras, we characterize lattice isomorphisms between projection lattices of arbitrary von Neumann algebras by means of ring isomorphisms between the algebras of locally…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…