Related papers: An analogue to Dixon's theorem for automaton group…
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…
Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently,…
It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is…
We give a complete description of the absolute of commutative finitely generated groups and semigroups. The absolute (previously called the exit boundary) is a further elaboration of the notion of the boundary of a random walk on a group…
Let $G$ be a finite group, $A$ a finite abelian group. Each homomorphism $\phi:G\to A\wr S_n$ induces a homomorphism $\bar{\phi}:G\to A$ in a natural way. We show that as $\phi$ is chosen randomly, then the distribution of $\bar{\phi}$ is…
We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…
It is a simple fact that a subgroup generated by a subset $A$ of an abelian group is the direct sum of the cyclic groups $\langle a\rangle$, $a\in A$ if and only if the set $A$ is independent. In [5] the concept of an $independent$ set in…
Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
The diffusion probabilistic generative models are widely used to generate high-quality data. Though they can synthetic data that does not exist in the training set, the rationale behind such generalization is still unexplored. In this…
The one-dimensional Dickman distribution arises in various stochastic models across number theory, combinatorics, physics, and biology. Recently, a definition of the multidimensional Dickman distribution has appeared in the literature,…
Consider a stationary renewal point process on the real line and divide each of the segments it defines in a proportion given by \iid realisations of a fixed distribution $G$ supported by [0,1]. We ask ourselves for which interpoint…
We prove that if the group generated by a Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth…
For any nontrivial abelian group $\mathbb{X}$ we construct a reversible (bireversible in case the order of $\mathbb{X}$ is odd) automaton such that its set of states and alphabet are identified with $\mathbb{X}$, transition and output…
A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…
The random permutation is the Fra\"iss\'e limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39…
In this paper, we discuss a group-theoretical generalization of the well-known Gauss formula involving the functionthat counts the number of automorphisms of a finite group. This gives several characterizations of finite cyclic groups.
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…