Related papers: Connected reversible Mealy automata of prime size …
We construct a finitely generated group that does not satisfy the generalized Burghelea conjecture.
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…
In this note an `extended Burnside ring' is defined, generated by classes of semisimple module categories over Rep(G) with quasifibre functors. Here G is a finite group and representations are taken over an algebraically closed field of…
We present an infinite series of $n$-state Eulerian automata whose reset words have length at least $(n^2-3)/2$. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that…
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction…
Shumyatsky and the second author proved that if G is a finitely generated residually finite p-group satisfying a law, then, for almost all primes, the fact that a normal and commutator-closed set of generators satisfies a positive law…
We construct the first examples of finitely presented groups with quadratic Dehn function containing a finitely generated infinite torsion subgroup. These examples are "optimal" in the sense that the Dehn function of any such finitely…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
We make a connection between the subgroup membership and identity problems for matrix groups and extended finite automata. We provide an alternative proof for the decidability of the subgroup membership problem for $ 2 \times 2 $ integer…
It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite rank need not have maximal completely decomposable summands,…
Let $G$ and $H$ be finite groups. We give a condition on $G$ and $H$ that implies that the $A$-fibered Burnside rings $B^A(G)$ and $B^A(H)$ are isomorphic. As a consequence, we show the existence of non-isomorphic groups $G$ and $H$ such…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
In this paper we study the smallest Mealy automaton of intermediate growth, first considered by the last two authors. We describe the automatic transformation monoid it defines, give a formula for the generating series for its (ball volume)…
We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.
Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…
Absolutely maximally entangled (AME) states are typically defined in homogeneous systems. However, the quantum system is more likely to be heterogeneous in a practical setup. In this work we pay attention to the construction of AME states…
Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such…