A Homotopy-like Class Invariant for Sub-manifolds of Punctured Euclidean Spaces

preprint2011arXivOpen access

Abstract

We consider the DD-dimensional Euclidean space, RD\mathbb{R}^D, with certain (D−N)(D-N)-dimensional compact, closed and orientable sub-manifolds (which we call \emph{singularity manifolds} and represent by S~\widetilde{\mathcal{S}}) removed from it. We define and investigate the problem of finding a homotopy-like class invariant (χχ-homotopy) for certain (N−1)(N-1)-dimensional compact, closed and orientable sub-manifolds (which we call \emph{candidate manifolds} and represent by ωω) of RD∖S~\mathbb{R}^D \setminus \widetilde{\mathcal{S}}, with special emphasis on computational aspects of the problem. We determine a differential (N−1)(N-1)-form, ψS~ψ_{\widetilde{\mathcal{S}}}, such that χS~(ω)=∫ωψS~χ_{\widetilde{\mathcal{S}}}(ω) = \int_ωψ_{\widetilde{\mathcal{S}}} is a class invariant for such candidate manifolds. We show that the formula agrees with formulae from Cauchy integral theorem and Residue theorem of complex analysis (when D=2,N=2D=2,N=2), Biot-Savart law and Ampere's law of theory of electromagnetism (when D=3,N=2D=3,N=2), and the Gauss divergence theorem (when D=3,N=3D=3,N=3), and discover that the underlying equivalence relation suggested by each of these well-known theorems is the χχ-homotopy of sub-manifolds of these low dimensional punctured Euclidean spaces. We describe numerical techniques for computing ψS~ψ_{\widetilde{\mathcal{S}}} and its integral on ωω, and give numerical validations of the proposed theory for a problem in a 5-dimensional Euclidean space. We also discuss a specific application from \emph{robot path planning problem}, when N=2, and describe a method for computing least cost paths with homotopy class constraints using \emph{graph search techniques}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.