The pairing-matrix finite-order reformulation of the zero divisor conjecture
Statement
Let be a pairing matrix, meaning an integer matrix such that is even, , no row or column contains a repeated value, and every pair has exactly one distinct partner with . Define
Pairing-matrix conjecture. If the generators and of are distinct, then contains a nontrivial element of finite order. This is presented as an equivalent reformulation of the zero divisor conjecture over and is stated as open in the supplied context.
Record
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.