The original statement of this conjecture comes from Richard Stanley in 1985. In a nutshell, the switching reconstruction problem asks when graphs can be determined (up to isomorphism) from their switching decks. It is known that not all graphs on 4 vertices are reconstructable. It is also known ...
[ SmokeDetector | MS ] Bad ip for hostname in answer, bad ns for domain in answer, potentially bad asn for hostname in answer, potentially bad keyword in answer, potentially bad keyword in username, +1 more (251): Probability of buying a defective laptop by RentEZ on math.SE
Given a finite string of $0$s and $1$s, three actions can be done to the string:
Add or remove "00" anywhere into the string
Add or remove "111" anywhere into the string
Swap "11" with "010" or swap "010" with "11"
I would like to prove that it is impossible to transform 01 to 10 using those 3 ...
@Semiclassical In order to enforce the contest problem policy, I need a link to some place where I can see the problem list and some indication that using outside resources is against the rules. Absent such a citation, I, as a moderator, am not empowered to do very much. Non-moderator users are free to close and delete (and I would encourage them to do so).
Given a finite string of $0$s and $1$s, three actions can be done to the string:
Add or remove "00" anywhere into the string
Add or remove "111" anywhere into the string
Swap "11" with "010" or swap "010" with "11"
I would like to prove that it is impossible to transform 01 to 10 using those 3 ...
