Related papers: About the Serpinsky-Knopp curve
We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…
The kernel method is an essential tool for the study of generating series of walks in the quarter plane. This method involves equating to zero a certain polynomial, the kernel polynomial, and using properties of the curve, the kernel curve,…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
We describe the curves of constant (geodesic) curvature and torsion in the three-dimensional round sphere. These curves are the trajectory of a point whose motion is the superposition of two circular motions in orthogonal planes. The global…
The proximity $\pi = \pi (G)$ of a connected graph $G$ is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by $\rho = \rho (G)$. The concepts of…
Measuring the similarity of curves is a fundamental problem arising in many application fields. There has been considerable interest in several such measures, both in Euclidean space and in more general setting such as curves on Riemannian…
Near a singular point of a surface or a curve, geometric invariants diverge in general, and the orders of diverge, in particular the boundedness about these invariants represent geometry of the surface and the curve. In this paper, we study…
Consider a 2D coordinate space with a set of red and a set of blue points. We define a scenic point as a point that is equidistant to a red point and a blue point. The set of contiguous scenic points form a scenic path. The perpendicular…
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…
It is a well-known result that a stable curve of compact type over $\mathbb{C}$ having two components is hyperelliptic if and only if both components are hyperelliptic and the point of intersection is a Weierstrass point for each of them.…
A formula for the jumping numbers of a curve unibranch at a singular point is established. The jumping numbers are expressed in terms of the Enriques diagram of the log resolution of the singularity, or equivalently in terms of the…
We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…
Let $p$ be a prime and $K$ a number field of degree $p$. We count the number of elliptic curves, up to $\bar{K}$-isomorphism, having a prescribed property, where this property is either that the curve contains a fixed torsion group as a…
We define a pants distance for knotted surfaces in 4-manifolds which generalizes the complexity studied by Blair-Campisi-Taylor-Tomova for surfaces in the 4-sphere. We determine that if the distance computed on a given diagram does not…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
A spherical quadrilateral is a bordered surface homeomorphic to a closed disk, with four distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the…
Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all…
We prove that the length difference between a closed periodic curve and its parallel curve at a sufficiently small distance is proportional to the rotation index. As an application, the rotation index of a curve could be estimated by means…
The Image-Computing Spectral Sequence computes the homology of the image of a finite map from the alternating homology of the multiple point spaces of the map. A related spectral sequence was obtained by Gabrielov, Vorobjob and Zell which…
Let $E$ be a smooth cubic. A plane curve $D$ is said to be an $n$-contact curve to $E$ if the intersection multiplicities at each intersection point between $E$ and $D$ is $n$. In this note, we give an algorithm to produce $n$-contact…