37 research outputs found
Handle slides for delta-matroids
A classic exercise in the topology of surfaces is to show that, using handle
slides, every disc-band surface, or 1-vertex ribbon graph, can be put in a
canonical form consisting of the connected sum of orientable loops, and either
non-orientable loops or pairs of interlaced orientable loops. Motivated by the
principle that ribbon graph theory informs delta-matroid theory, we find the
delta-matroid analogue of this surface classification. We show that, using a
delta-matroid analogue of handle-slides, every binary delta-matroid in which
the empty set is feasible can be written in a canonical form consisting of the
direct sum of the delta-matroids of orientable loops, and either non-orientable
loops or pairs of interlaced orientable loops. Our delta-matroid results are
compatible with the surface results in the sense that they are their ribbon
graphic delta-matroidal analogues
Excluded Minors and the Ribbon Graphs of Knots
In this paper we consider minors of ribbon graphs (or, equivalently,
cellularly embedded graphs). The theory of minors of ribbon graphs differs from
that of graphs in that contracting loops is necessary and doing this can create
additional vertices and components. Thus the ribbon graph minor relation is
incompatible with the graph minor relation. We discuss excluded minor
characterisations of minor closed families of ribbon graphs. Our main result is
an excluded minor characterisation of the family of ribbon graphs that
represent knot and link diagrams
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
Q(sqrt(-3))-Integral Points on a Mordell Curve
We use an extension of quadratic Chabauty to number fields,recently developed by the author with Balakrishnan, Besser and M ̈uller,combined with a sieving technique, to determine the integral points overQ(√−3) on the Mordell curve y2 = x3 − 4