相关论文: Still another approach to the braid ordering

Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polynomial time algorithm. We investigate polynomial time…

We estimate from above the set of knots, $\Omega(n,\mu)$, generated by closure of n-string 1+1- and 2+1-dimensional braids of irreducible length $\mu$ ($\mu>>1$) in the limit n>>1.

We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…

Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set. In this paper, we propose a new branch and bound algorithm…

Let $\mathbb{E}_d$ denote the little discs operad for $1 \le d \le \infty$ and let $\mathcal{C}$ be an $\infty$-category all of whose mapping spaces are $n$-truncated. We prove that when considering $\mathbb{E}_d$-monoids in $\mathcal{C}$,…

Building on the work of Iwaniec, Luo and Sarnak, we use the $n$-level density to bound the probability of vanishing to order at least $r$ at the central point for families of cuspidal newforms of prime level $N \to \infty$, split by sign.…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

We revisit classic balancing problems for linear extensions of a partially ordered set $P$, proving results that go far beyond many of the best earlier results on this topic. For example, with $p(x\prec y)$ the probability that $x$ precedes…

We consider categories of Soergel bimodules for the symmetric groups S_n in their gl(n)-realizations for all n and assemble them into a locally linear monoidal bicategory. Chain complexes of Soergel bimodules likewise form a locally…

We use a 2-categorical version of (de-)equivariantization to classify (3+1)d topological orders with a finite $G$-symmetry. In particular, we argue that (3+1)d fermionic topological order with $G$-symmetry correspond to…

We prove that the quotients of the group algebra of the braid group on 3 strands by a generic quartic and quintic relation respectively, have finite rank. This is a special case of a conjecture by Brou\'{e}, Malle and Rouquier for the…

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…

Defined on Birman-Ko-Lee monoids, the rotating normal form has strong connections with the Dehornoy's braid ordering. It can be seen as a process for selecting between all the representative words of a Birman-Ko-Lee braid a particular one,…

We present a systematic approach for constructing bar frameworks that are rigid but not first-order rigid, using constrained optimization. We show that prestress stable (but not first-order rigid) frameworks arise as the solution to a…

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

Let $T$ be an $n$-node tree of maximum degree 4, and let $P$ be a set of $n$ points in the plane with no two points on the same horizontal or vertical line. It is an open question whether $T$ always has a planar drawing on $P$ such that…

We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…

We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by $d$. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of…

Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially…

We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…