Related papers: The undecidability of joint embedding for 3-dimens…
Regular homotopy classes of immersions of a 3-sphere in 5-space constitute an infinite cyclic group. The classes containing embeddings form a subgroup of index 24. The obstruction for a generic immersion to be regularly homotopic to an…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the…
It is well known that the incompressible Euler equations can be formulated in a very geometric language. The geometric structures provide very valuable insights into the properties of the solutions. Analogies with the finite-dimensional…
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…
A combinatorial condition is obtained for when immersed or embedded incompressible surfaces in compact 3-manifolds with tori boundary components remain incompressible after Dehn surgery. A combinatorial characterisation of hierarchies is…
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed to take into account axioms and cuts. We show that it is sound and enjoys the cut…
For any even natural number $r \ge 2$, we construct an irreducible rigid non-cohomologically rigid complex local system of rank $r$ on a smooth projective variety depending on $r$. For $r=2$, we construct an irreducible rigid…
In this short expository note, we give a detailed proof of Markov's theorem on the unsolvability of the homeomorphism problem and of the existence of unrecognizable manifolds in all dimensions larger than 3.
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature $(\lor,\perp,0,1)$, where `$\perp$' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable:…
We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, does there exist a language I in S separating A and B (i.e.,…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We study vector bundles on the moduli stack of elliptic curves over a local ring R. If R is a field or a discrete valuation ring of (residue) characteristic not 2 or 3, all these vector bundles are sums of line bundles. For R the 3-local…
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…
The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.