相关论文: Positive braids of maximal signature

We show that the difference between the Seifert genus and the topological 4-genus of a prime positive braid knot is bounded from below by an affine function of the minimal number of strands among positive braid representatives of the knot.…

In this note, we prove a lower bound for the positive kinkiness of a closed braid which we then use to derive an estimate for the positive kinkiness of a link in terms of its Seifert system. As an application, we show that certain pretzel…

We provide linear lower bounds for the signature of positive braids in terms of the three genus of their braid closure. This yields linear bounds for the topological slice genus of knots that arise as closures of positive braids.

We derive a lower bound for all Levine-Tristram signatures of positive braid links, linear in terms of the first Betti number. As a consequence, we obtain upper and lower bounds on the ratio of fixed pairs of Levine-Tristram signature…

We show that the signature of a positive braid link is bounded from below by one-quarter of its first Betti number. This equates to one-half of the optimal bound conjectured by Feller, who previously provided a bound of one-eighth.

We show that a positive braid knot has maximal topological 4-genus exactly if it has maximal signature invariant. As an application, we determine all positive braid knots with maximal topological 4-genus and compute the topological 4-genus…

We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids…

It was asked by J.Birman, Williams, and L.Rudolph whether nontrivial Lorentz knots have always positive signature. Lorentz knots are examples of positive braids (in our convention they have all crossings negative so they are negative…

We classify 3-braid knots whose topological 4-genus coincides with their Seifert genus, using McCoy's twisting method and the Xu normal form. In addition, we give upper bounds for the topological 4-genus of positive and strongly…

We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…

We compute the next-to-top term of knot Floer homology for positive braid links. The rank is 1 for any prime positive braid knot. We give some examples of fibered positive links that are not positive braids.

We derive a linear estimate of the signature of positive knots, in terms of their genus. As an application, we show that every knot concordance class contains at most finitely many positive knots.

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…

We partially determine grid homology (combinatorial knot Floer homology) of diagonal knots, which are conjectured to be equivalent to positive braid knots, by exploiting nice grid diagrams. Its next-to-top term detects the number of prime…

For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…

A positive braid with at least one full twist is known to be a minimal braid, i.e, it achieves the braid index for its closure. In this paper we find knots that are the closure of positive minimal braids that cannot be represented by…

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

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…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…