English
Related papers

Related papers: Being Cayley automatic is closed under taking wrea…

200 papers

It was recently proven that all free and many virtually free verbally closed subgroups are algebraically closed in any group. We establish sufficient conditions for a group that is an extension of a free non-abelian group by a group…

Group Theory · Mathematics 2017-07-19 Andrey M. Mazhuga

We study the unit group of the modular group algebra KG, where G is a 2-group of maximal class. We prove that the unit group of KG possesses a section isomorphic to the wreath product of a group of order two with the commutator subgroup of…

Rings and Algebras · Mathematics 2007-05-23 Alexander B. Konovalov

For a class of wreath-like product groups with property (T), we describe explicitly all the embeddings between their von Neumann algebras. This allows us to provide a continuum of ICC groups with property (T) whose von Neumann algebras are…

Operator Algebras · Mathematics 2025-11-12 Ionut Chifan , Adrian Ioana , Denis Osin , Bin Sun

Let $T$ be a locally finite tree without vertices of degree $1$. We show that among the closed subgroups of $\mathrm{Aut}(T)$ acting with a bounded number of orbits, the Chabauty-closure of the set of topologically simple groups is the set…

Group Theory · Mathematics 2020-07-23 Pierre-Emmanuel Caprace , Nicolas Radu

Let $G$ be a finite group acting faithfully on a finite set $\Omega$. For a positive integer $k$, $G$ acts naturally on the Catesian product $\Omega^k := \Omega \times ...\times \Omega$. In this paper, we prove that finite nilpotent group…

Group Theory · Mathematics 2024-02-28 Jiawei He , Xiaogang Li

Let $G$ be a wreath product of the form $C_2 \wr H$, where $C_2$ is the cyclic group of order 2. Under mild conditions for $H$ we determine the asymptotic behavior of the counting functions for number fields $K/k$ with Galois group $G$ and…

Number Theory · Mathematics 2011-08-30 Jürgen Klüners

In this paper, we showed how a group acting regularly and a diagonal group are embedded into the wreath products in there product action using the Cartesian Decomposition.

Group Theory · Mathematics 2023-05-11 Enoch Suleiman , Muhammed Salihu Audu , Sunday U. Momoh

Using recent techniques introduced by Jones we prove that a large family of discrete groups and groupoids have the Haagerup property. In particular, we show that if G is a discrete group with the Haagerup property, then the wreath product…

Group Theory · Mathematics 2023-05-15 Arnaud Brothier

Some completely positive maps on reduced amalgamated free products of C*-algebras are constructed; these allow a proof that the class of exact unital C*-algebras is closed under taking reduced amalgamated free products. Consequently, the…

Operator Algebras · Mathematics 2007-05-23 Ken Dykema

A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue…

Combinatorics · Mathematics 2020-06-18 Joshua Erde , Florian Lehner

Let $X$ be a compact Riemann surface of genus $g\geq 2$, and let $G$ be a subgroup of $Aut(X)$. We show that if the Sylow $2$-subgroups of $G$ are cyclic, then $|G|\leq 30(g-1)$. If all Sylow subgroups of $G$ are cyclic, then, with two…

Complex Variables · Mathematics 2017-09-25 Andreas Schweizer

We present a new proof, which is independent of the finite simple group classification and applies also to infinite groups, that quasiprimitive permutation groups of simple diagonal type cannot be embedded into wreath products in product…

Group Theory · Mathematics 2017-06-01 Cheryl E. Praeger , Csaba Schneider

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

Group Theory · Mathematics 2008-02-03 Walter D. Neumann , Michael Shapiro

Given a group G, we consider its classifying space for the family of virtually cyclic subgroups. We show for many groups, including for example, one-relator groups, acylindrically hyperbolic groups, 3-manifold groups and CAT(0) cube groups,…

Group Theory · Mathematics 2019-04-09 Timm von Puttkamer , Xiaolei Wu

We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group…

Group Theory · Mathematics 2016-01-20 Nicholas Touikan

We use controlled topology applied to the action of the infinite dihedral group on a partially compactified plane and deduce two consequences for algebraic K-theory. The first is that the family in the K-theoretic Farrell-Jones conjecture…

K-Theory and Homology · Mathematics 2015-11-30 James F. Davis , Frank Quinn , Holger Reich

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…

Group Theory · Mathematics 2010-07-02 Ievgen Bondarenko

In this paper we study finite groups which have Cayley isomorphism property with respect to Cayley maps, CIM-groups for a brief. We show that the structure of the CIM-groups is very restricted. It is described in Theorem~\ref{111015a} where…

Combinatorics · Mathematics 2016-02-09 Mikhail Muzychuk , Gábor Somlai

We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…

Combinatorics · Mathematics 2025-10-24 Masoumeh Koohestani , Doost Ali Mojdeh , Mohsen Ghasemi

Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of…

Formal Languages and Automata Theory · Computer Science 2013-10-29 Ines Klimann , Matthieu Picantin
‹ Prev 1 8 9 10 Next ›