ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CC be a pairing matrix, meaning an integer n×mn\times m matrix C=(cij)C=(c_{ij}) such that nmnm is even, ci,j∈{1,2,…,nm/2}c_{i,j}\in\{1,2,\ldots,nm/2\}, no row or column contains a repeated value, and every pair (i,j)(i,j) has exactly one distinct partner (i′,j′)(i',j') with cij=ci′j′c_{ij}=c_{i'j'}. Define

ΓC=⟨a1,…,an,b1,…,bm∣aibj=ai′bj′ whenever cij=ci′j′⟩.\Gamma_C=\langle a_1,\ldots,a_n,b_1,\ldots,b_m\mid a_ib_j=a_{i'}b_{j'}\text{ whenever }c_{ij}=c_{i'j'}\rangle.

Pairing-matrix conjecture. If the generators a1,…,ana_1,\ldots,a_n and b1,…,bmb_1,\ldots,b_m of ΓC\Gamma_C are distinct, then ΓC\Gamma_C contains a nontrivial element of finite order. This is presented as an equivalent reformulation of the zero divisor conjecture over F2{\mathbb F}_2 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.