Related papers: Determining triangulations and quadrangulations by…
Despite the moduli space of triangles being three dimensional, we prove the existence of two triangles which are not isometric to each other for which the first, second and fourth Dirichlet eigenvalues coincide, establishing a numerical…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least $c$, and…
Inspired by a question of Ferrari in the physics context of JT gravity, we introduce and enumerate a combinatorial family of quadrangulations of the disk, called rigid quadrangulations. These form a subclass of the flat quadrangulations in…
An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…
Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…
This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…
We investigate several measures of peripherality for vertices and edges in networks. We improve asymptotic bounds on the maximum value achieved by edge peripherality, edge sum peripherality, and the Trinajsti\'c index over $n$ vertex…
We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…
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.
We study triangulations $\cal T$ defined on a closed disc $X$ satisfying the following condition: In the interior of $X$, the valence of all vertices of $\cal T$ except one of them (the irregular vertex) is $6$. By using a flat singular…
We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the…
We prove a degree-six inequality on convex quadrilaterals. This inequality originated from work on the Atiyah-Sutcliffe conjectures on configurations of points in \Bbb{R} ^{3}.
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
We study the minimal degrees and gonalities of curves on complete intersections. We prove a classical conjecture which asserts that the degree of any curve on a general complete intersection $X \subseteq \mathbb{P}^N$ cut out by polynomials…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of…
We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…