MathDB
IMO Shortlist 2013, Combinatorics #3

Source: IMO Shortlist 2013, Combinatorics #3

July 9, 2014
inductioncombinatoricsgraph theoryGraph coloringalgorithminvariantIMO Shortlist

Problem Statement

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy II' of each imon II. During this procedure, the two copies II' and JJ' become entangled if and only if the original imons II and JJ are entangled, and each copy II' becomes entangled with its original imon II; no other entanglements occur or disappear at this moment.
Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.