Algorithm for computing differential char sets efficiently


Cancan M. , Afzal F., Maqbool A., Afzal D.

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, cilt.23, ss.1203-1216, 2020 (ESCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 23 Konu: 6
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1080/09720529.2020.1809114
  • Dergi Adı: JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
  • Sayfa Sayıları: ss.1203-1216

Özet

In order to triangularize differential polynomial sets and systems, we can use char sets method by Ritt and Wu. This method uses differential pseudo division for elimination of variables successively. In this paper, we have proved that Differential Pseudo division can be replaced by important reductions for computing differential char sets. An algorithm is presented for computing the differential char sets efficiently. This algorithmic scheme has been executed with precise admissible differential reductions. Primary results demonstrate that this new algorithm accomplishes better results than char set algorithm that are based on differential Pseudo division.