相关论文: Computing boundary slopes of 2-bridge links

A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…

A numerical algorithm for mean curvature flow of closed mean convex surfaces with surgery is proposed. The method uses a finite element based mean curvature flow algorithm based on a coupled partial differential equation system which…

We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is…

A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Let $(B(t))_{t\in [0,1]}$ be the linear Brownian motion and $(X_n(t))_{t\in [0,1]}$ be the $(n-1)$-fold integral of Brownian motion, $n$ being a positive integer: $$ X_n(t)=\int_0^t \frac{(t-s)^{n-1}}{(n-1)!} \,\dd B(s) for any $t\in[0,1]$.…

We explain how to use bordered algebras to compute a version of link Floer homology. As a corollary, we also give a fast computation of the Thuston polytope for links in the three-sphere.

In this article we study the braid indices of 2-bridge knots with a fixed crossing number $c$. We show that the average braid index of the set of $2$-bridge knots of crossing number $c$ is asymptotically linear, approaching…

We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…

We define a new kind of crossing number which generalizes both the bipartite crossing number and the outerplanar crossing number. We calculate exact values of this crossing number for many complete bipartite graphs and also give a lower…

We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time…

We provide algorithms for the minimum 2-edge-connected spanning subgraph problem and the minimum 2-vertex-connected spanning subgraph problem with approximation ratio $\frac{9}{7}$. This improves upon a recent algorithm with ratio slightly…

A ribbon is a two-dimensional object with one-dimensional properties which is related with geometry, robotics and molecular biology. A folded ribbon structure provides a complex structure through a series of folds. We focus on a folded…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

This work presents formulas for the Kauffman bracket and Jones polynomials of 3-bridge knots using the structure of Chebyshev knots and their billiard table diagrams. In particular, these give far fewer terms than in the Skein relation…

We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…

We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…

Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…