Algorithm for computing differential char sets efficiently

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 reduct...

Full description

Saved in:
Bibliographic Details
Published inJournal of discrete mathematical sciences & cryptography Vol. 23; no. 6; pp. 1203 - 1216
Main Authors Cancan, Murat, Afzal, Farkhanda, Maqbool, Ayesha, Afzal, Deeba
Format Journal Article
LanguageEnglish
Published Taylor & Francis 17.08.2020
Subjects
Basic sets
Differential char set
Differential Pseudo division
Primary 93A30
Reduction
Secondary 49K15
Trinangularize
Online AccessGet full text
ISSN0972-0529
2169-0065
DOI10.1080/09720529.2020.1809114

Cover

More Information
Summary: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.
ISSN:0972-0529
2169-0065
DOI:10.1080/09720529.2020.1809114