Single-survivor conjecture for competing urns on hypercubes and discrete tori
Statement
Let , let the underlying graph be either a hypercube or a discrete torus, and let the initial configuration be any nonzero configuration of the -type competing urn scheme. Single-survivor conjecture. The process has almost surely a single surviving type. The path and cycle are the only finite connected graphs known in the source to have this property for every , while coexistence is known on some other graphs; the conjecture remains open for hypercubes and discrete tori.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.