English
Related papers

Related papers: Computing commutator length is hard

200 papers

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

Group Theory · Mathematics 2024-03-22 Derek Holt , Markus Lohrey , Saul Schleimer

A group is $G$ commutative transitive or CT if commuting is transitive on nontrivial elements. A group $G$ is CSA or conjugately separated abelian if maximal abelian subgroups are malnormal. These concepts have played a prominent role in…

Group Theory · Mathematics 2015-06-09 Benjamin Fine , Anthony Gaglione , Gerhard Rosenberger , Dennis Spellman

We consider the problem whether for a group G there exists a constant Lambda(G) > 1 such that for any (r,s)-matrix A over the integral group ring ZG the Fuglede-Kadison determinant of the G-equivariant bounded operator from L^2(G)^r to…

Operator Algebras · Mathematics 2020-09-18 Wolfgang Lueck

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Alexei Myasnikov , Paul Schupp , Vladimir Shpilrain

We study the normal subgroup <f> generated by a non trivial element f in the group G of complex plane polynomial automorphisms having Jacobian determinant 1. On one hand if f has length at most 8 relatively to the classical amalgamated…

Group Theory · Mathematics 2018-04-24 Jean-Philippe Furter , Stéphane Lamy

A well-known theorem of P. Hall, usually called Hall's criterion for nilpotence, states: a group G is nilpotent whenever it has a normal subgroup N such that G/[N,N] and N are nilpotent. We widely generalize this result, replacing groups…

Category Theory · Mathematics 2019-05-07 James Richard Andrew Gray

We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.

Group Theory · Mathematics 2012-03-13 Junqin Li , Shouchuan Zhang , Hengtai Wang , Min Wu

For an element $g$ of a group $G$, an Engel sink is a subset $\mathcal{E}(g)$ such that for every $ x\in G $ all sufficiently long commutators $ [x,g,g,\ldots,g] $ belong to $\mathcal{E}(g)$. We conjecture that if $G$ is a profinite group…

Group Theory · Mathematics 2019-05-21 Cristina Acciarri , Pavel Shumyatsky

Let $H$ be a Krull monoid with finite class group $G$ and suppose that every class contains a prime divisor. If an element $a \in H$ has a factorization $a=u_1 \cdot \ldots \cdot u_k$ into irreducible elements $u_1, \ldots, u_k \in H$, then…

Number Theory · Mathematics 2019-07-09 Alfred Geroldinger , Qinghai Zhong

Let $G$ be a finite abelian group. Ferraz, Guerreiro and Polcino Milies prove that the number of $G$-equivalence classes of minimal abelian codes is equal to the number of $G$-isomorphism classes of subgroups for which corresponding…

Group Theory · Mathematics 2022-01-05 Fatma Altunbulak Aksu , İpek Tuvay

We prove that cyclic subgroup separability is preserved under exponential completion for groups that belong to a class that includes all coherent RAAGs and toral relatively hyperbolic groups; we do so by exploiting the structure of these…

Group Theory · Mathematics 2021-01-27 Jonathan Fruchter

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Information Theory · Computer Science 2022-09-29 Angelo Marotta

Let $G$ be a simple algebraic group of exceptional type over an algebraically closed field of characteristic $p > 0$. This paper continues a long-standing effort to classify the connected reductive subgroups of $G$. Having previously…

Group Theory · Mathematics 2023-04-18 Alastair J. Litterick , Adam R. Thomas

The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…

Group Theory · Mathematics 2021-07-06 Markus Lohrey

A set $\mathcal{G}$ of integers is called a $g$-Golomb ruler of length $n$ if the difference between any two distinct elements of $\mathcal{G}$ is repeated at most $g$ times. If $g=1$, these are also called $B_2$-sets, Sidon sets, and…

Combinatorics · Mathematics 2026-05-15 Aditya Gupta , Kevin O'Bryant

The group $\mathfrak{X}(G)$ is obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. We make significant additions to the list of properties that the functor…

Group Theory · Mathematics 2023-08-22 Martin R. Bridson , Dessislava H. Kochloukova

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

Group Theory · Mathematics 2007-05-23 Robert H. Gilman , Derek F. Holt , Sarah Rees

We call a subset $A$ of the (additive) abelian group $G$ {\it $t$-independent} if for all non-negative integers $h$ and $k$ with $h+k \leq t$, the sum of $h$ (not necessarily distinct) elements of $A$ does not equal the sum of $k$ (not…

Number Theory · Mathematics 2015-12-10 Béla Bajnok , Imre Ruzsa

Let $G$, $H$ be groups. We denote by $\eta(G,H)$ a certain extension of the non-abelian tensor product $G \otimes H$ by $G \times H$. We prove that if $G$ and $H$ are groups that act compatibly on each other and such that the set of all…

Group Theory · Mathematics 2018-10-23 Raimundo Bastos , Irene N. Nakaoka , Noraí R. Rocco

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the ``order formula'' of D. Testerman…

Representation Theory · Mathematics 2007-05-23 George J. McNinch