Related papers: On the complexity of 2-bridge link complements

We present a procedure to generate bipartite grids for simply connected domains in 2-D and 3-D of prescribed size and controlled regularity elements. The mesh elements $K$ of the triangulation satisfy $\zeta_{K} \leq C$ where $\zeta_{K}$ is…

Using a $U$-duality symmetry of type II compactification on $T^4$ represented by triality action on the $T$-duality group, and applying the adiabatic argument we construct dual pairs of type II compactifications in lower dimensions. The…

We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

We advocate a framework for constructing perturbative closed string compactifications which do not have large-radius limits. The idea is to augment the class of vacua which can be described as fibrations by enlarging the monodromy group…

A recent result in [2] on the non-existence of Gauss-Lobatto cubature rules on the triangle is strengthened by establishing a lower bound for the number of nodes of such rules. A method of constructing Lobatto type cubature rules on the…

We prove that the Whitehead link complement and the (-2, 3, 8) pretzel link complement are the minimal volume orientable hyperbolic 3-manifolds with two cusps, with volume 3.66... = 4 x Catalan's constant. We use topological arguments to…

Superstring theories are the most promising theories for unified description of all fundamental interactions including gravity. However, these theories are formulated consistently only in 10 spacetime dimensions. Therefore, to connect to…

We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that…

A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of…

Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…

This note contains two new observations on the linkage properties of quaternion algebras over fields of characteristic 2: first, that a 3-linked field need not be 4-linked (a case which was left open in previous papers) and that three…

We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.

We propose a construction of non-trivial vacua for Yang-Mills theories on the 3-torus. Although we consider theories with periodic boundary conditions, twisted boundary conditions play an essential auxiliary role in our construction. In…

A knot in the 3-sphere in genus-1 1-bridge position (called a (1,1)-position) can be described by an element of the braid group of two points in the torus. Our main results tell how to translate between a braid group element and the…

We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is $\frac{4}{3}$, which matches the current best ratio. The approximation ratio of the algorithm is $\frac{6}{5}$…

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given…

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 present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to capture, in the context of solving the half-integral linkage…

Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…