English
Related papers

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

200 papers

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

Group Theory · Mathematics 2025-09-10 Daniele D'Angeli , Emanuele Rodaro

Assume that $X$ and $Y$ are arithmetic schemes, i.e., integral schemes of finite types over $Spec(\mathbb{Z})$. Then $X$ is said to be quasi-galois closed over $Y$ if $X$ has a unique conjugate over $Y$ in some certain algebraically closed…

Algebraic Geometry · Mathematics 2009-10-10 Feng-Wen An

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

Group Theory · Mathematics 2024-03-21 Paul-Henry Leemann , Mikael de la Salle

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

Group Theory · Mathematics 2019-02-28 Olga Varghese

We prove that the arboreal Galois representations attached to certain unicritical polynomials have finite index in an infinite wreath product of cyclic groups, and we prove surjectivity for some small degree examples, including a new family…

Number Theory · Mathematics 2016-08-12 Michael R. Bush , Wade Hindes , Nicole R. Looper

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

Group Theory · Mathematics 2007-05-23 Bruce Ikenaga

We show that a wreath product of two finitely generated abelian groups is LERF. Consequently the free metabelian groups are LERF.

Group Theory · Mathematics 2007-05-23 Roger C. Alperin

We develop a theory of soficity for actions on graphs and obtain new applications to the study of sofic groups. We establish various examples, stability and permanence properties of sofic actions on graphs, in particular soficity is…

Group Theory · Mathematics 2024-08-29 David Gao , Greg Patchell , Srivatsav Kunnawalkam Elayavalli

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…

Group Theory · Mathematics 2011-05-11 Jennifer Taback , Peter Wong

We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that…

Group Theory · Mathematics 2014-03-18 A. L. Agore , A. Chirvasitu , B. Ion , G. Militaru

Suppose that a finite group $G$ admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup $C_G(H)$ of the complement is nilpotent of class $c$. It is proved that…

Group Theory · Mathematics 2013-05-30 E. I. Khukhro , N. Yu. Makarenko

We realize lamplighter groups $A\wr \mathbb Z$, with $A$ a finite abelian group, as automaton groups via affine transformations of power series rings with coefficients in a finite commutative ring. Our methods can realize $A\wr \mathbb Z$…

Group Theory · Mathematics 2019-12-02 Rachel Skipper , Benjamin Steinberg

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

Group Theory · Mathematics 2018-01-03 Olga Kharlampovich , Alexei Miasnikov , Pascal Weil

We say that a finite group G is "DRR-detecting" if, for every subset S of G, either the Cayley digraph Cay(G,S) is a digraphical regular representation (that is, its automorphism group acts regularly on its vertex set) or there is a…

Combinatorics · Mathematics 2020-06-02 Dave Witte Morris , Joy Morris , Gabriel Verret

In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually…

Group Theory · Mathematics 2013-05-30 Yago Antolin

We affirm most open cases of a conjecture that first appeared in Alspach et al. (1987) which stipulates that the wreath (lexicographic) product of two hamiltonian decomposable directed graphs is also hamiltonian decomposable. Specifically,…

Combinatorics · Mathematics 2024-12-19 Alice Lacaze-Masmonteil

We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…

Operator Algebras · Mathematics 2023-06-06 Ionut Chifan , Adrian Ioana , Denis Osin , Bin Sun

We define wreath products of cocommutative Hopf algebras, and show that they enjoy a universal property of classifying cleft extensions, analogous to the Kaloujnine-Krasner theorem for groups. We show that the group ring of a wreath product…

Rings and Algebras · Mathematics 2014-07-16 Laurent Bartholdi , Olivier Siegenthaler , Todd Trimble

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$…

Computational Complexity · Computer Science 2017-09-12 Alexei Miasnikov , Svetla Vassileva , Armin Weiß
‹ Prev 1 4 5 6 7 8 10 Next ›