Related papers: Flip graph and arc complex finite rigidity
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…
We study the arc complex of a surface with marked points in the interior and on the boundary. We prove that the isomorphism type of the arc complex determines the topology of the underlying surface, and that in all but a few cases every…
A classical combinatorial fact is that the simplicial complex consisting of disjointly embedded chords in a convex planar polygon is a sphere. For any surface F with non-empty boundary, there is an analogous complex Arc(F) consisting of…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…
Barnette and Edelson have shown that there are finitely many minimal triangulations of a connected compact 2-manifold M. Similar finiteness results are obtained for cellular partial triangulations that satisfy various girth inequality…
Let $G$ be a graph embedded on an orientable surface. Given a class ${\cal C}$ of facial circuits of $G$ as a forbidden class, we give a sufficient-necessary condition for that an $\alpha$-orientation (orientation with prescribed…
In the study of holomorphic maps, the term "rigidity" refers to certain types of results that give us very specific information about a general class of holomorphic maps owing to the geometry of their domains or target spaces. Under this…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
For each closed surface of genus $g\ge3$, we find a finite subcomplex of the separating curve complex that is rigid with respect to incidence-preserving maps.
In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
A \emph{finite cover} of a group $G$ is a finite collection $\mathcal{C}$ of proper subgroups of $G$ with the property that $\bigcup \mathcal{C} = G$. A finite group admits a finite cover if and only if it is noncyclic. More generally, it…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an operation that matches the isolated vertex and,…
Finiteness conditions for $C^*$-algebras like AF-embeddability, quasidiagonality, stable finiteness have been studied by many authors and shown to be equivalent for certain classes of $C^*$-algebras. For example, Schfhauser proves that…