Related papers: The Word Problem for Braided Monoidal Categories i…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

The homology of a Garside monoid, thus of a Garside group, can be computed efficiently through the use of the order complex defined by Dehornoy and Lafont. We construct a categorical generalization of this complex and we give some…

We prove a coherence theorem for invertible objects in a symmetric monoidal category. This is used to deduce associativity, skew-commutativity, and related results for multi-graded morphism rings, generalizing the well-known versions for…

If $\Gamma $ is a group, then braided $\Gamma $-crossed modules are classified by braided strict $\Gamma $-graded categorial groups. The Schreier theory obtained for $\Gamma $-module extensions of the type of an abelian $\Gamma $-crossed…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

We define the notion of whiskered categories and groupoids, showing that whiskered groupoids have a commutator theory. So also do whiskered $R$-categories, thus answering questions of what might be `commutative versions' of these theories.…

In the introduction of this paper we discuss a possible approach to the unitarizability problem for classical p-adic groups. In this paper we give some very limited support that such approach is not without chance. In a forthcoming paper we…

We explain the sense in which a warping on a monoidal category is the same as a pseudomonad on the corresponding one-object bicategory, and we describe extensions of this to the setting of skew monoidal categories: these are a…

This work is a detailed version of arXiv:0704.0195 [math.QA]. We introduce a new notion of the core of a braided fusion category. It allows to separate the part of a braided fusion category that does not come from finite groups. We also…

Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…

This is a report on aspects of the theory and use of monoidal categories. The first section introduces the main concepts through the example of the category of vector spaces. String notation is explained and shown to lead naturally to a…

In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…

It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…

We categorify the notion of an infinitesimal braiding in a linear strict symmetric monoidal category, leading to the notion of a (strict) infinitesimal 2-braiding in a linear symmetric strict monoidal 2-category. We describe the associated…