Related papers: Classification of groups generated by 3-state auto…
There exist f.g.-universal cellular automata groups which are quotients of $\mathbb{Z} * \mathbb{Z}_2$ or $\mathbb{Z}_2 * \mathbb{Z}_2 * \mathbb{Z}_2$, as previously conjectured by the author.
A description of group automorphisms of all two-dimensional algebras, considered up to isomorphism, over any basic field is provided.
We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.
We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…
We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus…
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing…
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its…
The paper approaches to the reader to topology with a curious example of topological classification by homeomorphisms applied to the letters of the alphabet viewed as subsets of Euclidean plane.
We complete the determination of saturated fusion systems on maximal class 3-groups of rank two.
We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.
Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on various other natural overgroups, in…
In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical…
We give a classification of maximal elements of the set of finite groups that can be realized as the automorphism groups of polarized abelian threefolds over finite fields.
We characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of…
Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.