Related papers: Generating infinite symmetric groups

We show that almost every entry in the character table of $S_N$ is divisible by any fixed prime as $N\to\infty$. This proves a conjecture of Miller.

We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…

We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this extended abstract, we consider an analogous…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ which leaves invariant each…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

There is a standard "word length" metric canonically associated to any set of generators for a group. In particular, for any integers a and b greater than 1, the additive group of integers has generating sets {a^i}_{i=0}^{\infty} and…

Let $\mathscr{C}_\mathbb{N}$ be a monoid which is generated by the partial shift $\alpha\colon n\mapsto n+1$ of the set of positive integers $\mathbb{N}$ and its inverse partial shift $\beta\colon n+1\mapsto n$. In this paper we prove that…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

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 1963, Greenberg proved that every finite group appears as the monodromy group of some morphism of Riemann surfaces. In this paper, we give two constructive proofs of Greenberg's result. First, we utilize free groups, which given with the…

Let $N(G)$ be the set of conjugacy classes sizes of $G$. We prove that if $N(G)=\Omega\times \{1,n\}$ for specific set $\Omega$ of integers, then $G\simeq A\times B$ where $N(A)=\Omega$, $N(B)=\{1,n\}$, and $n$ is a power of prime.

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

Let $D_n \subseteq \Sigma_n$ be the set of derangements in the symmetric group. We prove that the complex of injective words generated by $\Sigma_n \setminus D_n$ is contractible. This gives a conceptual explanation to the well known fact…