Related papers: Unsolvable problems about higher-dimensional knots…

We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…

In this paper, we make use of the relations between the braid and mapping class groups of a compact, connected, non-orientable surface N without boundary and those of its orientable double covering S to study embeddings of these groups and…

We study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density $> 1$ and also to quantum sampling subset sum solutions. We examine a…

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

We define a nontrivial mod 2 valued additive concordance invariant defined on the torsion subgroup of the knot concordance group using involutive knot Floer package. For knots not contained in its kernel, we prove that their iterated…

For a finite group $G$ denote by $N(G)$ the set of conjugesy class sizes of $G$. We show that every finite group $G$ with the property $N(G)=N(Alt_n), n>4$ or $N(G)=N(Sym_n), n>22$ is non-solvable.

We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…

Let $K$ be a nontrivial knot. For each $n\in \mathbb{N}$, we prove that the rank of its $n$th iterated Whitehead doubled knot group $\pi_1(S^3 \setminus \operatorname{WD}^n(K))$ is bounded below by $n+1$. As an application, we show that…

We prove that there is a second countable locally compact group that does not embed as a closed subgroup in any compactly generated locally compact group, and discuss various related embedding and non-embedding results.

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

We prove that the ideal membership problem and the subalgebra membership problem are algorithmically undecidable for differential polynomial algebras with at least two basic derivation operators.

In this paper we prove that any strongly embedded subgroup of a K*-group G of finite Morley rank and odd type that does not interpret any bad field is solvable if its Pruefer 2-rank is at least 2. If the normal 2-rank of G is at least 3…

A relationship between continued fractions and Weyl groupoids of Cartan schemes of rank two is found. This allows to decide easily if a given Cartan scheme of rank two admits a finite root system. We obtain obstructions and sharp bounds for…

In this paper we consider, from a computational point of view, the problem of classifying logics within the Leibniz and Frege hierarchies typical of abstract algebraic logic. The main result states that, for logics presented syntactically,…

We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…

We study the properties of the fundamental group of an affine curve over an algebraically closed field of characteristic $p$, from the point of view of embedding problems. In characteristic zero, the fundamental group is free, but in…

We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…

Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function…