Related papers: Surface-link families with arbitrarily large tripl…
In arXive:0705.3912 we studied triple-point defective very ample linear systems on regular surfaces, and we showed that they can only exist if the surface is ruled. In the present paper we show that we can drop the regularity assumption,…
This is a preliminary note on a family of minimal surfaces in the 3-sphere defined by a compatible fourth order equation. The minimal surfaces are geometrically characterized either by having a surface of revolution like induced metric, or…
Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices,…
For each three-bridge link of a certain form, we construct a taut Seifert surface for the link and establish whether the link is fibred. Using this, we also give the genus and fibredness of satellite knots whose pattern is constructed from…
The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
In this paper, we formulate a construction of ideal coset invariants for surface-links in $4$-space using invariants for knots and links in $3$-space. We apply the construction to the Kauffman bracket polynomial invariant and obtain an…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
We give a visual construction of stable maps from the $3$-sphere into the real plane enjoying the following properties; the set of definite fold points coincides with a given two-bridge link and the map only admits certain types of fibers…
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…
A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…
Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a…
Topological polymers have various topological types, and they are expressed by graphs. However, the Jones polynomial, we have a difficulty to compute it; computational time is growing exponentially with respect to the crossing number. The…
We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…
We submit a new way to detect pairs of non-cobordant surface-links. We find a new example of a pair of non-cobordant surface-links with the following properties: Orr invariant, Cochran sequence, Sato-Levine invariant, the alinking number…