English
Related papers

Related papers: Computing commutator length is hard

200 papers

The nonabelian tensor square $G\otimes G$ of a polycyclic group $G$ is a polycyclic group and its structure arouses interest in many contexts. The same assertion is still true for wider classes of solvable groups. This motivated us to work…

Group Theory · Mathematics 2012-06-20 Ahmad Erfanian , Francesco G. Russo , Nor Haniza Sarmin

For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…

Rings and Algebras · Mathematics 2014-04-29 Martin Kreuzer , Xingqiang Xiu

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Group Theory · Mathematics 2014-01-21 Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl , Pham Huu Tiep

Let $G$ be a finite group. We show that the order of the subgroup generated by coprime $\gamma_k$-commutators (respectively $\delta_k$-commutators) is bounded in terms of the size of the set of coprime $\gamma_k$-commutators (respectively…

Group Theory · Mathematics 2019-02-20 Cristina Acciarri , Pavel Shumyatsky , Anitha Thillaisundaram

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

In this paper we present a simple linear-time algorithm constructing a context-free grammar of size O(g log(N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string.…

Data Structures and Algorithms · Computer Science 2013-11-08 Artur Jeż

Fully commutative elements in types $B$ and $D$ are completely characterized and counted by Stembridge. Recently, Feinberg-Kim-Lee-Oh have extended the study of fully commutative elements from Coxeter groups to the complex setting, giving…

Combinatorics · Mathematics 2023-08-10 Jiayuan Wang

Philip Hall raised around 1965 the following question which is stated in the Kourovka Notebook: Is there a non-trivial group which is isomorphic with every proper extension of itself by itself? We will decompose the problem into two parts:…

Group Theory · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

Computational Complexity · Computer Science 2025-12-30 Duaa Abdullah , Jasem Hamoud

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Group Theory · Mathematics 2021-07-01 Kanto Irimoto , Enrique Torres-Giese

Let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $[G,G^{\varphi}]$ by $G \times G$. We prove that if $G$ is a finite potent $p$-group, then $[G,G^{\varphi}]$ and the $k$-th term of the lower…

Group Theory · Mathematics 2025-08-27 Raimundo Bastos , Emerson de Melo , Nathália Gonçalves , Ricardo Nunes

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

Computational Complexity · Computer Science 2025-06-05 Chin Ho Lee , Emanuele Viola

Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…

Computational Complexity · Computer Science 2026-01-29 Robert Andrews , Mrinal Kumar , Shanthanu S. Rai

If $K$ is a closed subgroup of a compact group $G$, the probability that randomly chosen pair of elements from $K$ and $G$ commute is denoted by $Pr(K,G)$. Say that a subgroup $K\leq G$ is $\epsilon$-central in $G$ if $Pr(\langle g…

Group Theory · Mathematics 2022-12-19 João Azevedo , Pavel Shumyatsky

The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…

Machine Learning · Computer Science 2026-05-11 Mitchell A. Thornton

A pro-Lie group $G$ is a topological group such that $G$ is isomorphic to the projective limit of all quotient groups $G/N$ (modulo closed normal subgroups $N$) such that $G/N$ is a finite dimensional real Lie group. A topological group is…

Group Theory · Mathematics 2018-12-13 Rafael Dahmen , Karl-Heinrich Hofmann

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…

Group Theory · Mathematics 2021-11-04 João Azevedo , Pavel Shumyatsky

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

Group Theory · Mathematics 2008-04-07 Danny Calegari

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

Number Theory · Mathematics 2020-01-29 Jean-Louis Verger-Gaugry , Jaroslav Hancl , Radhakrishnan Nair

Let $G$ be a profinite group. We prove that the commutator subgroup $G'$ is finite-by-procyclic if and only if the set of all commutators of $G$ is contained in a union of countably many procyclic subgroups.

Group Theory · Mathematics 2016-11-08 Cristina Acciarri , Pavel Shumyatsky