Related papers: Triangulation in o-minimal fields with standard pa…
An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.
The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…
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…
We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…
Let $S$ be a $P^2$-knot which is the connected sum of a 2-knot with normal Euler number 0 and an unknotted $P^2$-knot with normal Euler number $\pm2$ in a closed 4-manifold $X$ with trisection $T_{X}$. Then, we show that the trisection of…
We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…
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.…
In a triangulated category T with a pair of triangulated subcategories X and Y, one may consider the subcategory of extensions X*Y. We give conditions for X*Y to be triangulated and use them to provide tools for constructing stable…
In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of $G(n,p)$ with high…
We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
In this work we count the number of satisfying states of triangulations of a convex n-gon using the transfer matrix method. We show an exponential (in n) lower bound. We also give the exact formula for the number of satisfying states of a…
The aim of this paper is to study the dimensions and standard part maps between the field of $p$-adic numbers ${{\mathbb Q}_p}$ and its elementary extension $K$ in the language of rings $L_r$. We show that for any $K$-definable set…
We let R be an o-minimal expansion of a field, V a convex subring, and $(R_0, V_{0})$ an elementary substructure of (R,V). We let L be the language consisting of a language for R, in which R has elimination of quantifiers, and a predicate…
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…
The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…
Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…