Related papers: Deciding when two curves are of the same type
We are introducing two methods for revealing the true inflection point of data that contains or not error. The starting point is a set of geometrical properties that follow the existence of an inflection point p for a smooth function. These…
Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
We study the relation between the type of a double point of a plane curve and the curvilinear 0-dimensional subschemes of the curve at the point. An Algorithm related to a classical procedure for the study of double points via osculating…
In this paper a new intrinsic geometric characterization of the symmetric square of a curve and of the ordinary product of two curves is given. More precisely it is shown that the existence on a surface of general type S of irregularity q…
Consider the scheme parametrizing non-constant morphisms from a fixed projective curve to a projective surface. There is a rational map between this scheme and the Chow variety of $1$-cycles on the surface. We prove that, if the curve is…
We give an explicit construction of a closed curve with constant torsion and everywhere positive curvature. We also discuss the restrictions on closed curves of constant torsion when they are constrained to lie on convex surfaces.
This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…
We give an algorithm to determine whether a kernel sheaf over a smooth projective curve over an algebraically closed field is semistable. The algorithm uses symmetric powers to make destabilizing subbundles visible as global sections.
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
In this paper, as a result of a theorem of Serre on congruence properties, a complete solution is given for an open question (see the text) presented recently by Kim, Koo and Park. Some further questions and results on similar types of…
This paper deals with a kind of design of a ruled surface. It combines concepts from the fields of computer aided geometric design and kinematics. A dual unit spherical B\'ezier-like curve on the dual unit sphere (DUS) is obtained with…
In this paper, we investigate constant breadth curves on a surface according to Darboux frame and give some characterizations of these curves.
We formulate a uniqueness conjecture for curve shortening flow of proper curves on certain symmetric surfaces and give an example of a non-flat metric on the plane with respect to which curve shortening flow is not unique. That is, with…
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
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…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…