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 the presence of a fan isomorphic to in the tropicalization of that variety.

生成讲解博客的中文版本

生成AI智能校验的中文版本