Related papers: Unsolvable problems about higher-dimensional knots…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in $F_2 \oplus F_2$ is undecidable, and as a consequence, the Hurwitz equivalence problem for $\Delta^2$-factorizations in the braid groups $B_n, n\geq 5$ is…
A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends…
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine…
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…
We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.
We investigate several conjectures in geometric topology by assembling computer data obtained by studying weaving knots, a doubly infinite family $W(p,n)$ of examples of hyperbolic knots. In particular, we compute some important polynomial…
The concordance orders of many algebraic order two knots of ten or fewer crossings have been heretofore unknown. We use Casson-Gordon invariants and twisted Alexander polynomials to find that, in all but one case, these knots do not have…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
We exhibit an extension of the category of class two nilpotent groups. It has the same objects but, unlike the latter, its morphisms are closed under pointwise addition of maps. At the same time the class of its morphisms is much smaller…
The present survey aims at being a list of Conjectures and Problems in an area of model-theoretic algebra wide open for research, not a list of known results. To keep the text compact, it focuses on structures of finite Morley rank,…
We study the construction of premonoidal categories, where the pentagon relation fails, through representations of finite group algebras and their quantum doubles. Both finite group algebras and their quantum doubles have a finite number of…
We construct families of trivial $2$-knots $K_i$ in $\mathbb{R}^4$ such that the maximal complexity of $2$-knots in any isotopy connecting $K_i$ with the standard unknot grows faster than a tower of exponentials of any fixed height of the…
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…
Consider the intrinsic fundamental group \`a la Grothendieck of a linear category using connected gradings. In this article we prove that any full convex subcategory is incompressible, in the sense that the group map between the…
The problem of classification of Legendrian knots (links) up to isotopy in the class of Legendrian embeddings (Legendrian isotopy) naturally leads to the following two subproblems. The first of them is: which combinations of the three…
The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…
We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…
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.