中文
相关论文

相关论文: Minimal generating sets in wreath products

200 篇论文

For a monoid $M$ and a subsemigroup $S$ of the full transformation semigroup $T_n$, the wreath product $M\wr S$ is defined to be the semidirect product $M^n\rtimes S$, with the coordinatewise action of $S$ on $M^n$. The full wreath product…

A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper. This remarkable conclusion is reached after a…

群论 · 数学 2007-05-23 Cheryl E. Praeger , Robert W. Baddeley , Csaba Schneider

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.

群论 · 数学 2016-11-01 Andrei V. Zavarnitsine

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

群论 · 数学 2017-02-07 Gideon Amir , Gady Kozma

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…

组合数学 · 数学 2019-10-28 Mariusz Grech , Andrzej Kisielewicz

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 investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

组合数学 · 数学 2007-11-21 Jacob Steinhardt

In this paper, we determine minimal generating sets for several well-known monoids of matrices over semirings. In particular, we find minimal generating sets for the monoids consisting of: all $n\times n$ boolean matrices when $n\leq 8$;…

环与代数 · 数学 2021-08-11 F. Hivert , J. D. Mitchell , F. L. Smith , W. A. Wilson

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

表示论 · 数学 2011-07-13 A. A. Lopatin

We consider the (pure) braid groups B_{n}(M) and P_{n}(M), where M is the 2-sphere S^2 or the real projective plane RP^2. We determine the minimal cardinality of (normal) generating sets X of these groups, first when there is no restriction…

几何拓扑 · 数学 2014-07-08 Daciberg Lima Gonçalves , John Guaschi

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

We present a full description of the Bieri-Neumann-Strebel invariant of restricted permutational wreath products of groups. We also give partial results about the 2-dimensional homotopical invariant of such groups. These results may be…

群论 · 数学 2019-02-13 Luis Augusto de Mendonça

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

A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…

群论 · 数学 2007-05-23 Robert W. Baddeley , Cheryl E. Praeger , Csaba Schneider

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

群论 · 数学 2024-05-28 Alex C. Dantas , Junio R. Oliveira , Tulio M. G. Santos

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

群论 · 数学 2014-09-16 T. R. Riley , A. W. Sale

Generalizing results of Higman and Houghton on varieties generated by wreath products of finite cycles, we prove that the (direct or cartesian) wreath product of arbitrary abelian groups $A$ and $B$ generates the product variety $var (A)…

群论 · 数学 2018-01-09 Vahagn H. Mikaelian

In this paper, we show that wreath products of groups have linear divergence, and we generalise the argument to permutational wreath products. We also prove that Houghton groups $\mathcal{H}_m$ with $m\geq 2$ and Baumslag-Solitar groups…

群论 · 数学 2025-12-16 Letizia Issini

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

We introduce a new product for permutation groups. It takes as input two permutation groups, M and N, and produces an infinite group M [X] N which carries many of the permutational properties of M. Under mild conditions on M and N the group…

群论 · 数学 2018-01-24 Simon M. Smith