English
Related papers

Related papers: Mosaics for immersed surface-links

200 papers

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

Geometric Topology · Mathematics 2016-11-01 Liangxia Wan

Although fully autonomous mapping methods are becoming more and more common and reliable, still the human operator is regularly employed in many 3D surveying missions. In a number of underwater applications, divers or pilots of remotely…

Computer Vision and Pattern Recognition · Computer Science 2021-10-05 E. Nocerino , F. Menna , B. Chemisky , P. Drap

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

The fundamental quandle is an invariant for distinguishing surface knots, yet computable presentations have traditionally been limited to surfaces embedded in the $4$-sphere. Building on the framework of banded unlink diagrams introduced by…

Geometric Topology · Mathematics 2026-05-15 Xiaozhou Zhou

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Geometric Topology · Mathematics 2019-11-11 Jacob Mostovoy , Michael Polyak

This is a review article on the Bennequin-Birman-Menasco machinery for studying embedded incompressible surfaces in 3-space via their `braid foliations'. Two cases are investigated: case (1) The surface has non-empty boundary; the boundary…

Geometric Topology · Mathematics 2007-05-23 Joan S. Birman , Elizabeth Finkelstein

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…

Geometric Topology · Mathematics 2007-05-23 Matias Graña , Vladimir Turaev

We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime…

Geometric Topology · Mathematics 2019-08-28 Michal Jablonowski

The Kashaev-Murakami-Murakami Volume Conjecture connects the hyperbolic volume of a knot complement to the asymptotics of certain evaluations of the colored Jones polynomials of the knot. We introduce a closely related conjecture for…

Geometric Topology · Mathematics 2021-12-28 Francis Bonahon , Helen Wong , Tian Yang

Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…

Geometric Topology · Mathematics 2014-10-01 Rob Schneiderman

Internal stabilization adds a trivial handle to an embedded surface in a coordinate chart. It is known that any pair of smoothly knotted surfaces in a simply-connected $4$-manifold become smoothly isotopic after sufficiently many internal…

Geometric Topology · Mathematics 2023-08-01 David Auckly

Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…

General Relativity and Quantum Cosmology · Physics 2009-10-31 Seth A. Major

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

Geometric Topology · Mathematics 2021-12-15 A. Skopenkov

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

Geometric Topology · Mathematics 2023-04-04 Jundai Nanasawa

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

Geometric Topology · Mathematics 2025-12-02 Benjamin Audoux , Jean-Baptiste Meilhan , Akira Yasuhara

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Combinatorics · Mathematics 2016-08-19 Robert Coquereaux , Jean-Bernard Zuber

The surface singular braid monoid corresponds to marked graph diagrams of knotted surfaces in braid form. In a quest to resolve linearity problem for this monoid, we will show that if it is defined on at least two or at least three strands,…

Geometric Topology · Mathematics 2019-07-10 Michal Jablonowski

Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we…

Geometric Topology · Mathematics 2014-11-10 Kyungpyo Hong , Sungjong No , Seungsang Oh

The flat plumbing basket presentation of a link is introduced by Furihata, Hirasawa and Kobayashi. In this paper, we show that the pass-equivalence and an equivalence introduced by using the flat plumbing basket presentation are the same…

Geometric Topology · Mathematics 2014-12-02 Susumu Hirose , Yuusuke Nakashima

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

Geometric Topology · Mathematics 2007-05-23 J. Campbell , T. W. Mattman , R. Ottman , J. Pyzer , M. Rodrigues , S. Williams
‹ Prev 1 4 5 6 7 8 10 Next ›