ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an abelian group. It has the weak acyclic matching property if, for every pair of finite subsets AA and BB of GG with #A=#B\#A=\#B and A∩(A+B)=∅A\cap(A+B)=\emptyset, there is at least one acyclic matching from AA to BB.

Weak acyclic matching conjecture. There exists a prime pp such that Z/pZ\mathbb{Z}/p\mathbb{Z} does not satisfy the weak acyclic matching property.

This is a weaker property than the acyclic matching property because the condition A∩(A+B)=∅A\cap(A+B)=\emptyset ensures that every bijection from AA to BB is a matching. The paper notes that infinitely many prime cyclic groups fail the acyclic matching property, but whether one fails the weak version remains open.

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.