paper

A Dehornoy-Type Ordering on Bridge Positions of Links

arXiv:2604.07790

Abstract

By a theorem of Hovland, bridge isotopy classes of -bridge positions of links in correspond bijectively to Hilden double cosets . We use this correspondence to introduce Dehornoy-type orderings on bridge positions. After fixing a proper complexity function on , we assign to each double coset its Dehornoy-minimal braid among the elements of minimal complexity. Comparing these representatives by the Dehornoy order gives a strict total order , and comparing them first by complexity and then by the Dehornoy order gives a strict well-order . For a link type and , we single out a canonical -bridge position : it is the -least element of the set of -bridge positions of , and the -least element among those of minimal complexity, and its canonical braid coincides with the globally Dehornoy-minimal braid of minimal complexity representing . We show by an example that, in general, it need not be least for on the whole set. Finally, we show that the fixed-level bridge finiteness conjecture is equivalent to boundedness of the complexities of the canonical representatives, and to the existence of a -greatest -bridge position.

arXiv comment11 pages. Substantially revised version. Corrected the false minimality assertion in the original Theorem 4.5 by introducing a complexity-refined Dehornoy well-order. Added an explicit counterexample to the original claim and updated the proofs and references