Rationality conjecture for crossing limits of periodic tiles
Let be a tile, and let . The limit
exists. Rationality conjecture for crossing limits. There exists a computable function that assigns to every tile a positive integer such that is rational with denominator at most . The existence of such a bound would establish a strong form of eventual periodicity for optimal drawings and make the asymptotic crossing rate effectively rational; this remains open.
References
Primary source
Zdenek Dvorak and Bojan Mohar, “Crossing numbers of periodic graphs”, arXiv:1405.5117 (2014).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.