Related papers: An Algorithm taking Kirby diagrams to Trisection d…

An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that…

We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like several existing algorithms, it achieves approximation ratio O(log n). Unlike previous algorithms, it uses…

In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…

For each closed oriented 3-manifold $M$ in Thurston's picture, the set of degrees of self-maps on $M$ is given.

We compute the oriented cobordism group of fold maps of 4-manifolds into the space with all the possible restrictions (and also with no restriction) to the singular fibers. We also give geometric invariants which describe completely the…

Finite element codes typically use data structures that represent unstructured meshes as collections of cells, faces, and edges, each of which require associated coordinate systems. One then needs to store how the coordinate system of each…

In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…

Recently Gay and Kirby described a new decomposition of smooth closed $4$-manifolds called a trisection. This paper generalises Heegaard splittings of $3$-manifolds and trisections of $4$-manifolds to all dimensions, using triangulations as…

Suppose there are two framed links in a compact, connected 3-manifold (possibly with boundary, or non-orientable) such that the associated 3-manifolds obtained by surgery are homeomorphic (relative to their common boundary, if there is…

We show that any smooth, closed, oriented, connected 4--manifold can be trisected into three copies of $\natural^k (S^1 \times B^3)$, intersecting pairwise in 3--dimensional handlebodies, with triple intersection a closed 2--dimensional…

We present explicit algorithms for simplifying the topology of indefinite fibrations on 4-manifolds, which include broken Lefschetz fibrations and indefinite Morse 2-functions. The algorithms consist of sequences of moves, which modify…

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…

Given two smooth, oriented, closed 4-manifolds $M_1$ and $M_2$, we construct two invariants, $D^P(M_1, M_2)$ and $D(M_1, M_2)$, coming from distances in the pants complex and the dual curve complex respectively. To do this, we adapt work of…

We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer…

We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…

We propose an inexact optimization algorithm on Riemannian manifolds, motivated by quadratic discrimination tasks in high-dimensional, low-sample-size (HDLSS) imaging settings. In such applications, gradient evaluations are often biased due…

Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…

Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing…

We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes…