Related papers: Flips in Edge-Labelled Pseudo-Triangulations

MacMahon's theorem on plane partitions yields a simple product formula for tiling number of a hexagon, and Cohn, Larsen and Propp's theorem provides an explicit enumeration for tilings of a dented semihexagon via semi-strict…

A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…

A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer…

This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the…

Quandles with involutions that satisfy certain conditions, called good involutions, can be used to color non-orientable surface-knots. We use subgroups of signed permutation matrices to construct non-trivial good involutions on extensions…

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

We prove the existence of an exact triangle for the Pin(2)-monopole Floer homology groups of three manifolds related by specific Dehn surgeries on a given knot. Unlike the counterpart in usual monopole Floer homology, only two of the three…

We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.

We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…

This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally adds sorted points to the convex hull using the constraint that…

We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: the submanifold of configurations of points on an arbitrary submanifold of Euclidean space may be…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This last one classifies the case of $a^3b$-quadrilaterals with some irrational angle: there are a sequence of…

Two Seifert surfaces of links in $S^3$ are said to be twist equivalent if one can be obtained from the other, up to isotopy, by repeatedly performing operations consisting of cutting along an embedded arc, applying a full twist near one…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\neq y$, alternate in $w$ if and only if $(x,y)\in E$. Halld\'{o}rsson et al.\ have shown that a graph is…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Eliahou \cite{2} and Kryuchkov \cite{9} conjectured a proposition that Gravier and Payan \cite{4} proved to be equivalent to the Four Color Theorem. It states that any triangulation of a polygon can be transformed into another triangulation…

The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for…

We construct $n$-vertex graphs $G$ where $\epsilon n^2$ edges must be deleted to become triangle-free, which contain less than $\epsilon^{(C_{\text{new}}-o(1))\log_2 1/\epsilon}n^3$ triangles for $C_{\text{new}}= \frac{1}{4\log_2(4/3)}…

We consider the conjecture by Aichholzer, Aurenhammer, Hurtado, and Krasser that any two points sets with the same cardinality and the same size convex hull can be triangulated in the "same" way, more precisely via \emph{compatible…