Polynomial comparability conjecture for exhaustion subsets of convex structures
Polynomial comparability conjecture for exhaustion subsets of convex structures
Let , and let , , , , , , , , and be the subsets of appearing in the source's exhaustion construction. Here, subsets are polynomially comparable when the comparison parameters are related by polynomial functions of .
Polynomial comparability conjecture. The following subsets of are polynomially comparable to each other:
The preceding proposition establishes ordinary comparability among several of these subsets, while the conjecture asks for the sharper polynomial dependence, including the explicitly displayed exponents. The supplied text does not indicate whether this quantitative conjecture has been resolved.
Sources & referencesView supporting material
Primary source
Zhe Sun, “Volume of the moduli space of unmarked bounded positive convex RP^2 structures”, arXiv:2001.01295 (2020).
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.