Related papers: Conjugacy in Garside groups I: Cyclings, powers, a…

We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…

We use the Birman-Ko-Lee presentation of the braid group to show that all closures of strongly quasipositive braids whose normal form contains a positive power of the dual Garside element $\delta$ are fibered. We classify links which admit…

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…

We show that if a H\"{o}lder continuous linear cocycle over a hyperbolic system is measurably conjugate to a cocycle taking values in a unipotent group, then the cocycle is H\"older continuously conjugate to a cocycle taking values in a…

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…

We associate to a braided 2-stack ${\cal C}$ a torsor, endowed with a symmetric cube structure (or $\Sigma$-structure), whose triviality is equivalent to the existence on ${\cal C}$ of a fully symmetric monoidal structure. In order to…

The notion of formal duality in finite Abelian groups appeared recently in relation to spherical designs, tight sphere packings, and energy minimizing configurations in Euclidean spaces. For finite cyclic groups it is conjectured that there…

We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…

A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If $G$ is a graph, then ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that one can assign a fixed geodesic to…

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…

Let $G$ be a locally compact abelian group. By modifying a theorem of Pedersen, it follows that actions of $G$ on $C^*$-algebras $A$ and $B$ are outer conjugate if and only if there is an isomorphism of the crossed products that is…

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which…

We introduce separability properties corresponding to generalized versions of the conjugacy, twisted conjugacy, Brinkmann and Brinkmann's conjugacy problems and how they relate when finite and cyclic extensions of groups are taken. In…

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…