中文
相关论文

相关论文: Generation of Generalised Wreath Products of Symme…

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 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

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

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

Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the…

组合数学 · 数学 2016-02-16 Alfredo Donno

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

We present methods of calculating statistics generating functions over the colored permutation groups, and generalizing known theorems from the symmetric groups to general colored permutations groups.

组合数学 · 数学 2007-05-23 Michael Fire

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

We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all…

群论 · 数学 2012-10-02 Yaroslav Lavrenyuk

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

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

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection…

表示论 · 数学 2018-09-12 Mee Seong Im , Angela Wu

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

Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a…

表示论 · 数学 2018-09-11 Mee Seong Im , Angela Wu

Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…

群论 · 数学 2023-09-01 Ruslan Skuratovskii

Let G be a finite group. A complete system of pairwise orthogonal idempotents is constructed for the wreath product of G by the symmetric group by means of a fusion procedure, that is by consecutive evaluations of a rational function with…

表示论 · 数学 2015-01-27 L. Poulain d'Andecy

Motivated by computational efficiency in algebraic automata theory here we define the cascade product of permutation groups as an external product, as a generic extension. It is the most general hierarchical product that uses arbitrary…

群论 · 数学 2021-08-31 Attila Egri-Nagy , Chrystopher L. Nehaniv

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

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of…

群论 · 数学 2020-01-24 Adrien Le Boudec

We examine the conjugacy growth series of all wreath products of the finitary permutation groups $\text{Sym}(X)$ and $\text{Alt}(X)$ for an infinite set $X$. We determine their asymptotics, and we characterize the limiting behavior between…

数论 · 数学 2017-03-27 Madeline Locus
‹ 上一页 1 2 3 10 下一页 ›