Related papers: Bridge decompositions with distances at least two

We propose simple methods for multivariate diffusion bridge simulation, which plays a fundamental role in simulation-based likelihood and Bayesian inference for stochastic differential equations. By a novel application of classical coupling…

We adapt work of Kirby-Thompson and Zupan to define an integer invariant $\mathcal{L}(\mathcal{T})$ of a bridge trisection $\mathcal{T}$ of a smooth surface $\mathcal{K}$ in $S^4$ or $B^4$. We show that when $\mathcal{L}(\mathcal{T})=0$,…

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…

It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no common vertex, but every k-1 longest paths have a common…

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…

In this paper we describe three geometric applications of quandle homology. We show that it gives obstructions to tangle embeddings, provides the lower bound for the 4-move distance between links, and can be used in determining periodicity…

Discretized landscapes can be mapped onto ranked surfaces, where every element (site or bond) has a unique rank associated with its corresponding relative height. By sequentially allocating these elements according to their ranks and…

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…

The author, in her previous paper, constructed an infinite family of 3-bridge links each of which admits infinitely many 3-bridge spheres up to isotopy. In this paper, we prove that if a prime, unsplittable link $L$ in $S^3$ admits…

We give a systematic construction of epimorphisms between 2-bridge link groups. Moreover, we show that 2-bridge links having such an epimorphism between their link groups are related by a map between the ambient spaces which only have a…

In this paper and its prequel, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in an even Heckoid orbifold for a 2-bridge link to be homotopic in the orbifold. We also give a necessary and…

For any given number of crossings $c$, there exists a formula to determine the number of 2-bridge knots of $c$ crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of…

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…

A new tur\'an-type problem on distances on graphs was introduced by Tyomkyn and Uzzell. In this paper, we focus on the case that the distance is two. We primely show that for any value of $n$, a graph on $n$ vertices without three vertices…

We show that the problem of computing the distance of a given permutation from a subgroup $H$ of $S_n$ is in general NP-complete, even under the restriction that $H$ is elementary Abelian of exponent 2. The problem is shown to be…

In this paper and its sequel, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in an even Heckoid orbifold for a 2-bridge link to be homotopic in the orbifold. We also give a necessary and…

We introduce and study bridge decompositions for 3-manifolds embedded in the 5-sphere. These generalize both the classical notion of bridge position for knots in the 3-sphere and the bridge trisections of surfaces in the 4-sphere due to…

Any $n$-tuple of points in the plane can be moved to any other $n$-tuple by a continuous motion with at most $\binom{n}{3}$ intermediate changes of the order type. Even for tuples with the same order type, the cubic bound is sharp: there…