Related papers: How many simplices are needed to triangulate a Gra…

A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…

In 1983, Banchoff and Kuhnel constructed a minimal triangulation of $\CP^2$ with 9 vertices. $\CP^3$ was first triangulated by Bagchi and Datta in 2012 with 18 vertices. Known lower bound on number of vertices of a triangulation of $\CP^n$…

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded $k$-algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several…

To study a noncompact Riemannian manifold, it is often useful to find a compactification. We discuss several common compactifications and survey some recent results.

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…

Let k_r(n,m) denote the minimum number of r-cliques in graphs with n vertices and m edges. For r=3,4 we give a lower bound on k_r(n,m) that approximates k_r(n,m) with an error smaller than n^r/(n^2-2m). The solution is based on a constraint…

We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomass\'e and Thomassen characterizing those edge densities guaranteeing the existence of a…

We consider the following generalized Tur\'an problem: For $2 \le s \le t$, what is the maximum number of triangles in a $K_{1,s,t}$-free graph on $n$ vertices? The previously best known lower and upper bounds are $\Omega(n^2)$ and…

Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…

Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line…

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

There exist as many index-$k$ sublattices of the hexagonal lattice up to isometry as there exist lattice triangles with normalized volume $k$ up to unimodular equivalence, which can be explained using orbifolds. In dimension 3, it was noted…

We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H…

In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented…

We study the $\mathbb Z_2$-zero-divisor cup-length, denoted by $\operatorname{zcl}_{\mathbb Z_2}(\widetilde G_{n,3})$, of the Grassmann manifolds $\widetilde G_{n,3}$ of oriented $3$-dimensional vector subspaces in $\mathbb R^n$. Some lower…

We consider relations in Grassmann algebra corresponding to the four-dimensional Pachner move 3-3, assuming that there is just one Grassmann variable on each 3-face, and a 4-simplex weight is a Grassmann-Gaussian exponent depending on these…

This paper proposes a new method which builds a simplex based approximation of a $d-1$-dimensional manifold $M$ separating a $d$-dimensional compact set into two parts, and an efficient algorithm classifying points according to this…

Let $P$ and $Q$ be polytopes, the first of "low" dimension and the second of "high" dimension. We show how to triangulate the product $P \times Q$ efficiently (i.e., with few simplices) starting with a given triangulation of $Q$. Our method…