Rationality conjecture for crossing limits of periodic tiles

From papers

Let TT be a tile, and let cn(T)=cr((Tn))c_n(T)=\operatorname{cr}(\bigcirc(T^n)). The limit

c(T)=limncn(T)nc(T)=\lim_{n\to\infty}\frac{c_n(T)}{n}

exists. Rationality conjecture for crossing limits. There exists a computable function ff that assigns to every tile TT a positive integer f(T)f(T) such that c(T)c(T) is rational with denominator at most f(T)f(T). 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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Zdenek Dvorak and Bojan Mohar, “Crossing numbers of periodic graphs”, arXiv:1405.5117 (2014).

Solutions 0

No solutions have been posted yet.