Asymptotic growth conjecture for knotoid diagrams

Let sκns\kappa_n be the number of nn-crossing knotoid diagrams, let sknsk_n be the number of nn-crossing knotoid shadows, and let μK\mu_K be the knotoid-shadow connective constant. Knotoid asymptotic-growth conjecture. There are constants cc' and γ\gamma' such that

sκn2n=sknncμKnnγ1,\frac{s\kappa_n}{2^n}=sk_n\mathop{\sim}_{n\to\infty}c'\mu_K^n\cdot n^{\gamma'-1},

with the additional belief that γ=γ\gamma'=\gamma. This refines the exponential-growth assertion by predicting a power-law correction; the asymptotic form and the equality of exponents remain conjectural.

Sources & referencesView supporting material

Primary source

Harrison Chapman, “Slipknotting in Random Diagrams”, arXiv:1803.07114 (2018).

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.