• شماره ركورد كنفرانس
    3934
  • عنوان مقاله

    An E_x000E_cient Algorithm to Compute H-bases

  • پديدآورندگان

    Hashemi Amir amir.hashemi@ipm.ir Isfahan University of Technology; , Javanbakht Masoumeh masumehjavanbakht@gmail.com Hakim Sabzevari University;

  • تعداد صفحه
    4
  • كليدواژه
    Polynomial ring , Gr¨obner bases , Syzygy module , Minimal generating set , H , bases.
  • سال انتشار
    1395
  • عنوان كنفرانس
    بيست و پنجمين سمينار جبر ايران
  • زبان مدرك
    انگليسي
  • چكيده فارسي
    H-bases are a particular kind of bases for polynomial ideals, characterized by the fact that their homogeneous leading terms are a basis for the associated homogeneous ideal. In the computation of H-bases, the main obstacle is to determine a system of generators for each under consideration syzygy module. The only known method to doing so, is based on the Gr¨obner bases computation which makes the computation of H-bases far from e ciency. In this paper, we present and study an e cient method to compute H-bases without relying on the Gr¨obner bases calculation.
  • كشور
    ايران