• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2001 Fiscal Year Final Research Report Summary

Elliptic fibre structures and Mordell-Weil groups of Enriques surfaces

Research Project

Project/Area Number 11640047
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Algebra
Research InstitutionToho University

Principal Investigator

UMEZU Yumiko  Toho University, School of Medicine, Assistant Professor, 医学部, 助教授 (70185065)

Co-Investigator(Kenkyū-buntansha) KOBAYASHI Yuji  Toho Unversity, Faculty of Science, Professor, 理学部, 教授 (70035343)
Project Period (FY) 1999 – 2001
KeywordsAlgebraic surfaces / Fibred surfaces / Mordell-Weil groups / Singularity / Algebraic systems / Monoids / Rewriting methods / Homotopy
Research Abstract

We studied more generally algebraic surfaces with fibration of curves.
First, we examined Neron's method to construct an infinite family of curves of genus g 【greater than or equal】 2 over Q with high rank. We showed that his method does not give the existence of curves of genus g with rank r 【greater than or equal】 3g + 7, as he claimed, but r 【greater than or equal】 3g + 6. Moreover we improved his method and showed the existance of faimilies of curves with g 【greater than or equal】 3 and rank r 【greater than or equal】 3g + 7.
Next, we considered surfaces with elliptic fibration with Kodaira dimension one who admit normal quintic birational models. To describe their fibre structures we studied their multiple fibres, and obtained the possible number of multiple fibres and their multiplicities. In particular we classified these numbers and multiplicities when the geomertic genus of the surfaces is not zero.
We studied structural and computational problems of algebraic systems (particularly monoids) defined by finite generators and finite relations mainly applying the rewriting methods. We studied the termination problem of one-rule rewriting systems and the homotopy relations on the complex depicting rewriting steps in a monoid, originally introduced by Squier. We studied relationship between homotopy finiteness and homology finiteness, and showed that these properties are undecidable independently on the decidability of the word problem. In particular, we proved that every one-relator monoid has homotopy finiteness property. We studied finite presentability of monoids and gave a finite presentation of the braid inverse monoid.

  • Research Products

    (18 results)

All Other

All Publications (18 results)

  • [Publications] T.Shioda, Y.Umezu: "On Neron's construction of curves with high rank I"Comment.Math.Univ.St.Pauli. 48. 35-47 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Umezu: "On Neron's construction of curves with high rank II"Comment.Math.Univ.St.Pauli. 48. 169-179 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Kobayashi, F.Otto: "Repetitiveness of languages generated by morphisms"Theoret.Comp.Sci.. 130. 337-378 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Kobayashi: "Finite homotopy bases of one-relator monoids"J.Algebra. 229. 547-569 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Kobayashi, M.Katsura, K.Shikishima-Tsuji: "Termination and derivational complexity of confluent one-rule string-rewriting systems"Theoret.Comp.Sci.. 262. 583-632 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Kobayashi, F.Otto: "On homotopical and homological finiteness conditions for finitely presented monoids"Intern.J.Algebra Comp.. 11. 391-403 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] V.Diekert, Y.Kobayashi: "Some identities related to automata, determinants and Mobius functions, in : Algebraic Engineering"World Scientific(担当部分). 330-349 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Kobayashi: "Homotopy reduction systems for monoid presentations II : Guba-Sapir reduction and homotopy modules in : Algorithmic problems in groups and semigroups"Birkhauser(担当部分). 143-159 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] M.Katsura, Y.Kobayashi, F.Otto: "Undecidability results for monoids with linear-time decidable word problems, ISAAC2000 in : Lect Notes in Comp.Sci"Springer(担当部分). 278-289 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T. Shioda and Y. Umezu: "On Neron's construction of curves with high rank I"Comment. Math. Univ. St. Pauli. 48. 35-47 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y. Umezu: "On Neron's construction of curves with high rank II"Comment. Math. Univ. St. Pauli. 48. 169-179 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y. Kobayashi and F. Otto: "Repetitiveness of languages generated by morphisms"Theoret. Comp. Sci.. 130. 337-378 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y. Kobayashi: "Finite homotopy bases of onerelator monoids"J. Algebra. 229. 547-569 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y. Kobayashi, M. Katsura and K. Shikishima-Tsuji: "Termination and derivational complexity of confluent one-rule string-rewriting systems"Theoret. Comp. Sci.. 262. 583-632 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y. Kobayashi and F. Otto: "On homotopical and homological finiteness conditions for finitely presented monoids"Intern. J. Algebra Comp.. 11. 391-403 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] V.Diekert and Y. Kobayashi: "Some identities related to automata, determinants and Mobius functions, in : Algebraic Engineering"World Scientific. 330-349 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y. Kobayashi: "Homotopy reduction systems for monoid presentations II : Guba-Sapir reductionand homotopy modules, Algorithmic problems in groups and semigroups"Birkhauser. 143-159 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M. Katsura, Y. Kobayashi and F. Otto: "Undecidability results for monoids with linear-time decidable word problems, ISAAC2000, Lect Notes in Comp. Sci. no.1969"Springer. 278-289 (2000)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2003-09-17  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi