ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an abelian group. A pair of finite subsets A,B⊆GA,B\subseteq G with #A=#B\#A=\#B and A∩(A+B)=∅A\cap(A+B)=\emptyset has an acyclic matching if there is a matching f:A→Bf:A\to B such that mf≠mgm_f\neq m_g for every other matching g:A→Bg:A\to B. Weak acyclic matching conjecture. Every abelian group possesses the weak acyclic matching property: for every such pair A,BA,B, there exists an acyclic matching from AA to BB. The conjecture extends the known acyclic matching results for abelian torsion-free groups, while the weak property is proposed for all abelian groups and 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.