arXiv math/06017462006-01-30math.CO

Geometric bistellar flips. The setting, the context and a construction

Francisco Santos

备注：: 30 pages
发表信息：: In "Proceedings of the International Congress of Mathematicians, 2006" (M. Sanz-Sole, J. Soria, J. L. Varona, J. Verdera, eds.), Eur. Math. Soc., 2006, Vol III, pp. 931-962

英文摘要：

We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry, topological combinatorics, and other areas. As a new result, we announce the construction of a point set in general position with a disconnected space of triangulations. This shows, for the first time, that the poset of strict polyhedral subdivisions of a point set is not always connected.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Connectivity of Triangulation Flip Graphs in the Plane

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation flips an edge (an edge flip), removes a non-extreme point of degree 3, or adds a point in P \ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The edge flip…

2020-08-14cs.CGmath.CO

Simplicial moves on balanced complexes

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly $(d+1)$-colored) triangulation of a combinatorial $d$-manifold into another balanced triangulation. These moves form a natural analog of bistellar flips (also known as Pachner moves). Specifically, we establish the following theorem: any two balanced triangulations of a closed combinatorial $d$-manifold can be connected by a sequence of cross-flips. Along the way we prove that for every $m \geq d+2$ and any closed combinatorial $d$-manifold $M$, two $m$-colored triangulations of $M$ can be connected by …

2017-08-30math.COmath.GT

Geometric moves relate geometric triangulations

A geometric triangulation of a Riemannian manifold is a triangulation where the interior of each simplex is totally geodesic. Bistellar moves are local changes to the triangulation which are higher dimensional versions of the flip operation of triangulations in a plane. We show that geometric triangulations of a compact hyperbolic, spherical or Euclidean manifold are connected by geometric bistellar moves (possibly adding or removing vertices), after taking sufficiently many derived subdivisions. For dimensions 2 and 3, we show that geometric triangulations of such manifolds are directly relat…

2020-06-30math.COmath.GT

Quiver combinatorics for higher-dimensional triangulations

We investigate the combinatorics of quivers that arise from triangulations of even-dimensional cyclic polytopes. Work of Oppermann and Thomas pinpoints such quivers as the prototypes for higher-dimensional cluster theory. We first show that a $2d$-dimensional triangulation has no interior $(d + 1)$-simplices if and only if its quiver is a cut quiver of type $A$, in the sense of Iyama and Oppermann. This is a higher-dimensional generalisation of the fact that triangulations of polygons with no interior triangles correspond to orientations of an $A_{n}$ Dynkin diagram. An application of this fir…

2021-12-16math.COmath.RT

受限翻转图的S³三角剖分的树干

The Trunk of the Restricted Flip Graph of Triangulated S^3

研究了S³三角剖分的受限翻转图的结构，证明了树干在1-4翻转下的封闭性，并展示了其连通性和计算结果。

2026-09-01math.CO

具有无界翻转宽度的几何图

Geometric Graphs with Unbounded Flip-Width

本文证明多种几何图（如区间图、置换图、圆图等）具有无界翻转宽度，该概念由Toruńczyk提出，扩展了图宽度理论的应用范围。

2023-06-22cs.CGmath.CO

更多相关论文收起更多论文

Higher dimensional cluster combinatorics and representation theory

Higher Auslander algebras were introduced by Iyama generalizing classical concepts from representation theory of finite dimensional algebras. Recently these higher analogues of classical representation theory have been increasingly studied. Cyclic polytopes are classical objects of study in convex geometry. In particular, their triangulations have been studied with a view towards generalizing the rich combinatorial structure of triangulations of polygons. In this paper, we demonstrate a connection between these two seemingly unrelated subjects. We study triangulations of even-dimensional cycli…

2011-07-04math.COmath.RT

Rainbow cycles in flip graphs

The flip graph of triangulations has as vertices all triangulations of a convex $n$-gon, and an edge between any two triangulations that differ in exactly one edge. An $r$-rainbow cycle in this graph is a cycle in which every inner edge of the triangulation appears exactly $r$ times. This notion of a rainbow cycle extends in a natural way to other flip graphs. In this paper we investigate the existence of $r$-rainbow cycles for three different flip graphs on classes of geometric objects: the aforementioned flip graph of triangulations of a convex $n$-gon, the flip graph of plane trees on an ar…

2018-02-15cs.CGmath.CO

在几何和组合场景中翻转奇匹配

Flipping odd matchings in geometric and combinatorial settings

研究奇匹配的重配置问题，提出组合场景中任意两奇匹配可相互重配置的图的多项式时间特征，证明相关翻转图直径线性及转换问题NP完全，且凸点集几何场景中该问题为FPT。

2025-08-25cs.CGcs.DMmath.CO

Flips in symmetric separated set-systems

For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman). Leclerc and Zelevinsky showed that the set of maximal strongly (resp. weakly) separated collections in $2^{[n]}$ is connected via flips, or mutations, ``in the presence of six (resp. four) witnesses''. We give a symmetric analog of those results, by showing that each maximal symmetric strongly (weakly) separated collection in $2^{[n]}$ can be obtained from any ot…

2022-06-14math.CO

Once punctured disks, non-convex polygons, and pointihedra

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometric properties of these graphs and how they relate to one another. In particular, we show that the embeddings between them are strongly convex (or, said otherwise, totally geodesic). We also find bounds on the diameters of these graphs, sometimes using the strongly convex embeddin…

2016-02-15math.COmath.GT

凸多边形三角剖分的翻转距离 / 二叉树的旋转距离是NP难的

Flip Distance Between Triangulations of Convex Polygons is NP-Complete

Graz University of Technology（格拉茨工业大学）

研究证明凸多边形三角剖分的翻转距离和二叉树的旋转距离问题均为NP难问题。

2026-07-28cs.CCcs.CGcs.DM

Flips in combinatorial pointed pseudo-triangulations with face degree at most four

In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric pseudo-triangulation, which in general is not the case if faces may have size larger than 4. Moreover, we prove that the flip graph of combinatorial 4-PPTs is connected and has diameter $O(n^2)$, even in the case of labeled vertices with fixed outer face. For this case we provide an $Ω(n\log n)$ lower bound.

2014-10-31cs.CGcs.DMmath.CO

平面缠结图与不相交三角剖分对的采样

Sampling planar tanglegrams and pairs of disjoint triangulations

本文将平面缠结图的均匀随机生成问题归结为不相交三角剖分对的采样问题，通过推广翻转操作构造连通正则翻转图，并证明随机游走收敛到均匀分布，同时给出近最优直径界。

2023-04-11math.COmath.PR

The polytope of non-crossing graphs on a planar point set

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a geometric graph together with a subset of its vertices. The poset of non-crossing graphs on $\A$ appears as the complement of the star of a face in that polyhedron. The polyhedron has a unique maximal bounded face, of dimension $2n_i +n -3$ where $n_i$ is the number of points of $\A$ in the interior of $\conv(\A)$. The vertices of this polytope are all the pseu…

2003-05-30math.COmath.MG