Related papers: A method to find ideal points from ideal triangula…

We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…

We introduce the notion of ideal triangle in the Bruhat-Tits building associated to a split group -- it is analogous to the usual notion of triangle, but one vertex is "at infinity" in a certain direction. We prove that the algebraic…

We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…

This is the first in a series of papers where we will derive invariants of three-manifolds and framed knots in them from the geometry of a manifold pseudotriangulation put in some way in a four-dimensional Euclidean space. Thus, the…

In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering…

The Frohman Kania-Bartoszynska ideal is an invariant associated to a 3-manifold with boundary and a prime p >3. We give some estimates of this ideal. We also calculate this invariant for some 3-manifolds constructed by doing surgery on a…

We study the following problem in computer vision from the perspective of algebraic geometry: Using $m$ pinhole cameras we take $m$ pictures of a line in $\mathbb P^3$. This produces $m$ lines in $\mathbb P^2$ and the question is which…

We introduce a notion of a bounded ideal triangulation of an infinite Riemann surface and parametrize Teichm\"uller spaces of infinite surfaces which allow bounded triangulations. We prove that our parametrization is real-analytic. Riemann…

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…

Any two geometric ideal triangulations of a cusped complete hyperbolic $3$-manifold $M$ are related by a sequence of Pachner moves through topological triangulations. We give a bound on the length of this sequence in terms of the total…

We study in this paper three natural notions of convergence of homogeneous manifolds, namely infinitesimal, local and pointed, and their relationship with a fourth one, which only takes into account the underlying algebraic structure of the…

We give a brief survey of abelian torsions of 3-manifolds.

Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.

We study ideal-theoretic conditions for a monomial ideal to be Golod. For ideals in a polynomial ring in three variables, our criteria give a complete characterization. Over such rings, we show that the product of two monomial ideals is…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

It is not completely unreasonable to expect that a computable function bounding the number of Pachner moves needed to change any triangulation of a given 3-manifold into any other triangulation of the same 3-manifold exists. In this paper…