Related papers: Unsolvable problems about higher-dimensional knots…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
Knot concordance plays a crucial role in the low dimensional topology. We propose a very elementary techniques which allows one to construct a lot of sliceness obstructions for knots in the full torus. Our approach deals with group…
The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.
This manuscript introduces a new framework for the study of knots by exploring the neighborhood of knot embeddings in the space of simple open and closed curves in 3-space. The latter gives rise to a knotoid spectrum, which determines the…
We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
Seese's conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be…
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable.
For some numerical semigroup rings of small embedding dimension, namely those of embedding dimension 3, and symmetric or pseudosymmetric of embedding dimension 4, presentations has been determined in the literature. We extend these results…
We prove that the knot groups of $6_2$ and $7_6$ are not bi-orderable. These are the only two knot groups up to 7 crossings whose bi-orderability was not known. Our method applies to a very broad class of knots.
We introduce new obstructions to topological knot concordance. These are obtained from amenable groups in Strebel's class, possibly with torsion, using a recently suggested $L^2$-theoretic method due to Orr and the author. Concerning…
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to…
We provide new information about the structure of the abelian group of topological concordance classes of knots in $S^3$. One consequence is that there is a subgroup of infinite rank consisting entirely of knots with vanishing Casson-Gordon…
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…
In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all…
We construct a series of finite-dimensional quantum groups as braided Drinfeld doubles of Nichols algebras of type Super A, for an even root of unity, and classify ribbon structures for these quantum groups. Ribbon structures exist if and…
In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…