Английская Википедия:Flip graph
In mathematics, a flip graph is a graph whose vertices are combinatorial or geometric objects, and whose edges link two of these objects when they can be obtained from one another by an elementary operation called a flip. Flip graphs are special cases of geometric graphs.
Among noticeable flip graphs, one finds the 1-skeleton of polytopes such as associahedra[1] or cyclohedra.[2]
Examples
A prototypical flip graph is that of a convex <math>n</math>-gon <math>\pi</math>. The vertices of this graph are the triangulations of <math>\pi</math>, and two triangulations are adjacent in it whenever they differ by a single interior edge. In this case, the flip operation consists in exchanging the diagonals of a convex quadrilateral. These diagonals are the interior edges by which two triangulations adjacent in the flip graph differ. The resulting flip graph is both the Hasse diagram of the Tamari lattice[3] and the 1-skeleton of the <math>(n-3)</math>-dimensional associahedron.[1]
This basic construction can be generalized in a number of ways.
Finite sets of points in Euclidean space
Let <math>T</math> be a triangulation of a finite set of points <math>\mathcal{A}\subset\mathbb{R}^d</math>. Under some conditions, one may transform <math>T</math> into another triangulation of <math>\mathcal{A}</math> by a flip. This operation consists in modifying the way <math>T</math> triangulates a circuit (a minimally affinely dependent subset of <math>\mathcal{A}</math>). More precisely, if some triangulation <math>\tau^-</math> of a circuit <math>z\subset\mathcal{A}</math> is a subset of <math>T</math>, and if all the cells (faces of maximal dimension) of <math>\tau^-</math> have the same link <math>\lambda</math> in <math>T</math>, then one can perform a flip within <math>T</math> by replacing <math>\lambda\mathord{\star}\tau^-</math> by <math>\lambda\mathord{\star}\tau^+</math>, where
- <math>
X\mathord{\star}{Y}=\{x\cup{y}:(x,y)\in{X\mathord{\times}{Y}}\}, </math>
and <math>\tau^+</math> is, by Radon's partition theorem, the unique other triangulation of <math>z</math>. The conditions just stated, under which a flip is possible, make sure that this operation results in a triangulation of <math>\mathcal{A}</math>.[4] The corresponding flip graph, whose vertices are the triangulations of <math>\mathcal{A}</math> and whose edges correspond to flips between them, is a natural generalization of the flip graph of a convex polygon, as the two flip graphs coincide when <math>\mathcal{A}</math> is the set of the vertices of a convex <math>n</math>-gon.
Topological surfaces
Another kind of flip graphs is obtained by considering the triangulations of a topological surface:[5] consider such a surface <math>\mathcal{S}</math>, place a finite number <math>n</math> of points on it, and connect them by arcs in such a way that any two arcs never cross. When this set of arcs is maximal, it decomposes <math>\mathcal{S}</math> into triangles. If in addition there are no multiple arcs (distinct arcs with the same pair of vertices), nor loops, this set of arcs defines a triangulation of <math>\mathcal{S}</math>.
In this setting, two triangulations of <math>\mathcal{S}</math> that can be obtained from one another by a continuous transformation are identical.
Two triangulations are related by a flip when they differ by exactly one of the arcs they are composed of. Note that, these two triangulations necessarily have the same number of vertices. As in the Euclidean case, the flip graph of <math>\mathcal{S}</math> is the graph whose vertices are the triangulations of <math>\mathcal{S}</math> with <math>n</math> vertices and whose edges correspond to flips between them. This definition can be straightforwardly extended to bordered topological surfaces.
The flip graph of a surface generalises that of a <math>n</math>-gon, as the two coincide when the surface is a topological disk with <math>n</math> points placed on its boundary.
Other flip graphs
A number of other flip graphs can be defined using alternative definitions of a triangulation. For instance, the flip graph whose vertices are the centrally-symmetric triangulations of a <math>(2d+2)</math>-gon and whose edges correspond to the operation of doing two centrally-symmetric flips is the 1-skeleton of the <math>d</math>-dimensional cyclohedron.[2] One can also consider an alternative flip graph of a topological surface, defined by allowing multiple arcs and loops in the triangulations of this surface.
Flip graphs may also be defined using combinatorial objects other than triangulations. An example of such combinatorial objects are the domino tilings of a given region in the plane. In this case, a flip can be performed when two adjacent dominos cover a square: it consists in rotating these dominos by 90 degrees around the center of the square, resulting in a different domino tiling of the same region.
Properties
Polytopality
Apart from associahedra and cyclohedra, a number of polytopes have the property that their 1-skeleton is a flip graph. For instance, if <math>\mathcal{A}</math> is a finite set of points in <math>\mathbb{R}^d</math>, the regular triangulations of <math>\mathcal{A}</math> are the ones that can be obtained by projecting some faces of a <math>(d+1)</math>-dimensional polytope on <math>\mathbb{R}^d</math>. The subgraph induced by these triangulations in the flip graph of <math>\mathcal{A}</math> is the 1-skeleton of a polytope, the secondary polytope of <math>\mathcal{A}</math>.[6]
Connectedness
Polytopal flip graphs are, by this property, connected. As shown by Klaus Wagner in the 1930s, the flip graph of the topological sphere is connected.[7] Among the connected flip graphs, one also finds the flip graphs of any finite 2-dimensional set of points.[8] In higher dimensional Euclidean spaces, the situation is much more complicated. Finite sets of points of <math>\mathbb{R}^d</math> with disconnected flip graphs have been found whenever <math>d</math> is at least 5.[4][9][10]
The flip graph of the vertex set of the 4-dimensional hypercube is known to be connected.[11] However, it is yet unknown whether the flip graphs of finite 3- and 4-dimensional sets of points are always connected or not.[4]
Diameter
The maximum number of flips required to transform a triangulation into another is the diameter of the flip graph. The diameter of the flip graph of a convex <math>n</math>-gon has been obtained by Daniel Sleator, Robert Tarjan, and William Thurston[12] when <math>n</math> is sufficiently large and by Lionel Pournin for all <math>n</math>. This diameter is equal to <math>2n-10</math> when <math>n\geq13</math>.[13]
The diameter of other flip graphs has been studied. For instance Klaus Wagner provided a quadratic upper bound on the diameter of the flip graph of a set of <math>n</math> unmarked points on the sphere.[7] The current upper bound on the diameter is <math>5.2n - 33.6</math>,[14] while the best-known lower bound is <math>7n/3+\Theta(1)</math>.[15] The diameter of the flip graphs of arbitrary topological surfaces with boundary has also been studied and is known exactly in several cases.[16][17][18]
See also
References
- ↑ 1,0 1,1 Шаблон:Citation
- ↑ 2,0 2,1 Шаблон:Citation
- ↑ Шаблон:Citation
- ↑ 4,0 4,1 4,2 Шаблон:Cite book
- ↑ Шаблон:Citation
- ↑ Шаблон:Citation
- ↑ 7,0 7,1 Шаблон:Citation
- ↑ Шаблон:Citation
- ↑ Шаблон:Citation
- ↑ Шаблон:Citation
- ↑ Шаблон:Citation
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite book
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite journal
