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

We define a knot invariant and a 2-knot invariant from any finite categorical group. We calculate an explicit example for the Spun Trefoil.

Based on the novel notion of `weakly counital fusion morphism', regular weak multiplier bimonoids in braided monoidal categories are introduced. They generalize weak multiplier bialgebras over fields and multiplier bimonoids in braided…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…

We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…

Hopf (bi-)modules and crossed modules over a bialgebra B in a braided monoidal category C are considered. The (braided) monoidal equivalence of both categories is proved provided B is a Hopf algebra (with invertible antipode). Bialgebra…

We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…

For each braided category $\mathcal{C}$ we show that, under mild hypotheses, there is an associated category of "half braided algebras" and their bimodules internal to $\mathcal{C}$ which is not only monoidal but even braided and balanced.…

Joyal and Street note in their paper on braided monoidal categories [Braided tensor categories, Advances in Math. 102(1993) 20-78] that the 2-category V-Cat of categories enriched over a braided monoidal category V is not itself braided in…

We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…

This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and…

We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first…

Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised…

The structure of a $k$-fold monoidal category as introduced by Balteanu, Fiedorowicz, Schw\"anzl and Vogt can be seen as a weaker structure than a symmetric or even braided monoidal category. In this paper we show that it is still…

In this paper we provide a solution to the double coset problem for the braid group $B_n$ modulo the Hilden subgroup $H_n.$ This result demonstrates that, as in the case of braid closures, the Link Problem for plat closures is "stably…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

This paper considers the possible underlying multicategories for a symmetric monoidal category, and shows that, up to canonical and coherent isomorphism, there really is only one. As a result, there is a well-defined forgetful functor from…