Papers
Topics
Authors
Recent
Search
2000 character limit reached

Flip graph and arc complex finite rigidity

Published 6 Oct 2023 in math.GT | (2310.04211v2)

Abstract: A subcomplex $\mathcal{X}$ of a cell complex $\mathcal{C}$ is called \emph{rigid} with respect to another cell complex $\mathcal{C}'$ if every injective simplicial map $\lambda:\mathcal{X} \rightarrow \mathcal{C}'$ has a unique extension to an injective simplicial map $\phi:\mathcal{C}\rightarrow \mathcal{C}'$. We say that a cell complex exhibits \emph{finite rigidity} if it contains a finite rigid subcomplex. Given a surface with marked points, its \textit{flip graph} and \textit{arc complex} are simplicial complexes indexing the triangulations and the arcs between marked points, respectively. In this paper, we leverage the fact that the flip graph can be embedded in the arc complex as its dual to show that finite rigidity of the flip graph implies finite rigidity of the arc complex. Thus, a recent result of the second author on the finite rigidity of the flip graph implies finite rigidity of the arc complex for a broad class of surfaces. Notably, this includes surfaces with boundary -- a setting where finite rigidity of the arc complex was previously unknown.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.