Related papers: Trisecting a 4-dimensional book into three chapter…
We provide an algorithm to determine the Heegaard genus of simple 3-manifolds with non-empty boundary. More generally, we supply an algorithm to determine (up to ambient isotopy) all the Heegaard splittings of any given genus for the…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
We show the existence of a $4$-manifold with boundary that admits two non-diffeomorphic minimal genus relative trisections of the same $(g,k;p,b)$-type. To prove this, we introduce a simple operation that produces a trisection diagram of a…
One approach to achieving correct finite element assembly is to ensure that the local orientation of facets relative to each cell in the mesh is consistent with the global orientation of that facet. Rognes et al. have shown how to achieve…
Graph manifolds are a class of compact, orientable 3-manifolds introduced in 1967 by Waldhausen as a generalization of Seifert fibered 3-manifolds. From the point of view of Thurston's geometrization program, graph manifolds are exactly the…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
It is shown that the number of pages required for a book embedding of a graph is the maximum of the numbers needed for any of the maximal nonseparable subgraphs and that a plane graph in which every triangle bounds a face has a two-page…
Image triangulation, the practice of decomposing images into triangles, deliberately employs simplification to create an abstracted representation. While triangulating an image is a relatively simple process, difficulties arise when…
The first goal of this paper is to construct examples of higher dimensional contact manifolds with specific properties. Our main results in this direction are the existence of tight virtually overtwisted closed contact manifolds in all…
In a recent paper, {\it Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (II)}, we discussed two algorithms for deforming and contracting a simply connected discrete closed manifold into a discrete sphere.…
This is a guide on how to create 3d printable models of tropical surfaces, curves, and combinations thereof. It uses Polymake to construct bounded models of the tropical objects, and OpenSCAD to thicken and export them to any common 3D…
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
We introduce bridge trisections of knotted surfaces in the four-sphere. This description is inspired by the work of Gay and Kirby on trisections of four-manifolds and extends the classical concept of bridge splittings of links in the…
This work concludes a series of four papers on the foundational theory of orbifolds and stacks. We apply the abstract theory, developed in its predecessors, to orbifolds derived from manifolds. Specifically, we show how the very concrete…
Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets…
Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…
We offer a new proof that two closed oriented 4-manifolds are cobordant if their signatures agree, in the spirit of Lickorish's proof that all closed oriented 3-manifolds bound 4-manifolds. Where Lickorish uses Heegaard splittings we use…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
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…