Corpus ID: 210932690

Computing commutator length is hard

@article{Heuer2020ComputingCL,
  title={Computing commutator length is hard},
  author={Nicolaus Heuer},
  journal={arXiv: Group Theory},
  year={2020}
}
The commutator length $cl_G(g)$ of an element $g \in [G,G]$ in the commutator subgroup of a group $G$ is the least number of commutators needed to express $g$ as their product. If $G$ is a non-abelian free groups, then given an integer $n \in \mathbb{N}$ and an element $g \in [G,G]$ the decision problem which determines if $cl_G(g) \leq n$ is NP-complete. Thus, unless P=NP, there is no algorithm that computes $cl_G(g)$ in polynomial time in terms of $|g|$, the wordlength of $g$. This statement… Expand
1 Citations
Stable commutator length in right-angled Artin and Coxeter groups.
We establish a spectral gap for stable commutator length (scl) of integral chains in right-angled Artin groups (RAAGs). We show that this gap is not uniform, i.e. there are RAAGs and integral chainsExpand

References

SHOWING 1-10 OF 19 REFERENCES
Gaps in scl for Amalgamated Free Products and RAAGs
AbstractWe develop a new criterion to tell if a group G has the maximal gap of 1/2 in stable commutator length (scl). For amalgamated free products $${G = A \star_C B}$$G=A⋆CB we show that everyExpand
Computing commutator length in free groups
We study commutator length in free groups. (By a commutator lengthcl(g) of an element g in a derived subgroup G′ of a group G we mean the least natural number k such that g is a product of kExpand
Spectral gap of scl in graphs of groups and $3$-manifolds
The stable commutator length scl_G(g) of an element g in a group G is an invariant for group elements sensitive to the geometry and dynamics of G. For any group G acting on a tree, we prove a sharpExpand
Stable commutator length is rational in free groups
For any group, there is a natural (pseudo-)norm on the vector space B^H_1 of real homogenized (group) 1 -boundaries, called the stable commutator length norm. This norm is closely related to, and canExpand
The genus problem for one-relator products of locally indicable groups
A one-relator product of groups A and B is a natural generalisation of a onerelator group, and under suitable conditions (for example if A and B are locally indicable) one can extend much of theExpand
On the complexity of sails
This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to anExpand
Using surfaces to solve equations in free groups
BECAUSE THERE exist groups like those described in [l], it is futile to attempt to study the solution of equations in an arbitrary group. It is reasonable, however, to do so for free groups. ResultsExpand
The full spectrum of scl on recursively presented groups
We show that the set $SCL^{rp}$ of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computableExpand
The spectrum of simplicial volume
New constructions in group homology allow us to manufacture high-dimensional manifolds with controlled simplicial volume. We prove that for every dimension bigger than 3 the set of simplicial volumesExpand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
...
1
2
...