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

An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…

Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…

Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…

We establish the order of the maximum length of an increasing sequence, bounded by $n$, in which the largest prime divisor of the elements form a decreasing sequence.

For each integer $n\ge 1$, after fixing a proper complexity function on the braid group $\B_{2n}$, we use the Dehornoy order to define a strict total order on the set \[ \mathcal P_{2n}=H_{2n}\backslash \B_{2n}/H_{2n} \] of $2n$--plat…

The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface $F$ in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the…

The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…

The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.

This paper primarily investigates a specific type of deformation of the braid arrangement $\mathcal{B}_n$ in $\mathbb{R}^n$, denoted by $\mathcal{B}_n^A$ and defined in (1.2). Let $r_l(\mathcal{B}_n^A)$ be the number of regions of level $l$…

In this paper we study complexity of an extension of ordered binary decision diagrams (OBDDs) called $c$-OBDDs on CNFs of bounded (primal graph) treewidth. In particular, we show that for each $k$ there is a class of CNFs of treewidth $k…

We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…

Motivated by physical and topological applications, we study representations of the group $\mathcal{LB}_3$ of motions of $3$ unlinked oriented circles in $\mathbb{R}^3$. Our point of view is to regard the three strand braid group…

We give a complete classification of homomorphisms from the commutator subgroup of the braid group on $n$ strands to the braid group on $n$ strands when $n$ is at least 7. In particular, we show that each nontrivial homomorphism extends to…

The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of…

We introduce and analyze a discrete-time network process in which each node holds a (weak) preference ordering over a finite set of alternatives and updates by local Borda aggregation. At each step, a node forms a weighted average…

We investigate a group $B\_\bullet$ that includes Artin's braid group $B\_\infty$ and Thompson's group $F$. The elements of $B\_\bullet$ are represented by braids diagrams in which the distances between the strands are not uniform and,…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…