Related papers: Generic properties in some classes of automaton gr…
This note records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely…
We characterise the group property of being with infinite conjugacy classes for wreath products of groups
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
We show that the mapping class group of an orientable finite type surface has uniformly exponential growth, as well as various closely related groups. This provides further evidence that mapping class groups may be linear.
It is shown that a finite group in which more than 3/4 of the elements are involutions must be an elementary abelian 2-group. A group in which exactly 3/4 of the elements are involutions is characterized as the direct product of the…
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…
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 construct the first examples of infinite sharply 2-transitive groups which are finitely generated. Moreover, we construct such a group that has Kazhdan property (T), is simple, has exactly four conjugacy classes, and we show that this…
In this note, it is proved the existence of an infinitely generated multiplicative group consisting of entire functions that are, except for the constant function 1, hypercyclic with respect to the convolution operator associated to a given…
We construct the first known examples of infinite subgroups of the outer automorphism group of Out(A_Gamma), for certain right-angled Artin groups A_Gamma. This is achieved by introducing a new class of graphs, called focused graphs, whose…
We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.
In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.
In this note some properties of the sum of element orders of a finite abelian group are studied.
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
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…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
We characterize the group property of being with infinite conjugacy classes (or icc, i.e. infinite and of which all conjugacy classes except {1} are infinite) for groups which are defined by an extension of groups. We give characterizations…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…