Related papers: The Isomorphism Relation Between Tree-Automatic St…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is analytic-complete as a set in Cantor space. This already shows that the unambiguous languages are topologically more complex than…
We describe a completely algebraic axiom system for intertwining operators of vertex algebra modules, using algebraic flat connections, thus formulating the concept of a {\em tree algebra}. Using the Riemann-Hilbert correspondence, we…
In algebraic geometry over a variety of universal algebras $\Theta $, the group $Aut(\Theta ^{0})$ of automorphisms of the category $\Theta ^{0}$ of finitely generated free algebras of $\Theta $ is of great importance. In this paper,…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
We consider the problem of characterizing the class of those permutation groups that are the symmetry groups of Boolean functions. These are exactly the automorphism groups of hypergraphs. They are also called the relation groups. In this…
This paper addresses several structural aspects of the insertion-elimination algebra, a Lie algebra that can be realized in terms of tree-inserting and tree-eliminating operations on the set of rooted trees. In particular, we determine the…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
We classify isomorphic classes of the homomorphisms of a root system $\Xi$ to a root system $\Sigma$ which do not change Cartan integers. We examine several types of isomorphic classes defined by the Weyl group of $\Sigma$, that of $\Xi$…
We construct via Fra\"iss\'e amalgamation an $\omega$-categorical structure whose automorphism group is an infinite oligomorphic Jordan primitive permutation group preserving a `limit of $D$-relations'. The construction is based on a…
This paper addresses the isomorphism problem for the universal (nonself-adjoint) operator algebras generated by a row contraction subject to homogeneous polynomial relations. We find that two such algebras are isometrically isomorphic if…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that Arrow type impossibility theorems for mappings from a…
A basic finite dimensional algebra over an algebraically closed field $k$ is isomorphic to a quotient of a tensor algebra by an admissible ideal. The category of left modules over the algebra is isomorphic to the category of representations…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
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…
A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…