Search for: All records

Abstract We analyze an algorithmic question about immersion theory: for which $$m$$, $$n$$, and $$CAT=\textbf{Diff}$$ or $$\textbf{PL}$$ is the question of whether an $$m$$-dimensional $CAT$-manifold is immersible in $$\mathbb{R}^{n}$$ decidable? We show that PL immersibility is decidable in all cases except for codimension 2, whereas smooth immersibility is decidable in all odd codimensions and undecidable in many even codimensions. As a corollary, we show that the smooth embeddability of an $$m$$-manifold with boundary in $$\mathbb{R}^{n}$$ is undecidable when $n-m$ is even and $$11m \geq 10n+1$$. 

Abstract The Eden Model in$${\mathbb {R}}^n$$ $R^n$constructs a blob as follows: initially a single unit hypercube is infected, and each second a hypercube adjacent to the infected ones is selected randomly and infected. Manin, Roldán, and Schweinhart investigated the topology of the Eden model in$${\mathbb {R}}^{n}$$ $R^n$by considering the possible shapes which can appear on the boundary. In particular, they give probabilistic lower bounds on the Betti numbers of the Eden model. In this paper, we prove analogous results for the Eden model on any infinite, vertex-transitive, locally finite graph: with high probability as time goes to infinity, every “possible” subgraph (with mild conditions on what “possible” means) occurs on the boundary of the Eden model at least a number of times proportional to an isoperimetric profile of the graph. Using this, we can extend the results about the topology of the Eden model to non-Euclidean spaces, such as hyperbolicn-space and universal covers of certain Riemannian manifolds. 

Abstract We study the degree of an L-Lipschitz map between Riemannian manifolds, proving new upper bounds and constructing new examples. For instance, if $$X_k$$ is the connected sum of k copies of $$\mathbb CP^2$$for$$k \ge 4$$, then we prove that the maximum degree of an L-Lipschitz self-map of $$X_k$$ is between $$C_1 L^4 (\log L)^{-4}$$ and $$C_2 L^4 (\log L)^{-1/2}$$. More generally, we divide simply connected manifolds into three topological types with three different behaviors. Each type is defined by purely topological criteria. For scalable simply connected n-manifolds, the maximal degree is $$\sim L^n$$. For formal but nonscalable simply connectedn-manifolds, the maximal degree grows roughly like $$L^n (\log L)^{-\theta (1)}$$. And for nonformal simply connected n-manifolds, the maximal degree is bounded by $$L^\alpha $$ for some $$\alpha < n$$.