We quantize the interaction of gravity with Yang-Mills and spinor fields, hence offering a quantum theory incorporating all four fundamental forces of nature. Let as abbreviate the spatial Hamilton functions of the Standard Model by $H_{SM}$ and the Hamilton function of gravity by $H_G$. Working in a fiber bundle $E$ with base space $\socc=\R[n]$, where the fiber elements are Riemannian metrics, we can express the Hamilton functions in the form $H_G+H_{SM}=H_G+t^{-\frac23}\tilde H_{SM}$ if $n=3$, where $\tilde H_{SM}$ depends on metrics $\s_{ij}$ satisfying $\det{\s_{ij}}=1$. In the quantization process, we quantize $H_G$ for general $\s_{ij}$ but $\tilde H_{SM}$ only for $\s_{ij}=\de_{ij}$ by the usual methods of QFT. Let $v$ \resp $\psi$ be the spatial eigendistributions of the respective Hamilton operators, then, the solutions $u$ of the Wheeler-DeWitt equation are given by $u=wv\psi$, where $w$ satisfies an ODE and $u$ is evaluated at $(t,\de_{ij})$ in the fibers.

We define enlargeable length-structures on closed topological manifolds and then show that the connected sum of a closed n-manifold with an enlargeable Riemannian length-structure with an arbitrary closed smooth manifold carries no Riemannian metrics with positive scalar curvature. We show that closed smooth manifolds with a locally CAT(0)-metric which is strongly equivalent to a Riemannian metric are examples of closed manifolds with an enlargeable Riemannian length-structure. Moreover, the result is correct in arbitrary dimensions based on the main result of a recent paper by Schoen and Yau. We define the positive MV-scalar curvature on closed orientable topological manifolds and show the compactly enlargeable length-structures are the obstructions of its existence.

No abstract uploaded!

Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy to implement and faster than graph Laplacian.

We consider the solution of large-scale discrete-time algebraic Riccati equations with numerically low-ranked solutions. The structure-preserving doubling algorithm will be adapted, with the iterates for A not explicitly computed but in the recursive form Ak= A2 k 1 D (1) k