Related papers: Resolution depth of positive braids
A centroid node in a tree is a node for which the sum of the distances to all other nodes attains its minimum, or equivalently a node with the property that none of its branches contains more than half of the other nodes. We generalise some…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…
We provide the optimal linear bound for the signature of positive four-braids in terms of the three-genus of their closures. As a consequence, we improve previously known linear bounds for the signature in terms of the first Betti number…
We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…
In this paper we extend the knowledge on the problem of empirically searching for sorting networks of minimal depth. We present new search space pruning techniques for the last four levels of a candidate sorting network by considering only…
We show that 3-braid links with given (non-zero) Alexander or Jones polynomial are finitely many, and can be effectively determined. We classify among closed 3-braids strongly quasipositive and fibered ones, and show that 3-braid links have…
Assessing the complexity of functions computed by a neural network helps us understand how the network will learn and generalize. One natural measure of complexity is how the network distorts length - if the network takes a unit-length…
Let n be a positive integer. We provide a Khovanov homology proof of the following classical fact: If the closure of an n-strand braid is the n-component unlink, then the braid is trivial.
We give some conditions on positive braids with at least two full twists that ensure their closure is a hyperbolic knot, with applications to the geometric classification of T-links, arising from dynamics, and twisted torus knots.
The depth of a simple algebraic extension $(L/K,v)$ of valued fields is the minimal length of the Mac Lane-Vaqui\'e chains of the valuations on $K[x]$ determined by the choice of different generators of the extension. In a previous paper,…
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is drawn centered on v with a radius that is alpha times the…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…
Vertex integrity is a graph parameter that measures the connectivity of a graph. Informally, its meaning is that a graph has small vertex integrity if it has a small separator whose removal disconnects the graph into connected components…
Under polynomial time reduction, the maximum likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is…
The sorting number of a graph with $n$ vertices is the minimum depth of a sorting network with $n$ inputs and outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in…
We investigate the structure of reduced triply graded link homology $\overline{\mathrm{HHH}}$ in the top/bottom three $T-$degrees for links arising as closures of positive/negative braids. Using a diagrammatic approach to the Hochschild…
Constraints are given on the depth of diagonal subalgebras in generalized triangular matrix algebras. The depth of the top subalgebra B = A /rad A in a finite, connected, acyclic quiver algebra A over an algebraically closed field K is then…
We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…