Related papers: Simplifying triangulations of S^3
A taut ideal triangulation of a 3-manifold is a topological ideal triangulation with extra combinatorial structure: a choice of transverse orientation on each ideal 2-simplex, satisfying two simple conditions. The aim of this paper is to…
We revisit the classical Perspective-Three-Point (P3P) problem, which aims to recover the absolute pose of a calibrated camera from three 2D-3D correspondences. It has long been known that P3P can be reduced to a quartic polynomial with…
In this paper, we consider decompositions of 3-manifolds with three handlebodies. We classify such decompositions of the 3-sphere and lens spaces with small genera. These decompositions admit operations called stabilizations. We also…
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…
Let M be an oriented compact 3-manifold and let T be a (loose) triangulation of M, with ideal vertices at the components of the boundary of M and possibly internal vertices. We show that any spin structure s on M can be encoded by extra…
This paper serves as our first effort to develop a new triangular spectral element method (TSEM) on unstructured meshes, using the rectangle-triangle mapping proposed in the conference note [21]. Here, we provide some new insights into the…
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of…
Suppose $K$ is an unknot lying in the 1-skeleton of a triangulated 3-manifold with $t$ tetrahedra. Hass and Lagarias showed there is an upper bound, depending only on $t$, for the minimal number of elementary moves to untangle $K$. We give…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
We study generalization of median triangles on the plane with two complex parameters. By specialization of the parameters, we produce periodical motion of a triangle whose vertices trace each other on a common closed orbit.
We give a short and elementary proof of the boundedness of triangular Hilbert transform along non-flat curves definable in a polynomially bounded o-minimal structure. We also provide a criterion on the multiplier to determine whether the…
A simplified trisection is a trisection map on a 4-manifold such that, in its critical value set, there is no double point and cusps only appear in triples on innermost fold circles. We give a necessary and sufficient condition for a…
We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.
We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…
Multi-shift triangular solves are basic linear algebra calculations with applications in eigenvector and pseudospectra computation. We propose blocked algorithms that efficiently exploit Level 3 BLAS to perform multi-shift triangular solves…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into 3 spanning trees. We extend here definitions and algorithms for Schnyder woods to closed orientable surfaces of arbitrary…