Related papers: Bridge number and tangle products

We obtain bounds on hyperbolic volume for periodic links and Conway sums of alternating tangles. For links that are Conway sums we also bound the hyperbolic volume in terms of the coefficients of the Jones polynomial.

We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…

The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for the hypercube. We generalize this result to give sharp lower…

We consider closed acylindrical surfaces in 3-manifolds and in knot and link complements, and show that the genus of these surfaces is bounded linearly by the number of tetrahedra in the triangulation of the manifold and by the number of…

We prove that the tunnel number of a satellite chain link with a number of components higher than or equal to twice the bridge number of the companion is as small as possible among links with the same number of components. We prove this…

We study quantum entanglements induced on product states by the action of 8-vertex braid matrices, rendered unitary with purely imaginary spectral parameters (rapidity). The unitarity is displayed via the "canonical factorization" of the…

Meier and Zupan introduced bridge trisections of surface links in $S^4$ as a 4-dimensional analogue to bridge decompositions of classical links, which gives a numerical invariant of surface links called the bridge number. We prove that…

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…

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…

We construct branched double coverings by certain direct products of manifolds for connected sums of copies of sphere bundles over the 2-sphere. As an application we answer a question of Kotschick and Loeh up to dimension five. More…

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…

Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles.…

A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…

In recent years, Karr's difference field theory has been extended to the so-called $R\Pi\Sigma$-extensions in which one can represent not only indefinite nested sums and products that can be expressed by transcendental ring extensions, but…

We develop a calculus of surgery data, called bridged links, which involves besides links also pairs of balls that describe one-handle attachements. As opposed to the usual link calculi of Kirby and others this description uses only…

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

Sometimes only some digits of a numerical product or some terms of a polynomial or series product are required. Frequently these constitute the most significant or least significant part of the value, for example when computing initial…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…