The asymptotic index-subgroup count conjecture for braid groups

About 22 years old · traced to

Let BnB_n be the braid group on nn strands, and let ak(Bn)a_k(B_n) denote the number of subgroups of index kk in BnB_n. For nn sufficiently large, write c(k/n)c(k/n) for a constant depending only on the ratio k/nk/n. Asymptotic index-subgroup count conjecture. For all n≫0n\gg 0,

ak(Bn)={1if n∤k,c(k/n)⋅n+1if n∣k.a_k(B_n)= \begin{cases} 1 & \text{if } n\nmid k,\\ c(k/n)\cdot n+1 & \text{if } n\mid k. \end{cases}

The preceding computations establish this pattern for several ranges of kk and nn, including ak(Bn)=1a_k(B_n)=1 in specified nondivisible ranges and linear formulas when k=nk=n or k=2nk=2n. The conjecture predicts that these behaviors persist for all sufficiently large braid groups.

References

Primary source

Daniel Matei and Alexander I. Suciu, “Counting homomorphisms onto finite solvable groups”, arXiv:math/0405122 (2005).

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.