Realizations of multiassociahedra via bipartite rigidity
Luis Crespo Ruiz

TL;DR
This paper investigates the polytopality of multiassociahedra complexes using bipartite rigidity matrices, providing realizations for certain cases and proving non-realizability in others, with algebraic and tropical geometric insights.
Contribution
It introduces a novel approach using bipartite rigidity matrices to realize multiassociahedra as polytopes or fans, advancing understanding of their geometric structure.
Findings
Realizes $Ass_k(n)$ as a polytope for $k=2$, $n extless=10$
Realizes $Ass_k(n)$ as a fan for $k=2$, $n extless=13$ and $k=3$, $n extless=11$
Proves non-realizability for $k extgreater=3$, $n extgreater=12$ or $2k+4$
Abstract
Let denote the simplicial complex of -crossing-free subsets of edges in . Here and . It is conjectured that this simplicial complex is polytopal (Jonsson 2005). However, despite several recent advances, this is still an open problem. In this paper we attack this problem using as a vector configuration the rows of a rigidity matrix, namely, hyperconnectivity restricted to bipartite graphs. We see that in this way can be realized as a polytope for and , and as a fan for and , and for and . However, we also prove that the cases with and are not realizable in this way. We also give an algebraic interpretation of the rigidity matroid, relating it to a projection of determinantal varieties with implications in matrix completion, and prove…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Polynomial and algebraic computation
