English
Related papers

Related papers: Garside groups are strongly translation discrete

200 papers

A class of groups C is root in a sense of K. W. Gruenberg if it is closed under taking subgroups and satisfies the Gruenberg condition: for any group X and for any subnormal sequence Z \leqslant Y \leqslant X with factors in C, there exists…

Group Theory · Mathematics 2013-08-06 E. V. Sokolov

Let $K$ be a global function field of characteristic $p$, and let $\Gamma$ be a finite-index subgroup of an arithmetic group defined with respect to $K$ and such that any torsion element of $\Gamma$ is a $p$-torsion element. We define…

Group Theory · Mathematics 2018-03-28 Daniel Studenmund , Kevin Wortman

Equipped with the operation of setwise multiplication induced by a (multiplicatively written) monoid $H$ on its parts, the collection of all finite subsets of $H$ containing the identity element is itself a monoid, denoted by $\mathcal…

Group Theory · Mathematics 2026-03-10 Salvatore Tringali , Weihao Yan

The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one…

Representation Theory · Mathematics 2016-09-07 Alexander Fel'shtyn , Evgenij Troitsky

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…

Group Theory · Mathematics 2024-12-03 Michael Figelius , Moses Ganardi , Markus Lohrey , Georg Zetzsche

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…

Geometric Topology · Mathematics 2007-05-23 Juan Gonzalez-Meneses , Volker Gebhardt

We construct a family of infinite simple groups that we call \emph{twisted Brin-Thompson groups}, generalizing Brin's higher-dimensional Thompson groups $sV$ ($s\in\mathbb{N}$). We use twisted Brin-Thompson groups to prove a variety of…

Group Theory · Mathematics 2022-08-17 James Belk , Matthew C. B. Zaremsky

The mixed braid groups are the subgroups of Artin braid groups whose elements preserve a given partition of the base points. We prove that the centralizer of any braid can be expressed in terms of semidirect and direct products of mixed…

Geometric Topology · Mathematics 2007-05-23 Juan Gonzalez-Meneses , Bert Wiest

Given an infinite, compact, monothetic group $G$ we study decompositions and structure of unbounded derivations in a crossed product C$^*$-algebra $C(G)\rtimes\Z$ obtained from a translation on $G$ by a generator of a dense cyclic subgroup.…

Operator Algebras · Mathematics 2023-06-22 Slawomir Klimek , Matt McBride

The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…

Group Theory · Mathematics 2024-06-27 Stuart Margolis , John Rhodes , Anne Schilling

In this paper, we extend the classical theory of crossed $G$-sets and the crossed Burnside ring from a finite group $G$ to a finite groupoid $\mathcal{G}$. We introduce a natural monoidal structure on the category of crossed…

Category Theory · Mathematics 2026-05-06 Keitaro Shiizuka

An element $g$ in a group $G$ is called reversible if $g$ is conjugate to $g^{-1}$ in $ G $. An element $g$ in $G$ is strongly reversible if $ g $ is conjugate to $g^{-1}$ by an involution in $G$. The group of affine transformations of…

Group Theory · Mathematics 2023-10-10 Krishnendu Gongopadhyay , Tejbir Lohan , Chandan Maity

We carry out a study of groups $G$ in which the index of any infinite subgroup is finite. We call them restricted-finite groups and characterize finitely generated not torsion restricted-finite groups. We show that every infinite…

Group Theory · Mathematics 2023-05-02 B. Taeri , M. R. Vedadi

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

Group Theory · Mathematics 2023-09-11 Junho Peter Whang

The Griffiths group $\Gr^r(X)$ of a smooth projective variety $X$ over an algebraically closed field is defined to be the group of homologically trivial algebraic cycles of codimension $r$ on $X$ modulo the subgroup of algebraically trivial…

Algebraic Geometry · Mathematics 2013-06-14 B. Brent Gordon , Kirti Joshi

In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $k\in \mathbb{N}$ such that any $g\in G$…

Group Theory · Mathematics 2021-02-18 Alexander J. Malcolm

Let $G$ be a finite group. A finite unordered sequence $S = g_1 \boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their…

Commutative Algebra · Mathematics 2018-02-06 Jun Seok Oh

We show that the simple elements of the dual Garside structure of an Artin group of type $D_n$ are Mikado braids, giving a positive answer to a conjecture of Digne and the second author. To this end, we use an embedding of the Artin group…

Group Theory · Mathematics 2017-10-25 Barbara Baumeister , Thomas Gobet

We generalise a key result of one-relator group theory, namely Magnus's Freiheitssatz, to partially commutative groups, under sufficiently strong conditions on the relator. The main theorem shows that under our conditions, on an element $r$…

Group Theory · Mathematics 2019-07-19 Andrew J. Duncan , Arye Juhász

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

Formal Languages and Automata Theory · Computer Science 2020-07-17 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter