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

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.

It is well-known that there is a faithful representation of braid groups on automorphism groups of free groups, and it is also well-known that free groups are bi-orderable. We investigate which n-strand braids give rise to automorphisms…

We introduce the task of out-of-order membership to a formal language L, where the letters of a word w are revealed one by one in an adversarial order. The length |w| is known in advance, but the content of w is streamed as pairs (i, w[i]),…

A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears with exponents that are all positive, or all…

We develop the Witt group for certain braided monoidal categories with duality. In case of a braided fusion category over an algebraically closed field of characteristic zero, we explicitly describe this structure. We then use this…

Balliu et al. (DISC 2020) classified the hardness of solving binary labeling problems with distributed graph algorithms; in these problems the task is to select a subset of edges in a $2$-colored tree in which white nodes of degree $d$ and…

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…

Let M be a compact, connected non-orientable surface without boundary and of genus g greater than or equal to 3. We investigate the pure braid groups P_n(M) of M, and in particular the possible splitting of the Fadell-Neuwirth short exact…

Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…

We exhibit a new presentation of the (equilateral) Von Dyck groups $D(2,3,n), \ n\ge 3$, in terms of two generators of order $n$ satisfying three relations, one of which is Artin's braid relation. By dropping the relation which fixes the…

We prove that, for $n\geq 3$, the minimal dimension of a model of the classifying space of the full braid group $B_n$, and of the pure braid group $P_n$, with respect to the family of virtually cyclic groups is $n$.

It is known that the behavior of the Mitchell order substantially changes at the level of rank-to-rank extenders, as it ceases to be well-founded. While the possible partial order structure of the Mitchell order below rank-to-rank extenders…

We prove a generalization of the Brill-Noether theorem for the variety of special divisors $W^r_d(C)$ on a general curve $C$ of prescribed gonality. Our main theorem gives a closed formula for the dimension of $W^r_d(C)$. We build on…

The anomaly of non-invertible higher-form symmetries is determined by the braiding of topological operators implementing them. In this paper, we study a method to classify braidings on topological line and surface operators by leveraging…

We are concerned with mapping class groups of surfaces with nonempty boundary. We present a very natural method, due to Thurston, of finding many different left orderings of such groups. The construction involves equipping the surface with…

In this paper we define a new family of groups which generalize the {\it classical braid groups on} $\C $. We denote this family by $\{B_n^m\}_{n \ge m+1}$ where $n,m \in \N$. The family $\{ B_n^1 \}_{n \in \N}$ is the set of classical…

We consider group orders and right-orders which are discrete, meaning there is a least element which is greater than the identity. We note that free groups cannot be given discrete orders, although they do have right-orders which are…

We consider the problem of minimizing a sum of several convex non-smooth functions. We introduce a new algorithm called the selective linearization method, which iteratively linearizes all but one of the functions and employs simple…

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…