Related papers: The Word Problem for Braided Monoidal Categories i…
We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…
We study and give examples of braided groupoids, and, a fortiori, non-degenerate solutions of the quiver-theoretical braid equation.
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
The square-free word problem relative to a system of two defining relations is decidable.
We present a complete classification of the deterministic distributed time complexity for a family of graph problems: binary labeling problems in trees. These are locally checkable problems that can be encoded with an alphabet of size two…
This work contributes to clarifying several relationships between certain higher categorical structures and the homotopy type of their classifying spaces. Bicategories (in particular monoidal categories) have well understood simple…
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$,…
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears with exponents that are all positive, or all…
We construct long sequences of braids that are descending with respect to the standard order of braids (``Dehornoy order''), and we deduce that, contrary to all usual algebraic properties of braids, certain simple combinatorial statements…
In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…
The following problem is NP-hard: given a regular expression $E$, decide if $E^*$ is not co-finite.
We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in…
In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…
The fact that the cocommutative comonoids in a symmetric monoidal category form the best possible approximation by a cartesian category is revisited when the original category is only braided monoidal. This leads to the question when the…
We analyze different aspects of neural network predictions of knot invariants. First, we investigate the impact of different knot representations on the prediction of invariants and find that braid representations work in general the best.…
Let $u(K)$ and $g(K)$ denote the unknotting number and the genus of a knot $K$, respectively. For a 3-braid knot $K$, we show that $u(K)\le g(K)$ holds, and that if $u(K)=g(K)$ then $K$ is either a 2-braid knot, a connected sum of two…
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been…
We introduce, for a symmetric fusion category $\mathcal{A}$ with Drinfeld centre $\mathcal{Z}(\mathcal{A})$, the notion of $\mathcal{Z}(\mathcal{A})$-crossed braided tensor category. These are categories that are enriched over…