Djoković’s Conjecture A for PU(n,1)
Statement
For every integer , the involution length of is exactly : every can be written as a product of at most four nontrivial involutions, and some element cannot be written as a product of three involutions. Moreover, every is a single commutator, i.e. there exist such that .
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.