相关论文: Type 4 is not computable

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…

In the previous three papers in this series, [WKO1]-[WKO3] (arXiv:1405.1956, arXiv:1405.1955, and to appear), Z. Dancso and I studied a certain theory of "homomorphic expansions" of "w-knotted objects", a certain class of knotted objects in…

Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…

It is undecidable whether the language recognized by a probabilistic finite automaton is empty. Several other undecidability results, in particular regarding problems about matrix products, are based on this important theorem. We present…

Using an elementary identity, we prove that for infinitely many polynomials $P(x)\in \mathbb{Z}[X]$ of fourth degree, the equation $\prod\limits_{k=1}^{n}P(k)=y^2$ has finitely many solutions in $\mathbb{Z}$. We also give an example of a…

While the natural model-theoretic ranks available in differentially closed fields (of characteristic zero), namely Lascar and Morley rank, are known not to be definable in families of differential varieties; in this note we show that the…

We address the question of whether the property of being virtually special (in the sense of Haglund and Wise) is algorithmically decidable for finite, non-positively curved cube complexes. Our main theorem shows that it cannot be decided…

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 paper we consider the topological products of modal logics of S4.1 and S4. We prove that it is equal to the fusion of logics S4.1 and S4 plus one additional axiom. We also show that this product is decidable. This is an example of a…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…

We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in $F_2 \oplus F_2$ is undecidable, and as a consequence, the Hurwitz equivalence problem for $\Delta^2$-factorizations in the braid groups $B_n, n\geq 5$ is…

An intriguing correspondence between four-qubit systems and simple singularity of type $D_4$ is established. We first consider an algebraic variety $X$ of separable states within the projective Hilbert space…

A smooth four manifold is of finite type $r$ if its Donaldson invariant satisfies D((x^2-4)^r)=0. We prove that every simply connected manifold is of finite type by using the structure of Donaldson invariants in the presence of immersed…

It is shown that various questions about the existence of simple closed curves in normal subgroups of surface groups are undecidable.

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…