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

We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…

Braided-enriched monoidal categories were introduced in work of Morrison-Penneys, where they were characterized using braided central functors. Recent work of Kong-Yuan-Zhang-Zheng and Dell extended this characterization to an equivalence…

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

We study several classes of braided fusion categories, and prove that they all contain nontrivial Tannakian subcategories. As applications, we classify some fusion categories in terms of solvability and group-theoreticality.

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 start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out to be modules for these bialgebras

We study the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, of weakly compressible monoids, as defined by Adian & Oganesian. We show that if $\mathcal{C}$ is a reversal-closed super-$\operatorname{AFL}$,…

One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to…

A graded tensor category over a group $G$ will be called a crossed product tensor category if every homogeneous component has at least one multiplicatively invertible object. Our main result is a description of the crossed product tensor…

Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

We construct in a unifying way skew-multicategories and multicategories of double and Gray-categories that we call Gray (skew) multicategories. We study their different versions depending on the types of functors and higher transforms. We…

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.

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we…

A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…

We show that doubly degenerate Penon tricategories give symmetric rather than braided monoidal categories. We prove that Penon tricategories cannot give all tricategories, but we show that a slightly modified version of the definition…

The 2-category V-Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V. The exception is the case in which V is symmetric, which leads to V-Cat being symmetric as…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

$2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where several sheets meet. We show that the word problem for fundamental groups of $2$-stratifolds is solvable.