相关论文: Computing boundary slopes of 2-bridge links
Mixed level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao and Gilbert-Varshamov type bounds for mixed level orthogonal arrays. The computational complexity of the terms involved…
In the realm of computer-aided design (CAD) software, the intersection of B-spline surfaces stands as a fundamental operation. Despite the extensive history of surface intersection algorithms, the challenge of handling complex intersection…
We draw two incomplete, biased maps of challenges in computational complexity lower bounds.
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij--Soederberg theory. That is, given a Betti diagram, we decompose it into pure diagrams. Relaxing the requirement that the degree sequences…
A partial order on prime knots can be defined by declaring $J\ge K$ if there exists an epimorphism from the knot group of $J$ onto the knot group of $K$. Suppose that $J$ is a 2-bridge knot that is strictly greater than $m$ distinct,…
We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…
Boring is an operation which converts a knot or two-component link in a 3--manifold into another knot or two-component link. It generalizes rational tangle replacement and can be described as a type of 2--handle attachment. Sutured manifold…
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…
Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…
For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…
We show that for every fixed non-negative integer k there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph in the plane with at most k…
The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial…
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
A new formula for the probability that a standard Brownian motion stays between two linear boundaries is proved. A simple algorithm is deduced. Uniform precision estimates are computed. Different implementations have been made available…
Understanding ideal points in the character varieties of knot complements has led to a number of important invariants for 3-manifolds. Ohtsuki (1994) counted the ideal points for character varieties of 2-bridge knot complements, and he made…
In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…
We prove that links with meridional rank 3 whose 2-fold branched covers are graph manifolds are 3-bridge links. This gives a partial answer to a question by S. Cappell and J. Shaneson on the relation between the bridge numbers and…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.