相关论文: The Hurwitz Equivalence Problem is Undecidable

There are natural actions of the braid groups on the products of the braid groups, called the Hurwitz action. We first study the roots of centralizers in the braid groups. By using the structure of the roots, we provide a criterion for the…

For a positively presented group G, we provide a criterion for two tuples of positive group generators of G to be Hurwitz equivalent or Hurwitz-conjugation equivalent. We also present an algorithmic approach to solve the Hurwitz equivalence…

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

We study "pure-cycle" Hurwitz spaces, parametrizing covers of the projective line having only one ramified point over each branch point. We start with the case of genus-0 covers, using a combination of limit linear series theory and group…

We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

This paper classifies the factorizations of almost simple groups with a factor having at least two nonsolvable composition factors. This together with a previous classification result of the authors reduces the factorization problem of…

It is known that Hilbert's Tenth Problem over the Gaussian ring $\mathbb Z[i]=\{a+bi:\ a,b\in\mathbb Z\}$ is undecidable. In this paper we obtain the following further result: There is no algorithm to decide whether an arbitrarily given…

It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the {\lambda}-calculus definition of polyregular functions from Boja\'nczyk (2018). In this…

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…

We classify Nichols algebras of irreducible Yetter-Drinfeld modules over groups such that the underlying rack is braided and the homogeneous component of degree three of the Nichols algebra satisfies a given inequality. This assumption…

We investigate the decidability and computational complexity of (deductive) conservative extensions in fragments of first-order logic (FO), with a focus on the two-variable fragment FO$^2$ and the guarded fragment GF. We prove that…

The analogue of Hilbert's tenth problem over $\mathbb{Q}$ asks for an algorithm to decide the existence of rational points in algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability…

The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…

We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are…

Using Milnor invariants, we prove that the concordance group $\mathcal{C}(2)$ of $2$-string links is not solvable. As a consequence we prove that the equivariant concordance group of strongly invertible knots is also not solvable, and we…

We shed some light on the problem of determining the orbits of the braid group action on semiorthonormal bases of Mukai lattices as considered in \cite{GK04} and \cite{GO1}. We show that there is an algebraic (and in particular algorithmic)…

This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.

We study torus fibrations over the 2-sphere and Hurwitz equivalence of their monodromies. We show that, if two torus fibrations over $S^2$ have the same type of singularities, then their global monodromies are Hurwitz equivalent after…

Some new results on plane F_{q^2}-maximal curves are stated and proved. It is known that the degree d of such curves is upper bounded by q+1 and that d=q+1 if and only if the curve is F_{q^2}-isomorphic to the Hermitian. We show that d\le…