✦ LIBER ✦

On the Stiefel-Whitney numbers of complex manifolds and of spin manifolds

✍ Scribed by J. Milnor

Publisher: Elsevier Science
Year: 1965
Tongue: English
Weight: 517 KB
Volume: 3
Category: Article
ISSN: 0040-9383
DOI: 10.1016/0040-9383(65)90055-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On characteristic numbers of almost comp

On characteristic numbers of almost complex manifolds with framed boundaries

✍ Larry Smith 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 899 KB

On characteristic numbers of almost comp

On characteristic numbers of almost complex manifolds with framed boundaries [1]: A correction

✍ Larry Smith 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 46 KB

On the homotopy groups of suspensions of

On the homotopy groups of suspensions of complex Grassmann manifolds

✍ Hillel H. Gershenson 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Linear Conditions on the Number of Faces

Linear Conditions on the Number of Faces of Manifolds with Boundary

✍ Beifang Chen; Min Yan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 284 KB

The Euler equation and the Dehn᎐Sommerville equations are known to be the Ž . Ž only rational linear conditions for f-vectors number of simplices at various . dimensions of triangulations of spheres. We generalize this fact to arbitrary triangulations, linear triangulations of manifolds, and polytop

Asymptotic expansions for distributions

Asymptotic expansions for distributions of the large sample matrix resultant and related statistics on the Stiefel manifold

✍ Yasuko Chikuse 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 652 KB

The Crossing Number of a Graph on a Comp

The Crossing Number of a Graph on a Compact 2-Manifold

✍ F. Shahrokhi; O. Sýkora; L.A. Székely; I. Vrťo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 478 KB

We introduce a general framework to estimate the crossing number of a graph on a compact 2-manifold in terms of the crossing number of the complete graph of the same size on the same manifold. The bounds are tight within a constant multiplicative factor for many graphs, including hypercubes, some co