Vanishing conjecture for filtration quotients of connected graph diagrams
Let be the diagram space with filtration quotients , where are the filtration parameters. Vanishing conjecture. For
the filtration quotients are trivial for all possible parameters . If true, the paper states that this would imply quadratic growth in for fixed , together with the displayed dimension bounds that follow from Theorem 2. The conjecture is motivated by the experimental calculations but is not proved.
References
Primary source
Jan Kneissler, “On spaces of connected graphs III: The Ladder Filtration”, arXiv:math/0301020 (2003).
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.