中文
相关论文

相关论文: Powers in the wreath product of $G$ with $S_n$

200 篇论文

For an integer $M\geq 2$ and a finite group $G$, an element $\alpha\in G$ is called an $M$-th power if it satisfies $A^M=\alpha$ for some $A\in G$. In this article, we will deal with the case when $G$ is finite symplectic or orthogonal…

群论 · 数学 2022-08-19 Saikat Panja , Anupam Singh

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

Given a finite group $G$ acting on a set $X$ let $\delta_k(G,X)$ denote the proportion of elements in $G$ that have exactly $k$ fixed points in $X$. Let $\mathrm{S}_n$ denote the symmetric group acting on $[n]=\{1,2,\dots,n\}$. For…

群论 · 数学 2023-07-18 Vishnuram Arumugam , Heiko Dietrich , S. P. Glasby

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients:…

群论 · 数学 2025-10-24 Yotam Shomroni

Every word $w$ in the free group $F_r$ of rank $r$ induces a probability measure (the $w$-measure) on every compact group $G$, by substitution of Haar-random $G$-elements in the letters. This measure is determined by its Fourier…

群论 · 数学 2023-05-22 Yotam Shomroni

We obtain an exact formula for the average order of elements of a wreath product of two finite groups. Then focussing our attention on $p$-groups for primes $p$, we give an estimate for the average order of a wreath product $A\wr B$ in…

群论 · 数学 2022-03-29 Supravat Sarkar

It is well known that the pair $(\mathcal{S}_n,\mathcal{S}_{n-1})$ is a Gelfand pair where $\mathcal{S}_n$ is the symmetric group on $n$ elements. In this paper, we prove that if $G$ is a finite group then $(G\wr \mathcal{S}_n, G\wr…

组合数学 · 数学 2023-09-12 Omar Tout

Given a group $G$ and $n\geq 0$, let $W(G,n)$ be the associated iterated wreath product -- unrestricted when $G$ is infinite -- viewed as a permutation group on $G^n$. We prove that the normalizer of $W(G,n)$ in the symmetric group $S(G^n)$…

群论 · 数学 2023-08-23 Fernando Szechtman

The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the…

组合数学 · 数学 2015-05-07 Sergei Evdokimov , Ilya Ponomarenko

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…

组合数学 · 数学 2023-09-12 Omar Tout

For a finite group $G$ with integer-valued character table and a prime $p$, we show that almost every entry in the character table of $G \wr S_N$ is divisible by $p$ as $N \to \infty$. This result generalizes the work of Peluse and…

表示论 · 数学 2024-02-13 Brandon Dong , Hannah Graff , Joshua Mundinger , Skye Rothstein , Lola Vescovo

The degree of commutativity of a finite group is the probability that two uniformly and randomly chosen elements commute. This notion extends naturally to finitely generated groups $G$: the degree of commutativity $\text{dc}_S(G)$, with…

群论 · 数学 2023-10-17 Iker de las Heras , Benjamin Klopsch , Andoni Zozaya

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

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 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 characterise the group property of being with infinite conjugacy classes for wreath products of groups

群论 · 数学 2007-05-23 Jean-Philippe Preaux

We propose an analogue of Solomon's descent theory for the case of a wreath product G ~ S_n, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht's theory for the…

组合数学 · 数学 2011-12-20 Pierre Baumann , Christophe Hohlweg

We study some combinatorial properties of partial wreath $k$-th power of the semigroup $\mathcal{IS}_d$. In particular, we calculate its order, the number of idempotents and the number of D-classes.

组合数学 · 数学 2020-06-30 Eugenia Kochubinska

We compute the product of any $n$-tuple of conjugacy classes in $SL_2(R)$

群论 · 数学 2024-12-03 Stepan Orevkov

Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G~S_n on the generalized…

表示论 · 数学 2014-10-31 Ashish Mishra , Murali K. Srinivasan
‹ 上一页 1 2 3 10 下一页 ›