Asymptotic growth conjecture for graph-complex homotopy ranks
Asymptotic growth conjecture for graph-complex homotopy ranks
Let denote the homotopy fibre of the inclusion of embeddings into immersions, and let denote its component of complexity and Hodge degree . For fixed , the asymptotic growth conjecture asserts that the rank of
has asymptotic as . The conjecture is motivated by computations for the subcomplex with two cycles, where the homology ranks grow linearly with ; the general asymptotic claim remains open.
Sources & referencesView supporting material
Primary source
Gregory Arone and Victor Turchin, “Graph-complexes computing the rational homotopy of high dimensional analogues of spaces of long knots”, arXiv:1108.1001 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.