English
Related papers

Related papers: Lines and circles joining components of a link

200 papers

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

Geometric Topology · Mathematics 2017-07-27 Nickolas A. Castro , David T. Gay , Juanita Pinzón-Caicedo

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

Geometric Topology · Mathematics 2017-04-24 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

We derive an integral formula for the linking number of two submanifolds of the n-sphere S^n, of the product S^n x R^m, and of other manifolds which appear as "nice" hypersurfaces in Euclidean space. The formulas are geometrically…

Geometric Topology · Mathematics 2011-10-07 Clayton Shonkwiler , David Shea Vela-Vick

In this study, we define the generalized normal ruled surface of a curve in the Euclidean 3-space $E^3$. We study the geometry of such surfaces by calculating the Gaussian and mean curvatures to determine when the surface is flat or minimal…

Differential Geometry · Mathematics 2020-06-02 Onur Kaya , Mehmet Önder

We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…

Combinatorics · Mathematics 2020-05-29 Andrey Sergunin

We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…

Differential Geometry · Mathematics 2013-09-04 S. Montaldo , A. Ratto

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

Geometric Topology · Mathematics 2025-08-25 Ferit Öztürk

Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…

Algebraic Geometry · Mathematics 2007-05-23 Herbert Clemens , Holger P. Kley

Starting from a divide, i.e. a generic immersion of finitely many copies of the interval [0,1] in the disk, we construct a classical link in the 3-sphere. We prove that the link's complement fibers over the circle, if the divide is…

Geometric Topology · Mathematics 2007-05-23 Norbert A'Campo

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…

General Mathematics · Mathematics 2024-10-14 Alexandros Haridis

The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…

Geometric Topology · Mathematics 2016-07-20 Jenya Sapir

We introduce the self-linking number of a smooth closed curve in R^n with respect to a 3-dimensional vector bundle over the curve, provided that some regularity conditions are satisfied. When n=3, this construction gives the classical…

Differential Geometry · Mathematics 2007-05-23 A. Montesinos-Amilibia , J. J. Nuno-Ballesteros

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

Combinatorics · Mathematics 2015-10-30 G. A. T. F da Costa , M. Policarpo

Extracting shape information from object bound- aries is a well studied problem in vision, and has found tremen- dous use in applications like object recognition. Conversely, studying the space of shapes represented by curves satisfying…

Computer Vision and Pattern Recognition · Computer Science 2016-10-12 Aditya Tatu

A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…

Metric Geometry · Mathematics 2023-07-18 Michael Q. Rieck

A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…

Geometric Topology · Mathematics 2021-10-12 Ivan Dynnikov

According to a general definition of discrete curves, surfaces, and manifolds. This paper focuses on the Jordan curve theorem in 2D discrete spaces. The Jordan curve theorem says that a (simply) closed curve separates a simply connected…

General Topology · Mathematics 2015-06-18 Li Chen

In this work we are interested in the characterization of curves that belong to a given surface. To the best of our knowledge, there is no known general solution to this problem. Indeed, a solution is only available for a few examples:…

Differential Geometry · Mathematics 2017-07-18 Luiz C. B. da Silva

We classify the singular loci of real surfaces in three-space that contain two circles through each point. We characterize how a circle in such a surface meets this loci as it moves in its pencil and as such provide insight into the…

Algebraic Geometry · Mathematics 2024-10-01 Niels Lubbes

We present the first utterly self-supervised network for dense correspondence mapping between non-isometric shapes. The task of alignment in non-Euclidean domains is one of the most fundamental and crucial problems in computer vision. As 3D…

Computer Vision and Pattern Recognition · Computer Science 2021-12-15 Dvir Ginzburg , Dan Raviv