Related papers: Minimal triangulations for an infinite family of l…

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…

Let $M$ be any compact four-dimensional PL-manifold with or without boundary (e.g. the four-dimensional sphere or ball). Consider the space $T(M)$ of all simplicial isomorphism classes of triangulations of $M$ endowed with the metric…

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…

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)…

We construct partitions of $\mathbb{R}^n$ into three sets $\{\mathscr{X}(1),\mathscr{X}(2),\mathscr{X}(3)\}$ that locally minimize interfacial area among compactly supported volume preserving variations and that blow down at infinity to…

We show that if a closed, oriented 3-manifold M is promised to be homeomorphic to a lens space L(n,k) with n and k unknown, then we can compute both n and k in polynomial time in the size of the triangulation of M. The tricky part is the…

In the first part of the paper we present a classification of fake lens spaces of dimension >= 5 whose fundamental group is the cyclic group of order N >= 2. The classification uses and extends the results of Wall and others in the case N =…

We study three-dimensional microlensing where two lenses are located at different distances along the line of sight. We formulate the lens equation in complex notations and recover several previous results. There are in total either 4 or 6…

We determine all the Q-fundamental surfaces in $(p,1)$-lens spaces and $(p,2)$-lens spaces with respect to natural triangulations with $p$ tetrahedra. For general $(p,q)$-lens spaces, we give an upper bound for elements of vectors which…

It is known that an ideal triangulation of a compact $3$-manifold with nonempty boundary is minimal if and only if it contains the minimum number of edges among all ideal triangulations of the manifold. Therefore, any ideal one-edge…

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

Attending to an open problem in the literature stated by Mirzakhani and Vondr\'ak, we give a lower bound of the number of non-monochromatic simplices for Sperner labelings of the vertices of a triangulation of a given $ k$-simplex with…

We compute a lower bound for the number of simplices that are needed to triangulate the Grassmann manifold $G_k(\mathbb{R}^n)$. In particular, we show that the number of top-dimensional simplices grows exponentially with $n$. More precise…

We consider the problem of minimising the number of edges that are contained in triangles, among $n$-vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for…

We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

We give an explicit construction of vertex-transitive tight triangulations of $d$-manifolds for $d\geq 2$. More explicitly, for each $d\geq 2$, we construct two $(d^2+5d+5)$-vertex neighborly triangulated $d$-manifolds whose vertex-links…

Consider a compact Riemannian manifold with boundary. Assume all maximally extended geodesics intersect the boundary at both ends. Then to each maximal geodesic segment one can form a triple consisting of the initial and final vectors of…