Related papers: On the Andrews-Curtis conjecture and algorithms fr…
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…
In this paper, we demonstrate the non-existence of a computational algorithm capable of determining whether the second homotopy group of any compact constructive topological space is trivial. This finding shows the inherent limitations of…
We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…
In this paper, we study the generalized Douglas-Rachford algorithm and its cyclic variants which include many projection-type methods such as the classical Douglas-Rachford algorithm and the alternating projection algorithm. Specifically,…
By introducing a new point of view in Algebraic Topology relating elliptic curves in $\mathbb{R}^2$ and suitable bordism groups, the congruent number problem is solved showing that the Tunnell's theorem is also sufficient. This could be…
A covariant functor from the category of mapping tori to a category of AF-algebras is constructed; the functor takes continuous maps between such manifolds to stable homomorphisms between the corresponding AF-algebras. We use this functor…
The Douglas-Rachford algorithm is a simple yet effective method for solving convex feasibility problems. However, if the underlying constraints are inconsistent, then the convergence theory is incomplete. We provide convergence results when…
Combining measurements which have "theoretical uncertainties" is a delicate matter, due to an unclear statistical basis. We present an algorithm based on the notion that a theoretical uncertainty represents an estimate of bias.
We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of…
In [R2] and [RO] the Arnold conjecture for closed symplectic manifolds with trivial second homotopy group was proved. This proof used surgery and cobordism theory. Here we give a purely cohomological proof of this result.
A mostly expository account of old questions about the relationship between polyhedra and topological manifolds. Topics are old topological results, new gauge theory results (with speculations about next directions), and history of the…
Coincidences of maps between smooth manifolds are studied via a geometric approach which involves (nonstabilized) normal bordism theory and pathspaces.
We prove the crepant resolution conjecture for Donaldson-Thomas invariants of toric Calabi-Yau 3-orbifolds with transverse A-singularities.
A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…
In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
Understanding how singularities behave under small perturbations is a central theme in singularity theory. In this paper we establish sufficient conditions for families of analytic function-germs on a germ of a complex analytic space to…
The Douglas--Rachford algorithm is a popular algorithm for solving both convex and nonconvex feasibility problems. While its behaviour is settled in the convex inconsistent case, the general nonconvex inconsistent case is far from being…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…