Related papers: Distance Two Links

Let K and L be disjoint closed oriented submanifolds of the n-sphere, with dimensions adding up to n-1. We define a map from their join K*L to the n-sphere whose degree up to sign equals their linking number, and then use this to find the…

Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…

It is well-known that all 2-knots are slice. Are all 2-links slice? This is an outstanding open question. In this paper we prove the following: For any 2-component 2-link (J,K)in the 4-sphere which bounds the 5-ball B^5, there is an…

Let S^3_i be a 3-sphere embedded in the 5-sphere S^5 (i=1,2). Let S^3_1 and S^3_2 intersect transversely. Then the intersection C of S^3_1 and S^3_2 is a disjoint collection of circles. Thus we obtain a pair of 1-links, C in S^3_i (i=1,2),…

We show that the only rational homology spheres which can admit almost complex structures occur in dimensions two and six. Moreover, we provide infinitely many examples of six-dimensional rational homology spheres which admit almost complex…

We study a class of 3-manifolds called strong L-spaces, which by definition admit a certain type of Heegaard diagram that is particularly simple from the perspective of Heegaard Floer homology. We provide evidence for the possibility that…

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…

Let K' be a hyperbolic knot in S^3 and suppose that some Dehn surgery on K' with distance at least 3 from the meridian yields a 3-manifold M of Heegaard genus 2. We show that if M does not contain an embedded Dyck's surface (the closed…

Classical fully augmented links have explicit hyperbolic geometry, and have diagrams on the 2-sphere in the 3-sphere. We generalise to construct fully augmented links projected to the reflection surface of any 3-manifold obtained by…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…

We are interested in knowing what type of manifolds are obtained by doing Dehn surgery on closed pure 3-braids in the 3-sphere. In particular, we want to determine when we get the 3-sphere by surgery on such a link. We consider links which…

In several recent papers, the maximal safety distance that two players can maintain while moving through a graph has been defined and studied using three different spans of the graph, each with different movement conditions. Mainly, vertex…

We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…

The physical properties of the edge states of the cut two-leg spin ladder are investigated by means of the bosonization approach. By carefully treating boundary conditions, we derive the existence of spin-1/2 edge states in the spin ladder…

We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\ldots, a_m, b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\{a_1, \ldots, a_m\}$ is contained in $A$ and $\{b_1,b_2\}$…

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, we characterize all graphs with connected…

We propose a very simple one-dimensional swimmer consisting of three spheres that are linked by rigid rods whose lengths can change between two values. With a periodic motion in a non-reciprocal fashion, which breaks the time-reversal…