Realizations of the associahedron and cyclohedron

We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and compare them to the permutahedron of type A_n and B_n respectively. The coordinates are obtained by an algorithm which uses an oriented Coxeter graph of type A_n or B_n respectively as only input and which specialises to a procedure presented by J.-L. Loday for a certain orientation of A_n. The described realizations have cambrian fans of type A and B as normal fans. This settles a conjecture of N. Reading for cambrian fans of these types.Comment: v2: 18 pages, 7 figures; updated version has revised introduction and updated Section 4; v3: 21 pages, 2 new figures, added statement (b) in Proposition 1.4. and 1.7 plus extended proof; added references [1], [29], [30]; minor changes with respect to presentatio

A History of Flips in Combinatorial Triangulations

Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert one into the other? This question has occupied researchers for over 75 years. We provide a comprehensive survey, including full proofs, of the various attempts to answer it.Comment: Added a paragraph referencing earlier work in the vertex-labelled setting that has implications for the unlabeled settin

Flip Distance Between Two Triangulations of a Point-Set is NP-complete

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two natural generalizations of the problem are NP-complete, namely computing the minimum number of flips between two triangulations of (1) a polygon with holes; (2) a set of points in the plane

On ideal triangulations of surfaces up to branched transit equivalences

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by b-flips (i.e. branched diagonal exchanges) and isotopy keeping V point-wise fixed. We extend a well known connectivity result for `naked' triangulations; in particular in the generic case when S has negative Euler-Poincare' characteristic c(S), we show that branched triangulations are equivalent to each other if c(S) is even, while this holds also for odd c(S) possibly after the complete inversion of one of the two branchings. Moreover we show that under a mild assumption, two branchings on a same triangulation are connected via a sequence of inversions of ambiguous edges (and possibly the total inversion of one of them). A natural organization of the b-flips in subfamilies gives rise to restricted transit equivalences with non trivial (even infinite) quotient sets. We analyze them in terms of certain preserved structures of differential topological nature carried by any branched triangulations; in particular a pair of transverse foliations with determined singular sets contained in V, including as particular cases the configuration of the vertical and horizontal foliations of the square of an Abelian differential on a Riemann surface.Comment: 22 pages, 11 figure

IST Austria Thesis

This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph. For triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton. In the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars