Yu. A. Drozd, R. V. Skuratovski
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We investigate the preservation of the properties of being finitely generated and finitely presented under both direct and wreath products of monoid acts. A monoid $M$ is said to preserve property $\mathcal{P}$ in direct products if, for any two $M$-acts $A$ and $B$, the direct product $A\times B$ has property $\mathcal{P}$ if and only if both $A$ and $B$ have property $\mathcal{P}$. It is proved that the monoids $M$ that preserve finite generation (resp. finitely presentability) in direct products are precisely those for which the diagonal $M$-act $M\times M$ is finitely generated (resp. fini…
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 topologically finitely generated, provided that the actions of the groups in $\mathcal{S}$ are not regular. We prove that our bound has the right asymptotic behaviour. We also deduce that other infinitely iterated mixed wreath products of groups in $\mathcal{S}$ are finitely generated. Finally we apply our methods to find explicitly two generators of infinitely iterat…
Residual Finiteness of Graph Wreath Products
本文研究了图圈积的剩余有限性问题，证明了其充要条件，并推广了置换圈积和自由积情形的已知结果。
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 that these conditions are necessary. Our results generalise results of Cornulier about wreath products in case $n=2$. Graph-wreath products include classical permutational wreath products and semidirect products of right-angled Artin groups by groups of automorphisms amongst others.
We characterise the group property of being with infinite conjugacy classes for wreath products of groups
We show that a wreath product of two finitely generated abelian groups is LERF. Consequently the free metabelian groups are LERF.
We study the homological finiteness property FPm of permutational wreath products.
In this article nonassociative metagroups are studied. Different types of smashed products and smashed twisted wreath products are scrutinized. Extensions of central metagroups are studied.
Using the relationship between transfinite asymptotic dimension and asymptotic property C, we obtain that the wreath product Z wr Z has asymptotic property C. Specifically, we prove that the transfinite asymptotic dimension of the wreath product Z wr Z is no more than omega+ 1.
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 and only if the profinite abelian group $\prod_{n\geq 1} G_n/G'_n$ is topologically finitely generated. As a corollary, for a finite transitive group $G$ the minimal number of generators of the wreath power $G\wr...\wr G\wr G$ ($n$ times) is bounded if $G$ is perfect, and grows linearly if $G$ is non-perfect. As a by-product we construct a finitely generate…
Given sofic approximations for countable, discrete groups $G,H$, we construct a sofic approximation for their wreath product $G\wr H$.
We study stability properties of the Haagerup property and of coarse embeddability in a Hilbert space, under certain semidirect products. In particular, we prove that they are stable under taking standard wreath products. Our construction also allows for a characterization of subsets with relative Property T in a standard wreath product.
For a finitely generated regular wreath product, the metric is known, but its computation can be an NP-complete problem. Also, it is not known for the nonregular case. In this article, a metric estimate is defined for regular wreath products which can be computed in polynomial time, based on the metrics of the factors. This estimate is then used to study the distortion of some natural subgroups of a wreath product. Finally, the metric estimate is generalized to the nonregular case.
We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
本文研究变换半群的迭代圈积，确定了全变换幺半群与对称群迭代圈积的秩（最小生成集大小）。
We show that the wreath product of two finite symmetric or alternating groups is 2-generated.
Group Embedding into Wreath Products: Cartesian Decomposition Approach
本文利用笛卡尔分解，将正则群和对角群嵌入到乘积作用下的圈积中，提出了一种新的嵌入方法。
Asymptotic Property C for Certain Wreath-like Products of Groups
本文研究了某些群的 wreath-like 产物的渐近性质 C，证明了其具有该性质并提供了新的研究例子。
Wreath products of non-discrete locally compact groups are usually not locally compact groups, nor even topological groups. We introduce a natural extension of the wreath product construction to the setting of locally compact groups. As an application, we disprove a conjecture of Trofimov, constructing compactly generated locally compact groups of intermediate growth without nontrivial compact normal subgroups.
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.
Generation of Generalised Wreath Products of Symmetric Groups
研究对称群序列的广义 wreath 乘积生成，确定其所需最小生成元数。
The wreath product of two permutation groups G < Sym(Gamma) and H < Sym(Delta) can be considered as a permutation group acting on the set Pi of functions from Delta to Gamma. This action, usually called the product action, of a wreath product plays a very important role in the theory of permutation groups, as several classes of primitive or quasiprimitive groups can be described as subgroups of such wreath products. In addition, subgroups of wreath products in product action arise as automorphism groups of graph products and codes. In this paper we consider subgroups X of full wreath products …
We characterize permutational wreath products with Property (FA). For instance, the standard wreath product A wr B of two nontrivial countable groups A,B, has Property (FA) if and only if B has Property (FA) and A is a finitely generated group with finite abelianisation. We also prove an analogous result for hereditary Property (FA). On the other hand, we prove that many wreath products with hereditary Property (FA) are not quotients of finitely presented groups with the same property.
Let $m$ be a positive integer and let $Ω$ be a finite set. The $m$-closure of $G\le$Sym$(Ω)$ is the largest permutation group on $Ω$ having the same orbits as $G$ in its induced action on the Cartesian product $Ω^m$. The exact formula for the $m$-closure of the wreath product in product action is given. As a corollary, a sufficient condition is obtained for this $m$-closure to be included in the wreath product of the $m$-closures of the factors.
We find a criterion for the embedding of a nonsplit central extension of $PSL_n(q)$ with kernel of prime order into the permutation wreath product that corresponds to the action on the projective space.
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 finite-state automorphisms of such a tree satisfy these conditions.
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 finitely generated simple groups quasi-isometric to a wreath product $C \wr F$, where $C$ is a finite group and $F$ a non-abelian free group.
The RP-property of Fel'shtyn and Troitsky is proved for wreath products of finitely generated Abelian groups with the group of integers. Such wreath products become the first known example of finitely generated RP-groups being not almost polycyclic.
We provide elementary proofs of the Nielsen-Schreier Theorem and the Kurosh Subgroup Theorem via wreath products. Our proofs are diagrammatic in nature and work simultaneously in the abstract and profinite categories. A new proof that open subgroups of quasifree profinite groups are quasifree is also given.
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 product action. This investigation is carried out by observing that such a wreath product preserves a natural Cartesian decomposition of the underlying set. Previously we classified the possible embeddings in the case where the plinth is simple. Here we extend that classification and identify several different types of Cartesian decompositions that can be pre…
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 terms of maximum order of elements of $A$ and average order of $B$ and an exact formula for the distribution of orders of elements of $A\wr B.$ Finally, we show how wreath products can be used to find several rational numbers which are limits of average orders of a sequence of $p$-groups with cardinalities going to infinity.
On subgroup growth of iterated wreath products in product action
本文研究了通过迭代wreath产物在积作用下得到的hereditarily just infinite profinite群的子群增长类型，证明了存在任意子群增长类型的群。
Given a quasi-monomial, respectively an almost monomial, group $A$ and a cyclic group $C$ of prime order $p>0$, we show that the wreath product $W=A\wr C$ is quasi-monomial (respectively almost monomial), if certain technical conditions hold.
These are introductory notes on word growth of groups, and include a gentle presentation of wreath products as well as recent results on construction of groups of with given growth function. They are are an expanded version of a mini-course given at "Le Louverain", June 24-27, 2014.
In analogy to the disjoint cycle decomposition in permutation groups, Ore and Specht define a decomposition of elements of the full monomial group and exploit this to describe conjugacy classes and centralisers of elements in the full monomial group. We generalise their results to wreath products whose base group need not be finite and whose top group acts faithfully on a finite set. We parameterise conjugacy classes and centralisers of elements in such wreath products explicitly. For finite wreath products, our approach yields efficient algorithms for finding conjugating elements, conjugacy c…
Orientable quadratic equations in wreath products
本文研究有限生成阿贝尔群圈积 $A\wr B$ 中可定向二次方程的求解复杂度，并基于亏格等特征对问题计算困难或可行的情形进行了分类。
Groups with a large $p$-subgroup, $p$ a prime, include almost all of the groups of Lie type in characteristic $p$ and so the study of such groups adds to our understanding of the finite simple groups. In this article we study a special class of such groups which appear as wreath product cases of the Local Structure Theorem.
We prove that the properties of acting metrically properly on some space with walls or some CAT(0) cube complex are closed by taking the wreath product with \Z. We also give a lower bound for the (equivariant) Hilbert space compression of H\wr\Z in terms of the (equivariant) Hilbert space compression of H.
We study infinitely iterated wreath products of finite permutation groups with respect to product actions. In particular, we prove that, for every non-empty class of finite simple groups $\mathcal{X}$, there exists a finitely generated hereditarily just infinite profinite group $W$ with composition factors in $\mathcal{X}$ such that any countably based profinite group with composition factors in $\mathcal{X}$ can be embedded into $W$. Additionally we investigate when infinitely iterated wreath products of finite simple groups with respect to product actions are co-Hopfian or non-co-Hopfian.
We extend work of the first author and Khoussainov to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.
In this paper we consider groups of the form $G\wr L$, where the set of generators naturally extends the sets of generators of $G$ and $L$, and $L$ admits a Cayley graph that is a tree. We show how one can compute the conjugacy growth series of such groups in terms of the standard and conjugacy growth series of $G$. We then provide explicit formulas for groups of the form $G\wr \mathbb{Z}$ and $G\wr (C_2*C_2)$. We also prove that the radius of convergence of the conjugacy growth series of $G\wr L$, for any $G$ and $L$ as above, is the same as the radius of convergence of its standard growth se…
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 turned into a full picture of these invariants when the abelianization of the basis group is infinite. We apply these descriptions to the study of the Reidemeister number of automorphisms of wreath products in some specific cases.
We show that the unrestricted wreath product of a sofic group by an amenable group is sofic. We use this result to present an alternative proof of the known fact that any group extension with sofic kernel and amenable quotient is again a sofic group. Our approach exploits the famous Kaloujnine-Krasner theorem and extends, with an additional argument, to hyperlinear-by-amenable groups.
We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the Conjugacy Problems for A and B and of the power problem in B. We obtain the result by making the algorithm for the Conjugacy Problem described in a paper of Matthews run in polynomial time. Using this result and properties of the Magnus embedding, we show that the Conjugacy and Conjugacy Search Problems in free solvable groups are computable in polynomial time.
We present a survey of our recent research on varieties, generated by wreath products of groups. In particular, the full classification of all cases, when the (cartesian or direct) wreath product of any abelian groups $A$ and $B$ generates the product variety $\var{A} \var{B}$, is given. The analog of this is given for sets of abelian groups. We also present new, unpublished research on cases when the similar question is considered for non-abelian, finite groups.
We study $(G,2)$-arc-transitive graphs for innately transitive permutation groups $G$ such that $G$ can be embedded into a wreath product $\symΓ\wr\sy\ell$ acting in product action on $Γ^\ell$. We find two such connected graphs: the first is Sylvester's double six graph with 36 vertices, while the second is a graph with $120^2$ vertices whose automorphism group is $\aut\sp 44$. We prove that under certain conditions no more such graphs exist.
Generation of Iterated Wreath Products Constructed from Almost Simple Groups
本文研究了由几乎单群构造的迭代 wreath 产品，并确定了其所需的最小生成元数。
We prove that a self-similar free abelian group has finite rank. We apply the result to self-similar wreath products of abelian groups $G=BwrX$. We show that if $X$ is torsion-free, then $B$ is torsion of finite exponent. Furthemore, we construct a self-similar group $G=BwrC_{2}$ where $B$ is free abelian of infinite rank.
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) \cdot var (B)$ if and only if one of the groups $A$ and $B$ is not of finite exponent, or if $A$ and $B$ are of finite exponents $m$ and $n$ respectively and for all primes $p$ dividing both $m$ and $n$, the factors $B[p^k]/B[p^{k-1}]$ are infinite, where $B[s]=\langle b\in B|\,b^{s}=1 \rangle$ and where $p^k$ is the highest power of $p$ dividing $n$.
We study the effects of subgroup distortion in the wreath products A wr Z, where A is finitely generated abelian. We show that every finitely generated subgroup of A wr Z has distortion function equivalent to some polynomial. Moreover, for A infinite, and for any polynomial l^k, there is a 2-generated subgroup of A wr Z having distortion function equivalent to the given polynomial. Also a formula for the length of elements in arbitrary wreath product H wr G easily shows that the group Z_2 wr Z^2 has distorted subgroups, while the lamplighter group Z_2 wr Z has no distorted (finitely generated)…
Wreath products such as Z wr Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z wr Z as a subgroup of Thompson's group F and as a subgroup of Baumslag's metabelian group G. We find that Z wr Z is undistorted in F but is at least exponentially distorted in G.
Comparing varieties generated by certain wreath products of groups
本文给出了在GABY会议上关于比较某些群圈积所生成簇的报告的详尽版本。
We present a general criterion under which the equality var(A Wr B) = var(A) var(B) holds for finite groups A and B. This continues our previous research on varieties, generated by wreath products of abelian groups, and generalizes some existing results in this direction in literature. The classification is based on criterion of A.L. Shmel'kin for product varieties of groups and on technics developed by R. Burns et al. on critical groups in nilpotent-by-abelian varieties.
The Diophantine problem in iterated wreath products of free abelian groups is undecidable
本文证明有限秩非平凡自由阿贝尔群（k>1）的迭代限制圈积中的丢番图问题不可判定，即无算法判定该群中有限系数群方程组是否有解。
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 \cite{SkVC, SkMal, SkAr} and construct minimal generating set for wreath product of finite and infinite cyclic groups and direct product of such groups. We generalize results of Meldrum about commutator subgroup of wreath product \cite{Meld} because we take in consideration as regular wreath product as well as no regular (where active group $\mathcal{A}$ can acts not…
We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy separability of $A$ and $B$, the growth of $\mathcal{C}$-cyclic subgroup separability of $B$, and the $\mathcal{C}$-residual girth of $B.$ As an application, we provide a characterisation of when $A \wr B$ is $p$-conjugacy separable. We use this characterisation to the provide for each prime $p$ an example of wreath products with infinite base group that are …
Exponentially distorted subgroups in wreath products
本文证明在两类圈积群 $\mathbb{Z} \wr (\mathbb{Z} \wr \mathbb{Z})$ 与 $\mathbb{Z} \wr F_2$ 中均存在指数扭曲的子群。
We calculate the exact values of the Følner function $\mathrm{Føl}$ of the lamplighter group $\mathbb{Z}\wr\mathbb{Z}/2\mathbb{Z}$ for the standard generating set. More generally, for any finite group $D$ and $n\geq|D|$, we obtain the exact value of $\mathrm{Føl}(n)$ on the wreath product $\mathbb{Z}\wr D$, for a generating set induced by a generator on $\mathbb{Z}$ and the entire group being taken as generators for $D$. We also describe the Følner sets that give rise to it. Følner functions encode the isoperimetric properties of amenable groups and have previously been studied up to asymptoti…
A permutation group is innately transitive if it has a transitive minimal normal subgroup, and this subgroup is called a plinth. In this paper we study three special types of inclusions of innately transitive permutation groups in wreath products in product action. This is achieved by studying the natural Cartesian decomposition of the underlying set that correspond to the product action of a wreath product. Previously we identified six classes of Cartesian decompositions that can be acted upon transitively by an innately transitive group with a non-abelian plinth. The inclusions studied in th…
We give a geometric proof based on recent work of Eskin, Fisher and Whyte that the lamplighter group $L_n$ has infinitely many twisted conjugacy classes for any automorphism $\vp$ only when $n$ is divisible by 2 or 3, originally proved by Gonçalves and Wong. We determine when the wreath product $G \wr \Z$ has this same property for several classes of finite groups $G$, including symmetric groups and some nilpotent groups.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。