Related papers: A Hierarchy of Tree-Automatic Structures

For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…

The automorphism groups ${\rm Aut\,}A_n$ and ${\rm Aut\,}W_n$ of the polynomial algebra $A_n=C[x_1,x_2,\cdots, x_n]$ and the rank $n$ Witt algebra $W_n={\rm Der\,}A_n$ are studied in this paper. It is well-known that ${\rm Aut\,}A_n$ for…

We show that any order isomorphism between ordered structures of associative unital JB-subalgebras of JBW algebras is implemented naturally by a Jordan isomorphism. Consequently, JBW algebras are determined by the structure of their…

A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…

Let $A$ be an $n$-dimensional algebra over a field $k$ and $a(A)$ its quantum symmetry semigroup. We prove that the automorphisms group ${\rm Aut}_{\rm Alg} (A)$ of $A$ is isomorphic to the group $U \bigl( G(a (A)^{\rm o} ) \bigl)$ of all…

We study the cluster automorphism group $Aut(\mathcal{A})$ of a coefficient free cluster algebra $\mathcal{A}$ of finite type. A cluster automorphism of $\mathcal{A}$ is a permutation of the cluster variable set $\mathscr{X}$ that is…

In 2020, Calderoni, Marker, Motto Ros and Shani asked what the Borel complexity of the isomorphism relation of Archimedean orders on $\mathbb{Q}^n$ is. We answer this question by proving that the isomorphism relation of Archimedean orders…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for each such weighted automaton, its run semantics and its…

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…

$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…

Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

We study a structure of the group of unitriangular automorphisms of a free associative algebra and a polynomial algebra and prove that this group is a semi direct product of abelian groups. Using this decomposition we describe a structure…

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 prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an omega-language…

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…

Let $\Lambda_0$ be an ordered abelian group. We show how an $\mathrm{ATF}(\mathbb{Z}\times\Lambda_0)$ group -- that is, a group admitting a free affine action without inversions on a $\mathbb{Z}\times\Lambda_0$-tree -- admits a natural…