相关论文: Generating infinite symmetric groups

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…

The commutative subgroup width of a group $G$ is the smallest $k$ such that there are abelian subgroups $A_0,A_1,\ldots,A_{k-1}\leq G$ with $G=A_0A_1\cdots A_{k-1}$. Commutative (inverse) submonoid width is defined analogously. In 2002,…

In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…

The following problem was originally posed by B.H. Neumann and H. Neumann. Suppose that a group $G$ can be generated by $n$ elements and that $H$ is a homomorphic image of $G$. Does there exist, for every generating $n$-tuple $(h_1,\ldots,…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

Let N be a normal subgroup of a finite group G. We prove that under certain (unavoidable) conditions the subgroup [N,G] is a product of commutators [N,y] (with prescribed values of y from a given set Y) of length bounded by a function of…

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

Consider the full modular group $\sf{PSL}_{2}(\mathbb{Z})$ with presentation $\langle U,S|U^3,S^2\rangle$. Motivated by our investigations on quasi-modular forms and the Minkowski question mark function (so that this paper might be…

Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters by identifying its extreme rays, and find relations of the…

We simplify construction of Thoma representations of an infinite symmetric group

We classify all irreducible admissible representations of three Olshanski pairs connected to the infinite symmetric group. In particular, our methods yield two simple proofs of the classical Thoma's description of the characters of the…

Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…

Let $R$ be a commutative ring with identity and let $M$ be an $R$-module which is generated by $\mu$ elements but not fewer. We denote by $\operatorname{SL}_n(R)$ the group of the $n \times n$ matrices over $R$ with determinant $1$. We…

We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.

We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.

We show that connected separable locally compact groups are infinitesimally finitely generated, meaning that there is an integer $n$ such that every neighborhood of the identity contains $n$ elements generating a dense subgroup. We…

We study the number of random permutations needed to invariably generate the symmetric group, $S_n$, when the distribution of cycle counts has the strong $\alpha$-logarithmic property. The canonical example is the Ewens sampling formula,…

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in…