Related papers: Groups Synchronizing a Transformation of Non-Unifo…
We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from identical components. Symmetry is an important goal in the design of distributed systems,…
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…
Let $R$ be a commutative ring and $\Gamma$ be an infinite discrete group. The algebraic $K$-theory of the group ring $R[\Gamma]$ is an important object of computation in geometric topology and number theory. When the group ring is…
Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…
Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…
We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergraph), that is, the group of all automorphisms of the given…
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
Group synchronization arises when two or more synchronization patterns coexist in a network formed of oscillators of different types, with the systems in each group synchronizing on the same time-evolution, but systems in different groups…
Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…
A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of…
Given a finite nonabelian semisimple group $G$, we describe those groups that have the same holomorph as $G$, that is, those regular subgroups $N\simeq G$ of $S(G)$, the group of permutations on the set $G$, such that…
For any group $G$ and any set $A$, a cellular automaton (CA) is a transformation of the configuration space $A^G$ defined via a finite memory set and a local function. Let $\text{CA}(G;A)$ be the monoid of all CA over $A^G$. In this paper,…
A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…
The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…