Related papers: Simpler algorithmically unrecognizable 4-manifolds

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.

We show that there is no algorithm to decide whether or not a given 4-manifold is homeomorphic to the connected sum of 12 copies of S^2 \times S^2.

We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…

It is known that there are four-manifolds which are not algorithmically recognizable. This implies that there exist triangulations of these manifolds which are separated by large barriers from the point of view of the computer algorithm. We…

We study the set of all closed oriented smooth 4-manifolds experimentally, according to a suitable complexity defined using Turaev's shadows. This complexity roughly measures how complicated the 2-skeleton of the 4-manifold is. We…

We prove that a closed 4-manifold has shadow-complexity zero if and only if it is a kind of 4-dimensional graph manifold, which decomposes into some particular blocks along embedded copies of S^2 x S^1, plus some complex projective spaces.…

It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the…

One approach to produce a pair of homeomorphic-but-not-diffeomophic closed 4-manifolds is to find a knot which is smoothly slice in one but not the other. This approach has never been run successfully. We give the first examples of a pair…

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…

One can define the complexity of a smooth 4-manifold as the minimal sum of the number of disks, strands and crossings in a Kirby diagram. Martelli proved that the number of homeomorphism classes of complexity less than n grows as $n^2$. In…

In this article we prove that, if $X$ is a smooth $4$-manifold containing an embedded double node neighborhood, all knot surgery $4$-manifolds $X_K$ are mutually diffeomorphic to each other after a connected sum with $\mathbb{CP}^2$. Hence,…

We produce infinitely many distinct irreducible smooth 4-manifolds homeomorphic to #(2m+1)(CP^2 # -CP^2) and #(2n+1)(S^2 x S^2), respectively, for each m>3 and n>4. These provide the smallest exotic closed simply connected 4-manifolds with…

Due to the unrecognizability of certain manifolds there must exist pairs of triangulations of these manifolds that can only be reached from each other by going through an intermediate state that is very large. This might reduce the…

We show that there exists an algorithm that takes as input two closed, simply connected, topological 4-manifolds and decides whether or not these 4-manifolds are homeomorphic. In particular, we explain in detail how closed, simply…

We show that if a closed oriented $n$-manifold $M$ has a non-trivial cohomology class of even degree $k$, whose all pullbacks to products of type $S^1\times N$ vanish, then the topological complexity $\mathrm{TC}(M)$ is at least $6$, if $n$…

We demonstrate new applications of the trace embedding lemma to the study of piecewise-linear surfaces and the detection of exotic phenomena in dimension four. We provide infinitely many pairs of homeomorphic 4-manifolds $W$ and $W'$…

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

We show that minimal symplectic 4--manifolds with $b_2^+ >1$ and with residually finite fundamental groups are irreducible. We also give examples of irreducible orientable four--manifolds with indefinite intersection forms which are not…

In this paper, we establish a version of the adjunction inequality for closed symplectic 4-manifolds. As in a previous paper on the Thom conjecture, we use contact geometry and trisections of 4-manifolds to reduce this inequality to the…

Proximal methods are known to identify the underlying substructure of nonsmooth optimization problems. Even more, in many interesting situations, the output of a proximity operator comes with its structure at no additional cost, and…