中文
相关论文

相关论文: Minimal generating sets in wreath products

200 篇论文

Let $G_{1}$, $G_{2}$, ... be a sequence of groups each of which is either an alternating group, a symmetric group or a cyclic group and construct a sequence $(W_{i})$ of wreath products via $W_{1} = G_{1}$ and, for each $i \geq 1$, $W_{i+1}…

群论 · 数学 2025-05-02 Jiaping Lu , Martyn Quick

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

群论 · 数学 2010-07-02 Ievgen Bondarenko

Generators and defining relations for wreath products of groups are given. Under some condition (conormality of the generators) they are minimal. In particular, it is just the case for the Sylow subgroups of the symmetric groups.

群论 · 数学 2008-10-07 Yu. A. Drozd , R. V. Skuratovski

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

群论 · 数学 2011-04-22 Eloisa Detomi , Andrea Lucchini

Let I be a finite partially ordered set and let (Sym({\Delta}i),{\Delta}i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, {\Delta}) on this sequence of permutation groups. We determine the…

群论 · 数学 2026-04-20 Jiaping Lu

Let $\mathcal{S}$ be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in $\mathcal{S}$ is…

群论 · 数学 2016-03-18 Matteo Vannacci

A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show…

群论 · 数学 2015-08-04 Peter H. Kropholler , Armando Martino

Given a permutational wreath product sequence of cyclic groups we investigate its minimal generating set, minimal generating set for its commutator and some properties of its commutator subgroup. We strengthen the result of author…

群论 · 数学 2021-10-07 Ruslan Vyacheslavovich Skuratovskii , Aled Williams

Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators…

群论 · 数学 2026-02-04 Jiaping Lu

The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…

群论 · 数学 2016-07-19 Ruslan Skuratovskii

We show that the wreath product of two finite symmetric or alternating groups is 2-generated.

群论 · 数学 2021-08-02 James East , James D Mitchell

We present several multi-variable generating functions for a new pattern matching condition on the wreath product of the cyclic group and the symmetric group. Our new pattern matching condition requires that the underlying permutations…

组合数学 · 数学 2009-08-28 Sergey Kitaev , Andrew Niedermaier , Jeffrey Remmel , Manda Riehl

The covering number of a finite group $G$, denoted $\sigma(G)$, is the smallest positive integer $k$ such that $G$ is a union of $k$ proper subgroups. We calculate $\sigma(G)$ for a family of primitive groups $G$ with a unique minimal…

群论 · 数学 2023-01-11 Martino Garonzi , Julia Almeida

We prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.

群论 · 数学 2025-09-16 Amy Needham

Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.

交换代数 · 数学 2007-05-23 John A. Eagon

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

群论 · 数学 2025-06-03 Andrea Lucchini , Patricia Medina Capilla

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

群论 · 数学 2022-03-03 Daniele Garzoni , Andrea Lucchini

We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…

环与代数 · 数学 2024-05-21 Vítězslav Kala , Lucien Šíma

We characterize which permutational wreath products W^(X)\rtimes G are finitely presented. This occurs if and only if G and W are finitely presented, G acts on X with finitely generated stabilizers, and with finitely many orbits on the…

群论 · 数学 2010-08-04 Yves de Cornulier

Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…

群论 · 数学 2020-08-20 Charles Garnet Cox
‹ 上一页 1 2 3 10 下一页 ›