Related papers: Plane $R$-paths and their rectifiability property

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…

Using symplectic topology and the Radon transform, we prove that smooth 4-dimensional projective planes are diffeomorphic to $\mathbb{CP}^2$. We define the notion of a plane curve in a smooth projective plane, show that plane curves in high…

We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that for any convex shape $K$, there exist four points on the boundary of $K$ such that the length of any curve…

The `linear orbit' of a plane curve of degree d is its orbit in P^{d(d+3)/2} under the natural action of PGL(3). We classify curves with positive dimensional stabilizer, and we compute the degree of the closure of the linear orbits of…

Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…

We investigate the curves in the complex plane which are generated by sequences of real numbers being the lifts of the points on the orbit of an orientation preserving circle homeomorphism. Geometrical properties of these curves such as…

The paper is concerned with elongating the shortest curvature-bounded path between two oriented points to an expected length. The elongation of curvature-bounded paths to an expected length is fundamentally important to plan missions for…

We consider the problem of mirror invisibility for plane sets. Given a circle and a finite number of unit vectors (defining the directions of invisibility) such that the angles between them are commensurable with $\pi$, for any $\varepsilon…

A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…

On a stack of stable maps, the psi classes are modified by subtracting certain boundary divisors. These modified psi classes are compatible with forgetful morphisms, and are well-suited to enumerative geometry: tangency conditions allow…

We report on the problem of the existence of complex and real algebraic curves in the plane with prescribed singularities up to analytic and topological equivalence. The question is whether, for a given positive integer $d$ and a finite…

In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

A sequence of rational points on an algebraic planar curve is said to form an $r$-geometric progression sequence if either the abscissae or the ordinates of these points form a geometric progression sequence with ratio $r$. In this work, we…

A system of plane curves defined by prescribing n points of multiplicity m in general position is regular if n > (2m)^2. The proof uses computation of limits of linear systems acquiring fixed divisors, an interesting problem in itself.

We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…

If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…

Cutting plane methods, particularly outer approximation, are a well-established approach for solving nonlinear discrete optimization problems without relaxing the integrality of decision variables. While powerful in theory, their…