Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
2 answers
850 views

Three-dimensional triangulations with fixed number of vertices

My question is the following: Are there triangulations of $S^3$ which (a) are non-degenerate, (b) have four vertices, and (c) have no edges of degree two? A side question: If one represents this ...
Kregnach's user avatar
  • 183
8 votes
3 answers
921 views

Alternating Sum Involving Catalan Numbers

I was wondering if anyone knew how to obtain a simpler closed form of the following sum(or had any other insights regarding it): $$\sum_{k=0}^n (-1)^k{n \choose k} C_{2n-2-k} $$ Here $C_n = \frac{1}{n+...
interstice's user avatar
7 votes
1 answer
186 views

How many maximal triangulations of a rectangle?

I posted the following question on MathStackExchange, but I didn't any answer. So please let me post it on MathOverflow. Let $L_{m,n}\subset\mathbb R^2$ be a rectangle given by $[0,m]×[0,n]$ with $m,...
Suzanne's user avatar
  • 71
5 votes
1 answer
261 views

Do random triangulation edge-flips maintain randomness?

Let $S$ be a fixed set of $n$ points in the plane in general position. Let $T$ be a triangulation of $S$, (somehow) selected uniformly at random from all triangulations of $S$. (There are an ...
Joseph O'Rourke's user avatar
4 votes
0 answers
286 views

Mean number of $n$-simplices per $(n-2)$-simplex in a triangulated $n$-manifold

Work by Tamura (extending results by Luo and Stong) shows the following. Theorem: For any closed 3-manifold $M$ and any rational number $4.5 < r < 6$ there is a triangulation $T$ of $M$ for ...
Aaron Trout's user avatar
3 votes
0 answers
93 views

Minimal set of geometric moves in various equivalence classes of triangulated geometries

I would like to get to know what is the minimal set of geometric changes "aka. moves" (topology preserving modifications / Pachner moves / bistellar moves) that can transform any 3-...
Kregnach's user avatar
  • 183
2 votes
0 answers
87 views

Existence of a "generic enough" lattice point interior to a lattice triangle

Let $T$ be a lattice triangle in $\Bbb R^2$ (i.e. the convex hull of three noncolinear points in $\Bbb Z^2$), and assume it has at least one interior lattice point. Is it always possible to find a ...
Avi Steiner's user avatar
  • 3,079
0 votes
0 answers
98 views

Number of tetrahedra inside a sphere with boundary A

I understand, that there are some combinatorial problems which are not yet solved regarding gluing triangulations in 3D. At least last time I checked, it was not yet known exactly how many ...
Kregnach's user avatar
  • 183