Related papers: Paperfolding sequences, paperfolding curves and lo…
In this paper we produce infinitely many examples of set-theoretic complete intersection monomial curves in $\mathbb{P}^{n+1}$, starting with a set-theoretic complete intersection monomial curve in $\mathbb{P}^{n}$ . In most of the cases…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…
Considering regions in a map to be adjacent when they have nonempty intersection (as opposed to the traditional view requiring intersection in a linear segment) leads to the concept of a facially complete graph: a plane graph that becomes…
The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…
The mirror curves enable us to study B-model topological strings on non-compact toric Calabi--Yau threefolds. One of the method to obtain the mirror curves is to calculate the partition function of the topological string with single brane.…
In this paper, we have first given easily the characterization of special curves with the help of the Rotation minimizing frame (RMF). Also, rectifying-type curves are generalized n-dimensional space $R_{n}$.
A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…
We study the topology of quasiperiodic solutions of the vortex filament equation in a neighborhood of multiply covered circles. We construct these solutions by means of a sequence of isoperiodic deformations, at each step of which a real…
Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…
We prove two theorems about homotopies of curves on 2-dimensional Riemannian manifolds. We show that, for any epsilon > 0, if two simple closed curves are homotopic through curves of bounded length L, then they are also isotopic through…
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…
We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where…
We prove the following result: Let $(M,g_0)$ be a complete noncompact manifold of dimension $n\geq 12$ with isotropic curvature bounded below by a positive constant, with scalar curvature bounded above, and with injectivity radius bounded…
We examine space-filling curves, which are surjective continuous maps from $[0,1]$ to some higher-dimensional space, usually the unit square $[0,1]^2$. In particular, we define Peano's curve and Lebesgue's curve, and state some of their…
A polygonal curve $P$ with $n$ vertices is $c$-packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius $r$ is at most $cr$, for any $r>0$. Similarly, the concept of $c$-packedness can be…
Classification of curves up to affine transformation in a finite dimensional space was studied by some different methods. In this paper, we achieve the exact formulas of affine invariants via the equivalence problem and in the view of…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
We show that the polynomial entropy of homeomorphisms on regular curves is bounded above by one. Moreover, the polynomial entropy equals one under the fairly mild condition that the homeomorphism possesses a wandering point. We obtain a…
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…