Related papers: Efficient construction of homological Seifert surf…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…
Let $\Sigma_g$ denote the closed orientable surface of genus $g$ and fix an arbitrary simplicial triangulation of $\Sigma_g$. We construct and study a natural surjective group homomorphism from the surface braid group on $n$ strands on…
We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster…
We show how to explicitly compute the homogenized curvature energy appearing in the isotropic $\Gamma$-limit for flat and for curved initial configuration Cosserat shell models, when a parental three-dimensional minimization problem on…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
Every surface that is intrinsically polyhedral can be represented by a portalgon: a collection of polygons in the Euclidean plane with some pairs of equally long edges abstractly identified. While this representation is arguably simpler…
We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \varepsilon, \delta <1$, along with \texttt{Degree}, \texttt{Neighbour}, \texttt{Edge} and \texttt{RandomEdge} query access to $G$, we…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
It is not known whether there exists a computable function bounding the number of Pachner moves needed to connect any two triangulation of a compact 3-manifold. In this paper we find an explicit bound of this kind for all Haken 3-manifolds…
Let $Y_1$ be a closed, oriented 3-manifold and $\Sigma$ denote a non-separating closed, orientable surface in $Y_1$ which consists of two connected components of the same genus. By cutting $Y_1$ along $\Sigma$ and re-gluing it using an…
We generalize the technique of [Solving Dirichlet boundary-value problems on curved domains by extensions from subdomains, SIAM J. Sci. Comput. 34, pp. A497--A519 (2012)] to elliptic problems with mixed boundary conditions and elliptic…
Physically meaningful periodic solutions to certain integrable partial differential equations are given in terms of multi-dimensional theta functions associated to real Riemann surfaces. Typical analytical problems in the numerical…
We consider complements of standard Seifert surfaces of special alternating links. On these handlebodies, we use Honda's method to enumerate those tight contact structures whose dividing sets are isotopic to the link, and find their number…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
In this paper we develop a reconstruction algorithm for the solution of an inverse boundary value problem dealing with a semilinear elliptic partial differential equation of interest in cardiac electrophysiology. The goal is the detection…
We compute the cohomological Hall algebra of zero-dimensional sheaves on an arbitrary smooth quasi-projective surface $S$ with pure cohomology, deriving an explicit presentation by generators and relations. When $S$ has trivial canonical…