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

Let $\mathbb Z/d\mathbb Z \wr \mathfrak S_n$ denote the wreath product of the cyclic group $\mathbb Z/d\mathbb Z$ with the symmetric group $\mathfrak S_n$. We define generating functions for monomial (induced one-dimensional) characters of…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Let $K$ be a number field and $k\geq 2$ be an integer. Let $(n_1,n_2, \dots, n_k)$ be a vector with entries $n_i\in \mathbb{Z}_{\geq 2}$. Given a number field extension $L/K$, we denote by $\widetilde{L}$ the Galois closure of $L$ over $K$.…

We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…

A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case…

In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $k\in \mathbb{N}$ such that any $g\in G$…

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…

We describe a general procedure to construct topological extensions of given skew product maps with one-dimensional fibres, by blowing up a countable number of single points to vertical segments. This allows to produce various examples of…

Given an automorphism $x$ of order bigger than $2$ of a sporadic simple group $S$, we show that there are at most $3$ conjugates of $x$ required to generate a subgroup of order divisible by a fixed prime divisor $r$ of $|S|$. The only…

We construct an uncountable family of finitely generated groups of intermediate growth, with growth functions of new type. These functions can have large oscillations between lower and upper bounds, both of which come from a wide class of…

In quasi-Monte Carlo methods, generating high-dimensional low discrepancy sequences by generator matrices is a popular and efficient approach. Historically, constructing or finding such generator matrices has been a hard problem. In…

Let $G$ be a finite group with $k$ conjugacy classes, and $S(\infty)$ be the infinite symmetric group, i.e. the group of finite permutations of $\left\{1,2,3,\ldots\right\}$. Then the wreath product $G_{\infty}=G\sim S(\infty)$ of $G$ with…

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Let $G$ be a wreath product of the form $C_2 \wr H$, where $C_2$ is the cyclic group of order 2. Under mild conditions for $H$ we determine the asymptotic behavior of the counting functions for number fields $K/k$ with Galois group $G$ and…

We find a necessary condition for the embedding of a central extension of a group $G$ with elementary abelian kernel into the wreath product that corresponds to a permutation action of $G$. The proof uses purely group-theoretic methods.

Consider the wreath product $H\wr G$, where $H\ne 1$ is finite and $G$ is finitely generated. We show that the Assouad-Nagata dimension $\dim_{AN}(H\wr G)$ of $H\wr G$ depends on the growth of $G$ as follows: If the growth of $G$ is not…

We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer…

The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…

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…

A weakly consecutive sequence (WCS) is a permutation $\sigma$ of $\{1, \ldots, k\}$ such that if an integer $d$ divides $\sigma(i)$, then $d$ also divides $\sigma(i \pm d)$ insofar as these are defined. The structure of weakly consecutive…