Generic polygon invariance conjecture for higher associahedra

Let A\mathcal{A} be the set of vertices of a generic convex nn-gon, and let \UpsigmaA,k\Upsigma_{\mathcal{A},k} be the associated higher associahedron. The generic polygon invariance conjecture. The ff-vector of \UpsigmaA,k\Upsigma_{\mathcal{A},k} depends only on nn and kk. This would extend the combinatorial invariance of the ordinary associahedron to higher associahedra for generic convex polygons, despite the dependence on the point configuration in the nongeneric setting. The claim is supported in the source by computational evidence, but no resolution is given.

Sources & referencesView supporting material

Primary source

Pavel Galashin, Alexander Postnikov and Lauren Williams, “Higher secondary polytopes and regular plabic graphs”, arXiv:1909.05435 (2019).

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.