Related papers: A simpler $\mathbb R^3$ realization of the M\"obiu…
A simple graph is $3$-rigid if its generic bar-joint frameworks in $R^3$ are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal $3$-rigidity of a simple graph which is obtained from the $1$-skeleton of a…
I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph $M(i)$ of a generic surface $i:F \to S^3$ is the set of values which are…
In this paper, it has been shown that the generalized Petersen graph $\mathrm {GP}(8,3)$, also known as the M\"obius-Kantor graph, admits a faithful unit-distance representation in the plane.
We study analytic properties function $m(z, E)$, which is defined on the upper half-plane as an integral from the shifted $L$-function of an elliptic curve. We show that $m(z, E)$ analytically continues to a meromorphic function on the…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
We investigate the problem of the realization of a given graph as the Reeb graph $\mathcal{R}(f)$ of a smooth function $f\colon M\rightarrow \mathbb{R}$ with finitely many critical points, where $M$ is a closed manifold. We show that for…
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic 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…
A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open…
A rational map between certain specific threefolds is given in an explicit manner.
The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a…
Let G be an arbitrary simple graph. The main results are explicit representations of the edge cone of G as a finite intersection of closed halfspaces. If G is bipartite and connected we determine the facets of the edge cone and present a…
Given a graph on n vertices with m edges, each of unit resistance, how small can the average resistance between pairs of vertices be? There are two very plausible extremal constructions -- graphs like a star, and graphs which are close to…
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…
Given an orthogonal polynomial sequence on the real line, another sequence of polynomials can be found by composing these polynomials with a general M\"obius transformation. In this work, we study the properties of such M\"obius-transformed…
We give an explicit description of a fibration of the complement of the closure of a homogeneous braid, understanding how each fiber intersects every cross-section of $S^3$.