相关论文: General cycling operations in Garside groups

We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…

The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…

M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace…

A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…

An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…

We construct a class of Garside groupoid structures on the pure braid groups, one for each function (called labelling) from the punctures to the integers greater than 1. The object set of the groupoid is the set of ball decompositions of…

This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…

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…

Garside groups are a natural lattice-theoretic generalisation of the braid groups and spherical type Artin--Tits groups. Here we show that the class of Garside groups is closed under some free products with cyclic amalgamated subgroups. We…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…

We define an action of the braid group of a simple Lie algebra on the space of imaginary roots in the corresponding quantum affine algebra. We then use this action to determine an explicit condition for a tensor product of arbitrary…

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

Consider an element~$x$ of a Garside group which is rigid in the sense of Garside-theory. Let $SC(x)$ be the set of rigid conjugates of~$x$ -- this is a well-known characteristic subset of the conjugacy class of~$x$. We present…

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…

In this paper we study Thurston's automaton on the braid groups via binary operations. These binary operations are obtained from the construction of this automaton. We study these operations and find some connections between them in a "skew…

In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…

The goal of this article is to relate recent developments in cyclic homology theory with the theory of operads and homotopical algebra, and hence to provide a general framework to define and study operations in cyclic homology theory.

An important piece of information in the theory of the arithmetic Galois action on the geometric fundamental groups of schemes is that divisorial inertia is acted on cyclotomically. We detail in this note the content of this fact in the…