相关论文: Generation of Iterated Wreath Products Constructed…

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…

We prove that groups of the form $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$, where $m,n \in \mathbb N$, are regularly bi-interpretable with $\mathbb Z$ and therefore are first-order rigid: every finitely generated group elementarily equivalent…

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

We prove that if $L=\mbox{}^2F_4(2^{2n+1})'$ and $x$ is a nonidentity automorphism of $L$ then $G=\langle L,x\rangle$ has four elements conjugate to $x$ that generate $G$. This result is used to study the following conjecture about the…

In the first part of this series, the authors introduced the quantum wreath product, providing a unified framework that encompasses numerous results previously addressed only through case-by-case analysis. This paper shifts focus to the…

Dolfi, Guralnick, Praeger and Spiga asked if there exist infinitely many primitive groups of twisted wreath type with nontrivial coprime subdegrees. Here we settle this question in the affirmative. We construct infinite families of…

We describe a generating set for the initial ideal of simplicial toric ideals with respect to the graded reverse lexicographic order, using representations of elements of affine monoids as sums of irreducible elements. Although the…

The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$,…

Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated…

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Let $G$ be a finite abelian group with $\exp(G)$ the exponent of $G$. Then $\mathsf W(G)$ denotes the set of cross numbers of minimal zero-sum sequences over $G$ and $\mathsf w(G)$ denotes the set of all cross numbers of non-trivial…

We investigate the extent to which the exchange relation holds in finite groups $G$. We define a new equivalence relation $\equiv_{\mathrm{m}}$, where two elements are equivalent if each can be substituted for the other in any generating…

The size of minimal generating set for commutator of Sylow 2-subgroup of alternating group was found. Given a permutational wreath product of finite cyclic groups sequence we prove that the commutator width of such groups is 1 and we…

In this note we study sets of normal generators of finitely presented residually $p$-finite groups. We show that if an infinite, finitely presented, residually $p$-finite group $G$ is normally generated by $g_1,\dots,g_k$ with order…

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We investigate the preservation of the properties of being finitely generated and finitely presented under both direct and wreath products of monoid acts. A monoid $M$ is said to preserve property $\mathcal{P}$ in direct products if, for…

Let $0 < \theta \leqslant 1$. A sequence of positive integers $(b_n)_{n=1}^\infty$ is called a weak greedy approximation of $\theta$ if $\sum_{n=1}^{\infty}1/b_n = \theta$. We introduce the weak greedy approximation algorithm (WGAA), which,…

We determine the minimal number of generators of the homological Goldman Lie algebra of a surface consisting of elements of the first homology group of the surface.

Let p be a prime. We classify finitely generated pro-p groups G which satisfy d(H) = d(G) for all open subgroups H of G. Here d(H) denotes the minimal number of topological generators for the subgroup H. Within the category of p-adic…