Conjecture on the limiting lower bound for Wecken-map density

For each nn, let dnd_n^* be the explicit lower-bound quantity defined by

dn=c=0nb=0nc(nc)(ncb)2b(n1n(2n1)2)cKj=1b2(n1)2(2c+b+j1)n(2n1)2,d_n^*= \sum_{c=0}^{n} \sum_{b=0}^{n-c} \binom{n}{c}\binom{n-c}{b}2^b\left(\frac{n-1}{n(2n-1)^2}\right)^c K\prod_{j=1}^{b}\frac{2(n-1)^2-(2c+b+j-1)}{n(2n-1)^2},

where

K=k=c+b+1n4(n1)4(8k6)(n1)2+4k26k+2n(n1)(2n1)2.K=\prod_{k=c+b+1}^{n}\frac{4(n-1)^4-(8k-6)(n-1)^2+4k^2-6k+2}{n(n-1)(2n-1)^2}.

Limiting lower-bound conjecture. The sequence of lower bounds satisfies

limndn=e2.1353.\lim_{n\to\infty}d_n^*=e^{-2}\approx.1353.

The displayed values appear to approach a limit, but the source says that the formula is too complicated to evaluate asymptotically easily. Since dnd_n^* is a lower bound for the density of the relevant set of maps, this would identify the limiting value of this particular bound, not directly the density itself.

Sources & referencesView supporting material

Primary source

Jacqueline Brimley, Matthew Griisser, Allison Miller and P. Christopher Staecker, “The Wecken property for random maps on surfaces with boundary”, arXiv:1109.0218 (2011).

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.