Equivariant cobordism, vector fields, and the Euler characteristic

Katsuhiro KOMIYA

doi:10.2969/jmsj/03810009

Katsuhiro KOMIYA

著者情報

ジャーナルフリー

1986 年 38 巻 1 号 p. 9-18

DOI https://doi.org/10.2969/jmsj/03810009

詳細

Published: 1986 Received: 1984/07/11 Available on J-STAGE: 2006/10/20 Accepted: - Advance online publication: - Revised: -
訂正情報
訂正日: 2006/10/20 訂正理由: - 訂正箇所: 引用文献情報訂正内容: Wrong : 1) J. Heithecker, Äquivariantes kontrolliertes Schneiden und Kleben, Math. Ann., 217 (1975), 17-28.
2) J. Heithecker, Äquivarianter Bordismus mit Vektorfeld, Math. Ann., 234 (1978), 1-8.
3) K. Komiya, A necessary and sufficient condition for the existence of non-singular G-vector fields on G-manifolds, Osaka J. Math., 13 (1976), 537-546.
4) K. Prevot, Modifications of controllable cutting and pasting, Houston J. Math., 6 (1980), 565-575.
5) K. Prevot, Cutting and pasting Z_p-manifolds, Canad. Math. Bull., 25 (1982), 13-28.
6) K. Prevot, Cutting and pasting involutions, Rocky Mountain J. Math., 12 (1982), 233-240.
7) B. L. Reinhart, Cobordism and the Euler number, Topology, 2 (1963), 173-177.
8) R. E. Stong, Tangential cobordism, Math. Ann., 216 (1975), 181-196.

Right : [1] J. Heithecker, Äquivariantes kontrolliertes Schneiden und Kleben, Math. Ann., 217 (1975), 17-28.
[2] J. Heithecker, Äquivarianter Bordismus mit Vektorfeld, Math. Ann., 234 (1978), 1-8.
[3] K. Komiya, A necessary and sufficient condition for the existence of non-singular G-vector fields on G-manifolds, Osaka J. Math., 13 (1976), 537-546.
[4] K. Prevot, Modifications of controllable cutting and pasting, Houston J. Math., 6 (1980), 565-575.
[5] K. Prevot, Cutting and pasting Z_p-manifolds, Canad. Math. Bull., 25 (1982), 13-28.
[6] K. Prevot, Cutting and pasting involutions, Rocky Mountain J. Math., 12 (1982), 233-240.
[7] B. L. Reinhart, Cobordism and the Euler number, Topology, 2 (1963), 173-177.
[8] R. E. Stong, Tangential cobordism, Math. Ann., 216 (1975), 181-196.

訂正日: 2006/10/20 訂正理由: - 訂正箇所: PDFファイル訂正内容: -

責任著者(Corresponding author)

訂正情報

J-STAGEへの登録はこちら（無料）