Related papers: The complexity of detecting taut angle structures …

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…

A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.

We solve the Bonnet problem for surfaces in the homogeneous 3-manifolds with a 4-dimensional isometry group. More specifically, we show that a simply connected real analytic surface in H^2xR or S^2xR is uniquely determined pointwise by its…

A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…

The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds…

The notions Golodness and tightness for simplicial complexes come from algebra and geometry, respectively. We prove these two notions are equivalent for 3-manifold triangulations, through a topological characterization of a polyhedral…

Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following…

We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

Extending methods first used by Casson, we show how to verify a hyperbolic structure on a finite triangulation of a closed 3-manifold using interval arithmetic methods. A key ingredient is a new theoretical result (akin to a theorem by…

Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an…

We define a norm on the homology of a foliated manifold, which refines and majorizes the usual Gromov norm on homology. This norm depends in an upper semi-continuous way on the underlying foliation, in the geometric topology, and can…

Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

In this paper, we deal with hamiltonicity in planar cubic graphs G having a facial 2-factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. Moreover, we show…

For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…

It is conjectured that every cusped hyperbolic 3-manifold admits a geometric triangulation, i.e. it is decomposed into positive volume ideal hyperbolic tetrahedra. Here, we show that sufficiently highly twisted knots admit a geometric…