Related papers: Invariable generation of finite classical groups

It was conjectured in [KLS14] that non-elementary word hyperbolic groups are never invariably generated. We show that this is indeed the case even for the much larger class of convergence groups.

We show that for any $k$ at least $6$ and $g$ sufficiently large, the mapping class group of a surface of genus $g$ can be generated by three elements of order $k$. We also show that this can be done with four elements of order $5$. We…

Word metrics on finitely generated groups have canonical quasi-isometry classes, making quasi-isometry invariants genuine group invariants. Rosendal generalized this phenomenon to topological groups through CB-generation, but in the general…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

A group $G$ is said to have property $R_{\infty}$ if for every automorphism $\varphi \in {\rm Aut}(G)$, the cardinality of the set of $\varphi$-twisted conjugacy classes is infinite. Many classes of groups are known to have such property.…

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…

Quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

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…

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…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

A group $G$ is said to have the property $R_\infty$ if every automorphism $\phi \in {\rm Aut}(G)$ has an infinite number of $\phi$-twisted conjugacy classes. Recent work of Gon\c{c}alves and Kochloukova uses the $\Sigma^n$…

We show, using acylindrical hyperbolicity, that a finitely generated group splitting over $\Z$ cannot be simple. We also obtain SQ-universality in most cases, for instance a balanced group (one where if two powers of an infinite order…

This paper shows that the group ${\rm SL}_n(R)$ is boundedly elementary generated for $n\geq 3$ and $R$ the ring of algebraic integers in a global function field. Contrary to previous statements for number fields and earlier statements for…

Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers…