Related papers: The Hurwitz Equivalence Problem is Undecidable
We prove that the exceptional group $E_6(2)$ is not a Hurwitz group. In the course of proving this, we complete the classification up to conjugacy of all Hurwitz subgroups of $E_6(2)$, in particular, those isomorphic to $L_2(8)$ and…
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…
We show that the unification problem `is there a substitution instance of a given formula that is provable in a given logic?' is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the…
To a branched cover f between orientable surfaces one can associate a certain branch datum D(f), that encodes the combinatorics of the cover. This D(f) satisfies a compatibility condition called the Riemann-Hurwitz relation. The old but…
We define a new Hurwitz problem which is essentially a small core of the simple Hurwitz problem. The corresponding Hurwitz numbers have simpler formulae, satisfy effective recursion relations and determine the simple Hurwitz numbers. We…
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…
The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…
We give an alternative proof of the Hurwitz existence problem for branched covers of $\mathbb{P}^1$ in the case where the number of ramification points equals the number of branch points, that is, where all the ramification profiles are of…
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
We study the crossing matrix of a braid and introduce a polynomial invariant for braid systems that is invariant under Hurwitz equivalence. As an application to the study of surface braids and surface links, we also define an invariant that…
We give an affirmative answer to the Grunwald problem for new families of non-solvable finite groups G, away from the set of primes dividing |G|. Furthermore, we show that such G verify the condition (BM), that is, the Brauer-Manin…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
We investigate the Hurwitz action of the $m$-braid group on the $m$-fold Cartesian product of the universal dihedral quandle. We introduce three computable invariants and prove that they give a complete classification of the orbits under…
Given two closed orientable surfaces, the Hurwitz existence problem asks whether there exists a branched cover between them having prescribed global degree and local degrees over the branching points. The Riemann-Hurwitz formula gives a…
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.
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…