136 research outputs found
The geometry of flip graphs and mapping class groups
The space of topological decompositions into triangulations of a surface has
a natural graph structure where two triangulations share an edge if they are
related by a so-called flip. This space is a sort of combinatorial
Teichm\"uller space and is quasi-isometric to the underlying mapping class
group. We study this space in two main directions. We first show that strata
corresponding to triangulations containing a same multiarc are strongly convex
within the whole space and use this result to deduce properties about the
mapping class group. We then focus on the quotient of this space by the mapping
class group to obtain a type of combinatorial moduli space. In particular, we
are able to identity how the diameters of the resulting spaces grow in terms of
the complexity of the underlying surfaces.Comment: 46 pages, 23 figure
Multi-triangulations as complexes of star polygons
Maximal -crossing-free graphs on a planar point set in convex
position, that is, -triangulations, have received attention in recent
literature, with motivation coming from several interpretations of them.
We introduce a new way of looking at -triangulations, namely as complexes
of star polygons. With this tool we give new, direct, proofs of the fundamental
properties of -triangulations, as well as some new results. This
interpretation also opens-up new avenues of research, that we briefly explore
in the last section.Comment: 40 pages, 24 figures; added references, update Section
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
Non ambiguous structures on 3-manifolds and quantum symmetry defects
The state sums defining the quantum hyperbolic invariants (QHI) of hyperbolic
oriented cusped -manifolds can be split in a "symmetrization" factor and a
"reduced" state sum. We show that these factors are invariants on their own,
that we call "symmetry defects" and "reduced QHI", provided the manifolds are
endowed with an additional "non ambiguous structure", a new type of
combinatorial structure that we introduce in this paper. A suitably normalized
version of the symmetry defects applies to compact -manifolds endowed with
-characters, beyond the case of cusped manifolds. Given a
manifold with non empty boundary, we provide a partial "holographic"
description of the non-ambiguous structures in terms of the intrinsic geometric
topology of . Special instances of non ambiguous structures can be
defined by means of taut triangulations, and the symmetry defects have a
particularly nice behaviour on such "taut structures". Natural examples of taut
structures are carried by any mapping torus with punctured fibre of negative
Euler characteristic, or by sutured manifold hierarchies. For a cusped
hyperbolic -manifold which fibres over , we address the question of
determining whether the fibrations over a same fibered face of the Thurston
ball define the same taut structure. We describe a few examples in detail. In
particular, they show that the symmetry defects or the reduced QHI can
distinguish taut structures associated to different fibrations of . To
support the guess that all this is an instance of a general behaviour of state
sum invariants of 3-manifolds based on some theory of 6j-symbols, finally we
describe similar results about reduced Turaev-Viro invariants.Comment: 58 pages, 32 figures; exposition improved, ready for publicatio
Cataloguing PL 4-manifolds by gem-complexity
We describe an algorithm to subdivide automatically a given set of PL
n-manifolds (via coloured triangulations or, equivalently, via
crystallizations) into classes whose elements are PL-homeomorphic. The
algorithm, implemented in the case n=4, succeeds to solve completely the
PL-homeomorphism problem among the catalogue of all closed connected PL
4-manifolds up to gem-complexity 8 (i.e., which admit a coloured triangulation
with at most 18 4-simplices). Possible interactions with the (not completely
known) relationship among different classification in TOP and DIFF=PL
categories are also investigated. As a first consequence of the above PL
classification, the non-existence of exotic PL 4-manifolds up to gem-complexity
8 is proved. Further applications of the tool are described, related to
possible PL-recognition of different triangulations of the K3-surface.Comment: 25 pages, 5 figures. Improvements suggested by the refere
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n^7) on the length of the flip sequence.
Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture
- …