Related papers: A characterization of those automata that structur…
We prove the conjugacy of Sylow $2$-subgroups in pseudofinite $\mathfrak{M}_c$ (in particular linear) groups under the assumption that there is at least one finite Sylow $2$-subgroup. We observe the importance of the pseudofiniteness…
We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular…
We study frequent hypercyclicity in the context of strongly continuous semigroups of operators. More precisely, we give a criterion (sufficient condition) for a semigroup to be frequently hypercyclic, whose formulation depends on the Pettis…
Recently M.E. Shirokov introduced the non-commutative operator graph depending on the complex parameter $\theta $ to construct channels with positive quantum zero-error capacity having vanishing n-shot capacity. We study the algebraic…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…
We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…
Aiming at a better understanding of finite groups as finite dynamical systems, we show that by a version of Fitting's Lemma for groups, each state space of an endomorphism of a finite group is a graph tensor product of a finite directed…
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…
We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…
A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…
A finite group is called semi-rational if the distribution induced on it by any word map is a virtual character. Amit and Vishne give a sufficient condition for a group to be semi-rational, and ask whether it is also necessary. We answer…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…
Let G be a finite group. It has recently been proved that every nontrivial element of G is contained in a generating set of minimal size if and only if all proper quotients of G require fewer generators than G. It is natural to ask which…
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…
We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group -- the mother group -- has asymptotic entropy 0.…