Related papers: Plane curves in an immersed graph in $R^2$

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

A $p$-adic version of Gromov-Witten invariants for counting plane curves of genus $g$ and degree $d$ through a given number of points is discussed. The multiloop version of $p$-adic string theory considered by Chekhov and others motivates…

A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no…

Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…

Any generic closed curve in the plane can be transformed into a simple closed curve by a finite sequence of local transformations called homotopy moves. We prove that simplifying a planar closed curve with $n$ self-crossings requires…

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

We say a graph $G$ has a Hamiltonian path if it has a path containing all vertices of $G$. For a graph $G$, let $\sigma_2(G)$ denote the minimum degree sum of two nonadjacent vertices of $G$; restrictions on $\sigma_2(G)$ are known as…

A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane…

A maximal planar graph is a graph which can be embedded in the plane such that every face of the graph is a triangle. The center of a graph is the subgraph induced by the vertices of minimum eccentricity. We introduce the notion of…

We study the integral expression of a knot invariant obtained as the second coefficient in the perturbative expansion of Witten's Chern-Simons path integral associated with a knot. One of the integrals involved turns out to be a…

In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…

Every complex plane curve C determines a subscheme S of the $P^8$ of 3x3 matrices, whose projective normal cone (PNC) captures subtle invariants of C. In "Limits of PGL(3)-translates of plane curves, I" we obtain a set-theoretic description…

This note is an attempt to relate explicitly the geometric and algebraic properties of a space curve that is contained in some double plane. We show in particular that the minimal generators of the homogeneous ideal of such a curve can be…

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

To each non-isotropic almost-complex immersion of a 2-torus into $ S ^ 6 $ we associate an algebraic curve, called the spectral curve, and a linear flow in the intersection of two Prym varieties on this spectral curve. We show that…

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each…