English
Related papers

Related papers: There are only two nonobtuse binary triangulations…

200 papers

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…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…

Combinatorics · Mathematics 2014-02-05 Andrei Asinowski , Alon Regev

In the present paper we find a bijection between the set of small covers over an $n$-cube and the set of acyclic digraphs with $n$ labeled nodes. Using this, we give a formula of the number of small covers over an $n$-cube (generally, a…

Geometric Topology · Mathematics 2014-10-01 Suyoung Choi

This paper will devote to construct a family of fifth degree cubature formulae for $n$-cube with symmetric measure and $n$-dimensional spherically symmetrical region. The formula for $n$-cube contains at most $n^2+5n+3$ points and for…

Numerical Analysis · Mathematics 2013-01-30 Zhaoliang Meng , Zhongxuan Luo

Triangular numbers that are multiple of other triangular numbers are investigated. It is known that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers which are triangular numbers. If the…

General Mathematics · Mathematics 2021-02-25 Vladimir Pletser

We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…

Combinatorics · Mathematics 2013-12-17 Csaba D. Toth , Adrian Dumitrescu

We consider in this work triangulations of $\mathbb{Z}^n$ that are periodic along $\mathbb{Z}^n$. They generalize the triangulations obtained from Delaunay tessellations of lattices. Other important property is the regularity and…

Combinatorics · Mathematics 2021-04-16 Mathieu Dutour Sikirić , Alexey Garber

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

Combinatorics · Mathematics 2016-07-21 Hailun Zheng

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Number Theory · Mathematics 2010-06-29 Siu-lun Alan Lee

For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1, d - 1}(\epsilon)$ denote the sphere product $S^{1} \times S^{d - 1}$ if $\epsilon = 0$ and the twisted $S^{d - 1}$ bundle over $S^{1}$ if $\epsilon = 1$. The main results of this…

Geometric Topology · Mathematics 2007-10-02 Bhaskar Bagchi , Basudeb Datta

We show that a point set of cardinality $n$ in the plane cannot be the vertex set of more than $59^n O(n^{-6})$ straight-edge triangulations of its convex hull. This improves the previous upper bound of $276.75^n$.

Combinatorics · Mathematics 2007-05-23 Francisco Santos , Raimund Seidel

A quadrangle in the Euclidean plane is called $n$-self-affine if it has a dissection into $n$ affine images of itself. All convex quadrangles are known to be $n$-self-affine for every $n \ge 5$. The only $2$-self-affine convex quadrangles…

Combinatorics · Mathematics 2026-05-25 Christian Richter , Felix Zimmermann

In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…

Combinatorics · Mathematics 2025-04-25 Belén Cruces , Clemens Huemer , Dolores Lara

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

Combinatorics · Mathematics 2025-05-23 Wen Chen , Jinjin Liang , Erxiao Wang

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…

Geometric Topology · Mathematics 2014-10-01 William Jaco , J. Hyam Rubinstein , Stephan Tillmann

An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…

Metric Geometry · Mathematics 2019-02-14 Michael Beeson

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Algebraic Topology · Mathematics 2024-08-07 Sergey Avvakumov , Roman Karasev

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…

Combinatorics · Mathematics 2013-11-05 Alexandre Boulch , Éric Colin de Verdière , Atsuhiro Nakamoto

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…

Combinatorics · Mathematics 2025-06-09 L. Á. Calvo , S. Merchán , D. Raboso , J. Rodrigo , J. S. Rodríguez

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

Combinatorics · Mathematics 2012-10-29 Oswin Aichholzer , Ruy Fabila-Monroy , Thomas Hackl , Clemens Huemer , Jorge Urrutia