English
Related papers

Related papers: Conjugacy in Miller's Groups

200 papers

Many results have been established that show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper is to show several results about solvability concerning the…

Group Theory · Mathematics 2024-02-13 Antonio Beltrán , Rachel Deborah Camina , María José Felipe , Carmen Melchor

The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result used the newly developed…

Group Theory · Mathematics 2024-04-25 Caroline Mattes , Armin Weiß

In 2000, L. H\'{e}thelyi and B. K\"{u}lshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the…

Group Theory · Mathematics 2007-08-20 Thomas Michael Keller

In his paper "Finite groups have many conjugacy classes" (J. London Math. Soc (2) 46 (1992), 239-249), L. Pyber proved the to date best general lower bounds for the number of conjugacy classes of a finite group in terms of the order of the…

Group Theory · Mathematics 2008-12-16 Thomas Michael Keller

This paper is dedicated to the conjugacy problem in $GL(n,\Z)$ and its connection with algebraic number theory. This connection may be summed up in the Latimer-MacDuffee-Taussky Theorem, which, in a very broad sense, identifies the…

Number Theory · Mathematics 2016-11-18 Lennard F Bakker , Pedro Martins Rodrigues , Miguel M. R. Moreira

Many results have been established that show how arithmetic conditions on conjugacy class sizes affect group structure. A conjugacy class in $G$ is called vanishing if there exists some irreducible character of $G$ which evaluates to zero…

Group Theory · Mathematics 2015-09-23 Julian Brough

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

Group Theory · Mathematics 2017-08-16 Arman Darbinyan

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

Group Theory · Mathematics 2020-06-23 Laurent Bartholdi , Michael Figelius , Markus Lohrey , Armin Weiß

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…

Group Theory · Mathematics 2016-05-17 S. C. Chagas , P. A. Zalesskii

We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…

Representation Theory · Mathematics 2017-08-08 Yury A. Neretin

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

Formal Languages and Automata Theory · Computer Science 2017-09-06 Meng-Che "Turbo" Ho

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

Group Theory · Mathematics 2007-05-23 Nuno Franco

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…

Group Theory · Mathematics 2025-02-10 Alexander Olshanskii , Vladimir Shpilrain

This paper continues the study of two numbers that are associated with Lie groups. The first number is $N(G,m)$, the number of conjugacy classes of elements in $G$ whose order divides $m$. The second number is $N(G,m,s)$, the number of…

Combinatorics · Mathematics 2024-07-09 Tamar Friedmann , Qidong He

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Group Theory · Mathematics 2022-02-11 Dominik Bernhardt , Tim Boykett , Alice Devillers , Johannes Flake , S. P. Glasby

Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…

Group Theory · Mathematics 2020-09-22 Igor Dolinka

Let $G$ be a semisimple algebraic group over an algebraically closed field of characteristic $p \geq 0$. At the 1966 International Congress of Mathematicians in Moscow, Robert Steinberg conjectured that two elements $a, a' \in G$ are…

Group Theory · Mathematics 2020-11-02 Mikko Korhonen

Let $n$ be a positive integer and let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. Set $T_{\otimes}(G) = \{g \otimes h \mid g,h \in G\}$. We prove that if the size…

Group Theory · Mathematics 2025-11-04 Raimundo Bastos , Carmine Monetta

We describe the topological behavior of the conjugacy action of the mapping class group of an orientable infinite-type surface $\Sigma$ on itself. Our main results are: (1) All conjugacy classes of $MCG(\Sigma)$ are meager for every…

We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to graph products. We concentrate on logspace complexity because…

Discrete Mathematics · Computer Science 2014-05-19 Volker Diekert , Jonathan Kausch