Related papers: A simpler $\mathbb R^3$ realization of the M\"obiu…
A resolving set in a graph $G$ is a vertex subset $W= \{\omega^1, \dots, \omega^n\} \subseteq V(G)$ such that each $u \in V(G)$ can be uniquely identified by the vector $r(u \vert W) = (d(u,\omega^1), \dots, d(u,\omega^n))$ of metric…
We present the complex analytic and principal complex analytic realizability of a link in a 3-manifold $M$ as a tool for understanding the complex structures on the cone $C(M)$.
The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear…
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…
We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it…
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…
Let $H$ be a finite abelian (commutative) group of order $n \geq 2$, and $m >1$ be an integer. We define the $m$-graph of $H$, denoted by $m-G(H)$, as a simple undirected graph with vertex set $H$, and two distinct vertices, $a, b \in H$,…
Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
A closed linkage mechanism in three-dimensional space is an object comprising rigid bodies connected with hinges in a circular form like a rosary. Such linkages include Bricard6R and Bennett4R. To design such a closed linkage, it is…
A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…
In this note, we give an alternative construction of the $G_2(2)$-graph from a $U_3(2)$-geometry.
Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of…
It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the smallest…
In this paper we show that every finite spatial graph is a connected sum of a planar graph, which is a forest, i.e. disjoint union of finite number of trees and a tangle. As a consequence we get that any finite spatial graph is a connected…
There is a classical extension, of M\"obius automorphisms of the Riemann sphere into isometries of the hyperbolic space $\mathbb{H}^3$, which is called the Poincar\'e extension. In this paper, we construct extensions of rational maps on the…
A new simple geometrical interpretation of complex numbers is presented. It differs from their usual interpretation as points in the complex plane. From the new point of view the complex numbers are rather operations on vectors than points.…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
In this paper we study the operation of cutting off edges of a simple $3$-polytope $P$ along the graph $\Gamma$. We give the criterion when the resulting polytope is simple and when it is flag. As a corollary we prove the analog of…