Related papers: The Hurwitz Equivalence Problem is Undecidable

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

We prove that the Hurwitz action on reflection factorizations of Coxeter elements is transitive up to certain natural constraints in the complex reflection groups G4 and G5. This affirms a more general conjecture by Lewis and Reiner in…

We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…

The isomorphism problem for [free abelian]-by-free groups is unsolvable.

We prove that the elementary theory of Thompson's group $F$ is hereditarily undecidable.

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…

A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…

In our paper [G{\l}uch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable for Regular Path…

We prove that the universal covering of an alternating group Alt(n) which is Hurwitz is still Hurwitz, with 31 exceptions, 30 of which are detectable by the genus formula.

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational…

We construct an example of a group $G = \mathbb{Z}^2 \times G_0$ for a finite abelian group $G_0$, a subset $E$ of $G_0$, and two finite subsets $F_1,F_2$ of $G$, such that it is undecidable in ZFC whether $\mathbb{Z}^2\times E$ can be…

In this paper we complete B\"{u}chi's proof that there is no decision algorithm for the solubility in integers of arbitrary systems of diagonal quadratic form equations, by proving the assertion that whenever $x_1^2, \cdots, x_5^2$ are five…

Let K be the function field of a variety of dimension at least 2 over an algebraically closed field of characteristic zero. Then Hilbert's Tenth Problem for K is undecidable. This generalizes the result by Kim and Roush from 1992 that…

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…

We provide a variety of cases in which two factorizations have Hurwitz orbits of the same size. We begin with prototypical results about factorizations of length two, and show that cycling elements or flipping and inverting elements in any…

We study the Cauchy problem for the fractional Schr\"{o}dinger equation $$ i\partial_tu = (m^2-\Delta)^\frac\alpha2 u + F(u) in \mathbb{R}^{1+n}, $$ where $ n \ge 1$, $m \ge 0$, $1 < \alpha < 2$, and $F$ stands for the nonlinearity of…