相关论文: The Hurwitz Equivalence Problem is Undecidable

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

This is the fifth one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with orthogonal groups of plus type.

We expand Topological Field Theory on some special CW-complexes (brane complexes). This Brane Topological Field Theory one-to-one corresponds to infinite dimensional Frobenius Algebras, graduated by CW-complexes of lesser dimension. We…

Mateescu, Salomaa, and Yu asked: is it decidable whether a given subword history assumes only non-negative values for all words over a given alphabet. In this paper, we solve this open problem by proving that this problem is undecidable…

An integer sequence is called realizable if it is the count of periodic points of some map. The Fibonacci sequence $(F_n)$ does not have this property, and the Fibonacci sequence sampled along the squares $(F_{n^2})$ also does not have this…

Let $G$ and $N$ be finite groups of order $2n$ where $n$ is odd. We say the pair $(G,N)$ is Hopf-Galois realizable if $G$ is a regular subgroup of $\h(N)=N\rtimes\au(N)$. In this article we give necessary conditions on $G$ (similarly $N$)…

We compute the number of (weak) equivalence classes of branched covers from a surface of genus g to the sphere, with 3 branching points, degree 2k, and local degrees over the branching points of the form (2,...,2), (2h+1,1,2,...,2),…

As a step towards resolving a question of Ru\v{s}kuc on the decidability of joint embedding for hereditary classes of permutations, which may be viewed as structures in a language of 2 linear orders, we show the corresponding problem is…

Double Hurwitz numbers enumerate branched covers of $\mathbb{CP}^1$ with prescribed ramification over two points and simple ramification elsewhere. In contrast to the single case, their underlying geometry is not well understood. In…

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…

In this article, we will study unbounded solutions of the 2D incompressible Euler equations. One of the motivating factors for this is that the usual functional framework for the Euler equations (e.g. based on finite energy conditions, such…

We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.

A class of $(2n)^2\times(2n)^2$ multiparameter braid matrices are presented for all $n$ $(n\geq 1)$. Apart from the spectral parameter $\theta$, they depend on $2n^2$ free parameters $m_{ij}^{(\pm)}$, $i,j=1,...,n$. For real parameters the…

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…

In this article, we deal with propositional calculi over a signature containing the classical implication $\to$ with the rules of modus ponens and substitution. For these calculi we consider few recognizing problems such as recognizing…

Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.