Related papers: Automatic Rees matrix semigroups over categories
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…
The purpose of this paper is to show how Rees algebras can be applied in the study of singularities embedded in smooth schemes over perfect fields. In particular, we will study situations in which the multiplicity of a hypersurface is a…
We explore the connection between ring homomorphisms and semigroup homomorphisms on matrix algebras over rings or $C^*$-algebras.
This paper studies automatic structures for subsemigroups of Baumslag--Solitar semigroups (that is, semigroups presented by $\ < x,y \mid (yx^m, x^ny)\ >$, where $m$ and $n$ are natural numbers). A geometric argument (a rarity in the field…
The notion of automatic selfadjointness of all ideals in a multiplicative semigroup of the bounded linear operators on a separable Hilbert space B(H) arose in a 2015 discussion with Heydar Radjavi who pointed out that B(H) and the finite…
Motivated by recent appearance of multivalued structures in categorification, tropical geometry and other areas, we study basic properties of abstract multisemigroups. We give many new and old examples and general constructions for…
We show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is…
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…
In this paper we prove that every automorphism of the semigroup of invertible matrices with nonnegative elements over a linearly oredered associative ring on some specially defined subgroup concides with the composition of an inner…
We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n-by-n upper triangular matrices over a given field k, in terms of aperiodic…
We give a simplified proof of Tits' classification of semisimple algebraic groups that remains valid over semilocal rings. In particular, we provide explicit necessary and sufficient conditions that anisotropic groups of a given type appear…
Locally inverse semigroups are regular semigroups whose idempotents form pseudo-semilattices. We characterise the categories that correspond to locally inverse semigroups in the realm of Nambooripad's cross-connection theory. Further, we…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
We study two subclasses of the class of automatic structures: automatic structures of polynomial growth and Presburger structures. We present algebraic characterisations of the groups and the equivalence structures in these two classes.