3 problems
- 0 votes0 replies0 views
Elkasapy's nilpotency conjecture for commutator words
Elkasapy's nilpotency conjecture. The lower bound is an equality:
- 0 votes0 replies0 views
The commutator-width conjecture for traces in
Let be the commutator subgroup of , and let denote its trace set. The commutator width of an element is the minimum number o…
- 0 votes0 replies0 views
The conjecture that every element of is a 1-commutator
Let . A 1-commutator is an element expressible as for some . The 1-commutator co…