In this paper, we study the Pontryagin numbers of 24 dimensional String manifolds. In partic- ular, we find representatives of an integral basis of the String cobrodism group at dimension 24, based on the work of Mahowald and Hopkins (The structure of 24 dimensional manifolds having normal bundles which lift to B O [8], from “Recent progress in homotopy theory” (D. M. Davis, J. Morava, G. Nishida, W. S. Wilson, N. Yagita, editors), Contemp. Math. 293, Amer. Math. Soc., Providence, RI, 89-110, 2002), Borel and Hirzebruch (Am J Math 80: 459–538, 1958) and Wall (Ann Math 75:163–198, 1962). This has immediate applications on the divisibility of various characteristic numbers of the manifolds. In particular, we establish the 2-primary divisibilities of the signature and of the modified signature coupling with the integral Wu class of Hopkins and Singer (J Differ Geom 70:329–452, 2005), and also the 3- primary divisibility of the twisted signature. Our results provide potential clues to understand a question of Teichner.

In this paper, we prove that discrete Morse functions on digraphs are flat Witten-Morse functions and Witten complexes of transitive digraphs approach to Morse complexes. We construct a chain complex consisting of the formal linear combinations of paths which are not only critical paths of the transitive closure but also allowed elementary paths of the digraph, and prove that the homology of the new chain complex is isomorphic to the path homology. On the basis of the above results, we give the Morse inequalities on digraphs.

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.

No abstract uploaded!

The approach combines second and fourth order statistics to perform BSS of instantaneous mixtures. It applies for any number of receivers if they are as many as sources. It is a batch algorithm that uses non-Gaussianity and stationarity of source signals. It is linear algebra based direct method, reliable and robust, though large dimensions of sources may slow down the computation significantly. It is however limited to instantaneous mixtures.