Fastest-convergence conjecture for the complementing flip process
Fastest-convergence conjecture for the complementing flip process
Let be a convergent flip process of order with a single destination. For , let denote its lower convergence time.
Fastest-convergence conjecture. For every such and every ,
The bound is attained by the complementing flip process, whose convergence time is described in the source as half that of an ignorant process with output density . The source does not state whether the conjecture has been resolved.
Sources & referencesView supporting material
Primary source
Pedro Araújo, Jan Hladký, Eng Keat Hng and Matas Šileikis, “Prominent examples of flip processes”, arXiv:2206.03884 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.