Related papers: Multi-triangulations as complexes of star polygons

In the present paper, a new type of mappings called perimetric contractions on $k$-polygons is introduced. These contractions can be viewed as a generalization of mappings that contracts perimeters of triangles. A fixed point theorem for…

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3\times 3$ upper triangular matrix algebra over an infinite field.

A \emph{stacked triangulation} of a $d$-simplex $\mathbf{o}=\{1,\ldots,d+1\}$ ($d\geq 2$) is a triangulation obtained by repeatedly subdividing a $d$-simplex into $d+1$ new ones via a new vertex (the case $d=2$ is known as an Appolonian…

A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

Stack triangulations appear as natural objects when defining an increasing family of triangulations by successive additions of vertices. We consider two different probability distributions for such objects. We represent, or "draw" these…

We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is…

We define $k$-dimensional digraphs and initiate a study of their spectral theory. The $k$-dimensional digraphs can be viewed as generating graphs for small categories called $k$-graphs. Guided by geometric insight, we obtain several new…

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…

We completely characterize triangulations of the projective plane that have a spanning bipartite quadrangulation subgraph. This is an affirmative answer to a question by K\"undgen and Ramamurthi (J Combin Theory Ser B 85, 307--337, 2002)…

A star-simple drawing of a graph is a drawing in which adjacent edges do not cross. In contrast, there is no restriction on the number of crossings between two independent edges. When allowing empty lenses (a face in the arrangement induced…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the…

Gravitational theories with multiple scalar fields coupled to the metric and each other --- a natural extension of the well studied single-scalar-tensor theories --- are interesting phenomenological frameworks to describe deviations from…

The purpose of this article is to investigate triangularization and simultaneous triangularization of matrices over max algebras using graph theoretic methods. We establish a connection between commutators and commutants with simultaneous…

Let $\mathbb{K}$ be a field such that $char(\mathbb{K})\nmid k$ and $char(\mathbb{K})\nmid k+1$. We describe all $(k+1)$-potent matrices over the group of upper triangular matrix. In the case that $\mathbb{K}$ is a finite field we show how…

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…

A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…