Related papers: The Word Problem for Braided Monoidal Categories i…
The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
We classify (multi)fusion 2-categories in terms of braided fusion categories and group cohomological data. This classification is homotopy coherent -- we provide an equivalence between the 3-groupoid of (multi)fusion 2-categories up to…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
This article offers an intuitive introduction to monoidal categories through the lens of painting, presenting abstract mathematical concepts with visual and tactile analogies. Aimed at curious undergraduates and non-specialists, it seeks to…
We investigate two "categorified" braid conjugacy class invariants, one coming from Khovanov homology and the other from Heegaard Floer homology. We prove that each yields a solution to the word problem but not the conjugacy problem in the…
In this paper we introduce a strict monoidal subcategory of the category of matrices, suitable to address a higher representation theoretic analogue of radicals (non-semisimplicity) in ordinary representation theory. We show the extent to…
We show that every braiding on a monoidal bicategory induces a monoidal structure on its bicategory of monoids, such that if the former is sylleptic or symmetric then the latter is braided or symmetric, respectively. This extends a classic…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
Braided bialgebras of type one in abelian braided monoidal categories are characterized as braided graded bialgebras which are strongly $\mathbb{N}$-graded both as an algebra and as a coalgebra.
Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…
We associate to every positive braid a braid monodromy group, generalizing the geometric monodromy group of an isolated plane curve singularity. If the closure of the braid is a knot, we identify the corresponding group with a framed…
We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a…
We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…
In this expository paper, we discuss and compare the notions of braided and coboundary monoidal categories. Coboundary monoidal categories are analogues of braided monoidal categories in which the role of the braid group is replaced by the…
The centre of a monoidal category is a braided monoidal category. Monoidal categories are monoidal objects (or pseudomonoids) in the monoidal bicategory of categories. This paper provides a universal construction in a braided monoidal…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…