A new algorithm for computing regular representations for radicals of parametric differential ideals

: The regular representation of the radical of a differential ideal has various applications such as solving the membership problem, computing Taylor expansion of solutions, finding the Lie symmetries, and solving dynamical systems. Presently, there is no algorithm giving all regular representations for all possible values of the parameters for a polynomial differential ideal with parametric coefficients. In this article, we propose a new algorithm that computes all different regular representations with respect to all possible states of the parameters. Also, we present an efficient criterion to reduce some ineffectual computations. Implementing the algorithm in Maple and several examples reported in this article demonstrate the high efficiency of the algorithm.


Introduction
Differential algebra was initially founded in the early 20th century to study a system of ordinary or partial differential equations, from a totally algebraic point of view. This mathematical approach was developed by Ritt (1950) and Kolchin (1973) who also prepared a computational algebraic tool for solving partial differential equation (PDE) systems. The well-known Rosenfeld-Gröbner algorithm is one of the most important algorithms in this regard, which indeed can be considered as the beginning point of the computational differential algebra. This algorithm analyses a ABOUT THE AUTHOR The first author of this article is Shahnaz Fakouri. She is a Ph.D. student of pure mathematics in the computational algebra tendency at Damghan University, Iran. This article is a result of her Ph.D. thesis. Other authors are Dr. Sajjad Rahmany and Dr. Abdolali Basiri. They are associate Professors of Computer Algebra at the University of Damghan, Iran. They received the Ph.D degrees at University of Pris 6. Their research interests include Gröbner basis and solving polynomials systems. They published more than 30 papers in international journals such as Theoretical Computer Science, Soft Computing, Information Sciences, JIFS and conference proceedings.

PUBLIC INTEREST STATEMENT
Studying differential equations from an algebraic point of view is the main goal of the differential algebra. Computing regular representations for differential ideal generated by differential systems is an algebraic tool in this field that analyses the solutions of polynomial differential systems. In this article, we present a new algorithm that computes regular representations for parametric differential systems that has various applications such as biological modeling, dynamical systems, etc.
polynomial differential system in a differential algebraic mode and gives a regular representation of the radical differential ideal generated by this system. The algorithm has various applications for instance in Geometry (Sabzevari, Hashemi, Alizadeh, & Merker, 2016), finding the Lie symmetries of differential equations (Hydon, 2000) and theory of differential equations (Mansfield & Clarkson, 1997). The Rosenfeld-Gröbner algorithm was first described by Boulier (1994) and improved by Boulier, Lazard, Ollivier, and Petitot (1995) thereafter. The input of this algorithm is a polynomial differential system in a differential ring with constant coefficients while its output is a representation of radical of the differential ideal, generated by the input system, as a finite intersection of radical differential ideals. The computed representation allows testing membership in the radical of the ideal generated by given system and also computing Taylor expansions of solutions of this system (Boulier, Lazard, Ollivier, & Petitot, 2009).
As mentioned before, the input of this algorithm is a differential system with constant coefficients. However, sometimes, it is necessary to determine such a representation for a parametric differential system; a differential system that its coefficients depend on some parameters. For instance this system can be used for biological modelling (Boulier, 2007), dynamical systems (Harrington & Van Gorder, 2017;Jauberthie, Trave-Massuyes, & Verdiere, 2016) and so on. In this regard, even if the coefficients field is extended by these parameters, the output of the Rosenfeld-Gröbner algorithm may not include all of the representations for all possible values of the parameters. For example, consider the following differential system in which its coefficients depend on the parameters a; b and c. P 0 ¼ a @ 2 @x@y vðx; yÞ 2 þ 3buðx; yÞ ¼ 0 @ 3 @x@y 2 vðx; yÞ @ @x uðx; yÞ À Á À vðx; yÞ ¼ 0 c @ @x vðx; yÞ To simplify, we use indices: In the extended coefficient field by the parameters, with respect to the orderly ranking with considering u 0 v and the graded lexical order y < x, the output of the Rosenfeld-Gröbner algorithm for the system P 0 is empty. But, is this system really inconsistent for arbitrary values of the parameters? It can be easily shown that the answer is "no". This system has the following representations for different values of the parameters a and b. When b ¼ 0 and aÞ0 we have: ffiffiffiffiffiffiffi ffi ½P 0 p ¼ ½v; u þ 3 and also when b ¼ a ¼ 0 and cÞ0 we have: ffiffiffiffiffiffiffi ffi ½P 0 p ¼ ½cv þ u x u y;y ; u x u x;y;y þ u x;x u y;y À u À 3 : fu x g 1 \ ½v; u þ 3 Presently, there is no context which introduces an algorithm giving all representations for all possible values of the parameters for a parametric system. Although, Boulier (2018) explains how the Rosenfeld-Gröbner algorithm can manage different types of the parameters .This context was written from our demand and it was never published.
The main goal of this article is to obtain the distinct representations for all possible values of the parameters. According to this viewpoint, a case is a set of polynomial equalities and inequalities over the parameters accepting the same representation. Here, we present an algorithm with branching style that its root vertex corresponds to the inputted system. The inputted system is a differential system whose coefficients depend on some parameters. This algorithm branches some vertices according to possible values of the parameters and outputs the distinct representation depending on these values of parameters. Moreover, in this algorithm we apply a new criterion which can detect and delete a chain of the redundant computations.
The remainder of this article is organised as follows. We give an introduction to differential algebra in Section 2. In Section 3, we briefly describe the Rosenfeld-Gröbner algorithm. Section 4 describes the new algorithm to decompose a parametric differential system. Finally, some examples are presented in Section 5.

Differential algebra
In this section, we review some preliminaries concept of differential algebra. More details can be found in (Hubert, 2000;Kolchin, 1973;Ritt, 1950;Sit, 2002). In the following, we assume that K is a field of characteristic zero.
Definition 2.1. A differential ring is a commutative ring R associated with a finite set of derivations δ 1 ; . . . ; δ m f g , which commute with each other and satisfy the following equalities: where 1 i m and r 1 ; r 2 2 R. In a special case, if m ¼ 1, then R is called an ordinary differential ring and if m > 1, then R is called a partial differential ring.
A differential ideal I of R is an ideal which is also closed under the action of derivations; i.e., δ i ðIÞ I for each 1 i m.
We will use Θ to denote the free multiplicative semi-group generated by the set δ 1 ; . . . ; δ m f g . It is easy to see that the elements of Θ, which are called derivative operators of R, are in the form of For each S & R, the smallest subset of R containing S, which is also stable under the action of Θ is denoted by: ΘS ¼ fθðsÞ j θ 2 Θ; s 2 Sg: We denote by ðSÞ (resp:½S) the smallest algebraic (resp. differential) ideal of R containing S. If R 0 is a subring of R, using R 0 ½S (resp. R 0 S f g), we denote the smallest algebraic (resp. differential) subring of R 0 containing S and R 0 that are generated by S on R 0 . As a simple fact, we apply an algebraic approach on differential ideals and subrings due to ½S ¼ ðΘSÞ and R 0 S f g ¼ R 0 ½ΘS. Now, we present the following definition which has an important role in the main concepts.
Definition 2.2. Consider a differential ideal I and a set of differential polynomials S from R. The saturation ideal of I by S is defined as follows: I : S 1 ¼ fp 2 Rjsp 2 I for some s 2 S 1 g; where S 1 denotes the smallest multiplicative family of R which contains S.
In the sequel, we will deal with a differential polynomial ring R ¼ K u 1 ; . . . ; u n f gthat is a differential ring generated by U ¼ u 1 ; :::; u n f gon K, where K is a differential field that for each θ in Θ and each constant k in K we have θðkÞ ¼ 0. In this ring, each u i (resp. θu i ) is called an indeterminate (resp. a derivative).
In the next definition, we recall the concept of ranking that will be used to compare derivatives. In fact, rankings in a differential ring play a similar role of monomial orderings in polynomial rings. Definition 2.3. Let R be a differential polynomial ring. Each ranking over R is an ordering 0 over ΘU such that for each derivation θ and v; w 2 ΘU: • v 0 θv, and Orderings are divided into two different types: Rankings for which ordðθÞ < ordðϕÞ implies that θðvÞ 0 ϕðwÞ, which are called orderly, and those for which v 0 w concludes θv 0 ϕw, which are called elimination rankings. Now, we introduce some terms of differential polynomials. Let p 2 R ¼ K u 1 ; :::; u n f gbe a differential polynomial and 0 be a ranking over ΘU. The leader ldðpÞ of p is the highest derivative appearing in p with respect to R. If ldðpÞ ¼ u and d is the degree of u in p, then the initial i p 2 R is defined to be the coefficient of u d in p. The separant s p of p is the polynomial @p=@u. The rank of p is the monomial u d , which is denoted by rank p. The rank of a set of polynomials is similarly the set of ranks of the elements of the set.
subsets of RnK. Assume that, rank p i 0 rank p iþ1 and rank p 0 j 0 rank p 0 jþ1 for all i < m, j < m 0 . The set A is said to be of lower rank than A 0 , when either there exist some i minðm; m 0 Þ such that rank p i < rank p 0 i and rank p j ¼ rank p 0 j for 1 j < i or m > m 0 and rank p j ¼ rank p 0 j for 1 j m 0 . Two sets of polynomials that none of them is of lower rank than the other one are called of the same rank.
For any subset A of RnK, we denote the set of the initials (resp. separants) of the elements of A by I A (resp. S A ). Let now A denotes the set of all the power products of the initials and the separants of the elements of A.
Definition 2.4. Consider two differential polynomials p and q in the differential ring R ¼ K u 1 ; . . . ; u n f gand let u d be the rank of p. Polynomial q is called partially reduced with respect to p if no proper derivative of u appears in q. Also, if the degree of q in u is less than d we say that q is algebraically reduced with respect to p. A polynomial q is called reduced with respect to the polynomial p if q is partially and algebraically reduced with respect to p.
A set A & RnK is said to be autoreduced if any element of A is reduced with respect to any other element of the set. Also if the elements of A are pairwise partially reduced and the leaders of them are pairwise different, we say that A is differentially triangular.
One of the important procedures in the context of differential algebra is the way of reducing a differential polynomial with respect to an autoreduced set. Let p be a differential polynomial and A ¼ p 1 ; . . . ; p s f gbe an autoreduced set. By Ritt's algorithm of reduction (see Kolchin 1973), there exists a differential polynomial r and non-negative integers b 1 ; . . . ; b s and a 1 ; . . . ; a s such that r ; i a 1 p 1 Á Á Á i as ps s b 1 p 1 Á Á Á s bs ps p ðmod½AÞ; where i , and s , denote the initial and the separant of p , respectively, and r is reduced with respect to A. If r is just partially reduced with respect to A, then we can write r ; s b1 p 1 Á Á Á s bs ps p ðmod½AÞ: For the simplicity in notations, we denote r by p fullrem A (resp. p prem A), if r is reduced (resp. partially reduced) with respect to A. Now, we explain the concept of Δ À polynomial of two differential polynomials, which plays a similar role to S À polynomial in algebraic polynomials ring. Before that, we need to know the definition of critical pairs (Boulier et al., 2009). Also, we should state that for each derivative θu and ϕu of the same differential indeterminate u, the least common derivative is denoted by lcdðθu; ϕuÞ, which equals to lcmðθ; ϕÞu.
Definition 2.5. A set p 1 ; p 2 f gof differential polynomials is said to be a critical pair if p 1 and p 2 are distinct and the leaders of them have common derivatives. If A is a set of differential polynomials then critical À pairsðAÞ denotes the set of all the pairs which can be formed between any two elements of A.
Definition 2.6. Let p 1 ; p 2 f g be a critical pair and denote θ 1 u ¼ ldðP 1 Þ, θ 2 u ¼ ldðp 2 Þ and θ 12 u ¼ lcdðθ 1 u 1 ; θ 2 u 2 Þ. The Δ À polynomial Δðp 1 ; p 2 Þ of p 1 and p 2 is defined as follows: If A is a subset of R, then the set of all Δ À polsðAÞ denotes the set of all possible Δ À polynomials which can be formed between any two elements of A.
Here, we give the definition of solved pairs, which was defined earlier by Boulier et al. (2009) for the first time.
Definition 2.7. A critical pair p 1 ; p 2 f gis said to be solved by a differential system of equations and inequations A ¼ 0 and SÞ0 if there exists a derivative v < lcdðp 1 ; p 2 Þ such that: One can apply the following criterion (lemma 6 in Boulier et al., 2009) to recognise the solved pairs: Lemma 2.8. Let p 1 ; p 2 f gbe a critical pair such that ldp 1 Þldp 2 . If Δðp 1 ; p 2 Þ is reduced to zero by a set A and S is a set of inequations containing H A ; then, the critical pair p 1 ; p 2 f g is solved by the system A ¼ 0 and SÞ0. Definition 2.9. Let R ¼ K U f g be a differential polynomial ring and 0 be a ranking over ΘU. A differential system of equations A ¼ 0 and inequations SÞ0 of R is said to be a regular differential system with respect to 0 if: • A is differentially triangular • S contains the separants of the elements of A and it is partially reduced with respect to A • All critical pairs of A are solved by the system A ¼ 0 and SÞ0 (coherent property) The differential ideal ½A : S 1 is called the regular differential ideal defined by the system. Moreover, the system is considered inconsistent if ½A : S 1 equals to R, and consistent otherwise.
At the end of this section, let us mention some properties and a brief explanation of Gröbner bases for an algebraic ideal (see Becker & Weispfenning, 1991;Cox, Little, & O'Shea, 1992), which is applied in the next sections. Consider R ¼ K½x 1 ; . . . ; x n as a polynomial ring and 0 x as a term ordering over R. Note that the reduction in the polynomial ring is algebraic and the remainder of the reduction is denoted by algrem.
If G is a Gröbner basis with respect to 0 x for ideal I ¼ ðAÞ then we have: • I ¼ ðGÞ, which means that G is also a generator for the ideal I.
• If G is also reduced, then it is unique with respect to the ordering 0 x ; in other words, for an ideal, there is just one reduced Gröbner basis with respect to certain ordering.
• The ideal I is equal to R (the system A ¼ 0 has no answer) if and only if 1 2 G or the reduced Gröbner basis is equal with the set 1 f g.
Note that having the following lemma (Boulier et al., 2009), even if the set of variables is infinite, Gröbner bases can be computed of finitely generated ideals of K½x 1 ; :::; x n . So, we can compute Gröbner bases of (non-differential) ideals in differential polynomial rings.
Lemma 2.10. Let I be an ideal of a ring R and x be transcendental over R. If φ denotes the canonical ring homomorphism φ : R ! R½x, then φ À1 ðφðrÞÞ ¼ r.

Consider the system of equations
To get a Gröbner basis G of ðAÞ : S 1 , we just need to run the following steps: (1) Introduce a new set z 1 ; :::; z m f gof unknowns and rewrite each inequation h i Þ0 as h i z i ¼ 1.
(2) Compute a Gröbner basis G 0 of the ideal generated with the set p 1 ; . . . ; p n ; h 1 z 1 À 1; . . . ; h m z m À 1 f g with respect to any ordering that eliminates the z's.
(3) Construct G by selecting the members of G 0 that do not involve z i for any 1 i

Rosenfeld-Gröbner algorithm
In this section, we describe the Rosenfeld-Gröbner algorithm (see Boulier et al., 2009 for more details). Let P 0 & R, the Rosenfeld-Gröbner algorithm decomposes the differential radical ideal ffiffiffiffiffiffiffi ffi ½P 0 p as a finite intersection of regular differential ideals P i 's: Each regular differential ideal P i is presented by two sets of differential polynomial equations A i and differential polynomial inequations S i such that P i ¼ ½A i : S 1 i . If G i is a Gröbner basis for the saturation ideal P i , so G i reduces to zero a differential polynomial p if and only if p belongs to P i . Although, the ideal membership problem is algorithmically undecidable (Umirbaev, 2016), this algorithm permits to test the membership in ffiffiffiffiffiffiffi ffi ½P 0 p .
This decomposition is not uniquely determined in general, not only because there might be redundant components (some of them may be contained in another) but also it depends on many choices made during its construction, such as the choice of ranking. The following theorem (Boulier et al., 2009) shows that there is such a decomposition for each system of differential polynomials.
Theorem 3.1. If P 0 ¼ 0, S 0 Þ0 is a differential system in a differential polynomial ring R, then it is possible to compute finitely many consistent regular differential systems This decomposition may contain components redundant w.r.t. Γ. Operations needed in this regard are addition, multiplication, differentiation and equality test with zero in the base field of R.
A lemma of D. Lazard (Boulier et al., 1995) shows particularly that the regular ideals ½A i : S 1 i are radical. The following theorem is a differential analogue to Hilbert's theorem of zeros (Kolchin, 1973).
Theorem 3.2. (Theorem of zeros) Let R ¼ K U f g be a differential polynomial ring over a differential field of characteristic zero and P be a differential ideal of R. A differential polynomial p vanishes on every solution of P in any differential field extension of K, if and only if p 2 ffiffiffi P p .
Corollary 3.3. A differential polynomial p vanishes on every solution of a system of polynomial differential equations and inequations A ¼ 0; SÞ0 if and only if p 2 ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi ½A : S 1 p .
Here, we give a brief exposition of the current version of the Rosenfeld-Gröbner algorithm, which is presented in (Boulier et al., 2009). The input of this algorithm is a differential system of equations and inequations with a ranking and the output is a set of differential regular ideals. Since a differential regular ideal is differentially triangular and coherent, the algorithm reduces each polynomial equation with respect to others and constructs possible Δ-polynomials, which can be formed between each pair of polynomials modulo processed polynomials. Then, the initials and the separants of the new polynomials are added to the set of inequations. Finally, to observe any solution, the current system is splitted by the following lemma which is a corollary of the theorem of zeros: Lemma 3.4. If A ¼ 0; SÞ0 is a differential system and p is a differential polynomial then, This process continues until all systems are regular. Eventually, by the following Rosenfeld's lemma (Rosenfeld, 1959), the consistent regular systems are detected and generated.
Theorem 3.5. (Rosenfeld's lemma) If A ¼ 0, SÞ0 is a regular differential system of a differential polynomial ring R for a ranking 0 then, every differential polynomial in ½A : S 1 that is partially reduced with respect to A, belongs to ðAÞ : S 1 . By Rosenfeld's lemma, 1 2 ½A : S 1 if and only if 1 2 ðAÞ : S 1 . It concludes that we can verify whether the regular differential system of equations A ¼ 0 and inequations SÞ0 is inconsistent, by verifying whether the reduced Gröbner basis of algebraic ideal ðAÞ : S 1 equals to 1 f g.
The complete sub-algorithm of this algorithm is based on two criteria which detect unnecessary pairs. These criteria are the analogues of the first and second Buchberger criteria (Buchberger, 1979) established in computing Gröbner bases for ideals.
Proposition 3.6. Let p and q be two differential polynomials in the one differential indeterminate u such that ldðpÞ ¼ θu and ldðqÞ ¼ ϕu. If they are linear, homogeneous, with constant coefficients, and lcdðθu; ϕuÞ ¼ θϕu, then Δðp; qÞ will be reduced to zero with respect to p; q f g.
Proposition 3.7. Let A ¼ 0 and SÞ0 be a differential system and ½p 1 ; p 2 ; p 3 be the triple of differential polynomials such that the separants of p i 's belong to S and they satisfy in conditions C: ðiÞ the leaders ldðp i Þ ¼ θ i u ð1 i 3Þ have common derivatives and are pairwise different, ðiiÞ lcdðθ 1 ; θ 3 Þ is a derivative of θ 2 and ðiiiÞ one of the following conditions holds: 1. θ i u is not a derivative of θ j u ðÞiÞj 2 p 1 < p 2 < p 3 or p 3 < p 2 < p 1 3. p 2 < p 1 < p 3 and degreeðp 1 ; θ 1 uÞ ¼ 1 4. p 1 < p 3 < p 2 and degreeðp 3 ; θ 3 uÞ ¼ 1 If the critical pairs p 1 ; p 2 f gand p 2 ; p 3 f gare solved by A ¼ 0 and SÞ0, then the critical pair p 1 ; p 3 f g is also solved by this system. Now, we present the general form of the algorithm. In each quadruple hA; D; P; Si the sets A; P; S and D contain the equations already processed, the non processed equations, the inequations and the possible critical pairs of the processed equations that have to be solved. there exist a critical pair p; p 0 f g in D ? such that the triple ½p; q; p 0 satisfies in the conditions C of the Proposition 3.7 and lcdðldp; ldp 0 Þ is different from both lcdðldp; ldqÞ and lcdðldp 0 ; ldqÞ.

The statement of the main results
In this section, we deal with a differential system in which the coefficients depend on some parameters. We define the parametric differential ring as R ¼ K½α 1 ; :::; α t u 1 ; :::; u n f g. In this ring, the coefficients of the differential polynomials are in the ring K½α 1 ; :::; α t . Here, we present a parametric-Rosenfeld-Gröbner algorithm that its input is a system of equations and inequations in the parametric differential ring R. This algorithm outputs all distinct representations for all possible values of the parameters. These representations are recognised by the pair ðN; WÞ which contains equations and inequations in K½α 1 ; :::; α t . To be comparable, this pair is presented as Quasi-canonical which is defined as follows (Montes, 2002): Definition 4.1. The pair ðN; WÞis said to be k-quasi-canonical if it satisfies: • Nis the reduced Gröbner basis in QuotðKÞ½α 1 ; :::; α t where QuotðKÞ is the quotient field of K, with respect to the ordering 0 α .
• The inequations in W are algebraically reduced modulo N and are irreducible over k½α 1 ; :::; α t , where k is some intermediate field between QuotðKÞ and the algebraic closure K. They are normalised in a canonical form in order to be recognised when compared.
• The polynomials in N are square-free.
• If some polynomial in N factors, no factor of it belongs to W.
, then we say that this pair is inconsistent.
It is necessary to mention the terms zero and non-zero differential conditions of a polynomial p are the initial, separant or the factors of p that can be considered zero and non-zero, respectively. Each of these conditions is in K½α 1 ; :::; α t , it is called a parametric condition. Also, the terms new zero and new non-zero conditions are those which have not been considered yet. The Parametric-Rosenfeld-Gröbner algorithm has a tree structure that its root vertex corresponds to the sextuplet h[; [; P 0 ; S 0 ; [; [i, where P 0 ¼ 0 and S 0 Þ0 is the inputted system. This vertex is branched by the sub-algorithm Make-Tree I regarding zero and non-zero parametric and differential conditions of the polynomials of P 0 , which are obtained by the sub-algorithms Find-New-DiffCondition and Find-New-ParCondition, and some new vertices are created. Each vertex v corresponds to a sextuplet hA v ; D v ; P v ; S v ; N v ; W v i, where A v is the set of all processed polynomials, S v is the union of the set of inequations S 0 with the non-zero differential conditions of the polynomials of A v , D v is set of all critical pairs of A v that should be solved by the system A v ¼ 0 and S v Þ0, P v contains all polynomials that are not processed already, and N v and W v are respectively the zero and non-zero parametric conditions and are presented as k-quasi-canonical. The branching process continues until at a vertex v either the sub-algorithms Parametric-Consistency and Differential-Consistency recognise that the system A v ¼ 0 and S v Þ0 is inconsistent (in this case, the vertex v is called an inconsistent vertex), or both sets D v and P v are empty (in this case, the system A v ¼ 0 and S v Þ0 is regular and the vertex v is called a terminal vertex). Finally, the consistent regular systems are detected using Rosenfeld's lemma that was stated in the previous section and outputted. Each set of outputted regular systems that contains a given parametric conditions makes a regular representation corresponding to these parametric conditions. The general structure of the algorithm is as follows.
Algorithm 4.1. The Parametric-Rosenfeld-Gröbner algorithm Input: A differential system P 0 ¼ 0; S 0 Þ0 in K½α 1 ; :::; α t u 1 ; :::; u n f g , a ranking 0 and a total ordering 0 We now present the general structure of the recursive sub-algorithm Make-Tree I. The input of this sub-algorithm is a vertex v corresponding to the sextuplet hA v ; D v ; P v ; S v ; N v ; W v i. This algorithm creates some new branches when the sub-algorithm Find-New-ParCondition finds any new zero or non-zero parametric conditions. If there is not any parametric condition, then the sub-algorithm Make-Tree II is called for branching the vertex. Make-Tree II branches a vertex according to differential conditions of given polynomial. When any new vertex is created by these algorithms, then the algorithm Make-Tree I is called again and some other new branches are created. This process continues until the created vertex v is a terminal or inconsistent vertex.
This algorithm creates some new vertices according to zero and non-zero conditions. The first step is processing the parametric conditions of the given polynomial. The zero conditions are added one by one to the set of zero parametric conditions N v . Then, all processed polynomials A v that are not algebraically reduced with respect to the new zero condition are moved to the set of unprocessed polynomials P v . In this way, the new vertices are created and the algorithm Make-Tree I is called again for branching them. If the non-zero conditions set is not empty, then another new vertex is created by adding these conditions to the set W v and the subalgorithm Make-Tree II is called to process the differential conditions of the polynomial and branch the vertex.
The inputs of Make-Tree II are a vertex and a polynomial q. The general form of this algorithm is as follows: Algorithm 4.3. The Make-Tree II sub-algorithm Input: A vertex v and a polynomial q.
Output: Some new vertices.

Begin
Find-New-DiffConditionðq; S v Þ (It contains two set of zero and non-zero conditions.) if there is no new differential condition then Make-Tree I(Updateðv; q; [ÞÞ else if the set of non-zero conditions is empty then for each zero condition z do Make-Tree IðhA u ; D u ; P u ; S u ; N u ; W u iÞ end do else Make-Tree I(Updateðv; q; non zero conditionsÞÞ Let z 1 ; :::; z t f gbe the set of zero conditions Generally, in Make-Tree II there are two possibilities to create a new vertex: • When the polynomial q has some zero conditions, these conditions are imposed on the polynomial q. The result is a new polynomial with the zero conditions that are added to the set of non-processed polynomials P v and non-zero conditions that are added to the set of inequations S v . • When the polynomial q does not have any zero condition, the non-zero conditions (if there is any) are added to the set of inequations S v , the polynomial q is added to the set of processed polynomial A v and former members of the set A v , and the set D v is updated. This process is performed in the sub-algorithm update, which will be described later.
The parametric and differential conditions of a polynomial are obtained by the sub-algorithms Find-New-ParCondition and Find-New-DiffCondition, respectively. In the following, we explain these algorithms. The inputs of Find-New-ParCondition are a polynomial p with two sets of the zero parametric conditions N and the non-zero parametric conditions W. This algorithm checks the initial of the polynomial p according to old zero and non-zero conditions and returns new conditions, which can be considered zero and non-zero. Before presenting this algorithm, it should be noted that the set of irreducible polynomials that are factors of the polynomials of W is denoted by PriFactðWÞ, which is normalised in a canonical. Also, for each polynomial in K½α 1 ; :::; α t u 1 ; :::; u n f g , the notation pcoef ðpÞ denotes the product of the factors of p, which are in K½α 1 ; :::; α t .

Algorithm 4.4. The Find-New-ParCondition sub-algorithm
Input: A polynomial p and two sets of zero and non-zero conditions N and W.
Output: The refinement of p, Nand W and also, zero and non-zero conditions of p. Begin set p 0 :¼ p; sw :¼ true; N 0 :¼ N; w 0 :¼ W; and v d are the initial and the rank of p 0 , respectively) This algorithm checks the parametric coefficient of the initial of the polynomial p, pcoef ði p Þ. When pcoef ði p Þ is zero, it begins omitting iteratively the leading term of p. In the following, the parametric coefficient pcoef ði p Þ, which is in ffiffiffiffiffiffiffi N h i p , is added to N in order to improve N and the new Gröbner basis is recomputed. Then, W is also improved. When pcoef ði p Þ is not decidable regarding the set of zero and non-zero conditions N 0 and W 0 , then p is algebraically reduced with respect to N 0 . The algorithm now computes the set cond containing the irreducible factors of pcoef ði p Þ that are not in W and returns it. If this is empty, it means that pcoef ði p Þ is not zero and p does not have any new parametric condition. Otherwise, if p is not in K½α 1 ; :::; α t , so the set cond is as zero and non-zero parametric conditions of p. Otherwise, the set cond is as just zero parametric conditions of p, because the inputted polynomial of this algorithm comes from the set of equations and cannot be non-zero. Now, we present the sub-algorithm Find-New-DiffCondition that computes the zero and nonzero differential conditions of a polynomial. The inputs of this algorithm are a differential polynomial p and the set of inequations S v . This sub-algorithm verifies the polynomial p and its initial and separant and finds the new zero and non-zero conditions regarding the set of inequations S v . The following proposition which works as an efficient criterion in this algorithm helps to remove some ineffectual conditions. Proposition 4.2. Let p 2 R ¼ K U f g be a differential polynomial with the non-zero initial i p and the separant s p . Let also S be a set of differential inequations. If there is a member h 2 S such that it is reduced to zero with respect to p, then p cannot be zero.
Proof. Suppose not. Since for some h 2 S we have h fullrem p ¼ 0 (the initial and the separant of p are non-zero and the reduction by p is possible), then for some integers a i we have i a1 p s a 2 p ; 0 modð½pÞ, suggesting that for a non-zero polynomial b 2 R and a derivative θ 2 Θ, i a 1 p s a 2 p h ¼ bθp. Beacuse p is assumed to be zero, h should be zero as well, which contradicts the assumption.

End
In the Find-New-DiffCondition algorithm if the inputted polynomial p is a product of distinct non-constant factors, then each of these factors may be a zero condition. However, some of these factors that satisfy the hypothesis of Proposition 4.2 cannot be zero and they are removed from zero conditions. It should be noted that in this algorithm we use two obvious ways to find the factors of the inputted polynomial p. When p is a product of some polynomials, we consider these polynomials as its factors. For example, let the inputted polynomial be p ¼ avyux,y, such that a, u y and u x;y are three factors of p. Also, when the greatest common divisor (gcd) of all terms of p does not belong to K, we consider it as a factor of p. For example, if the inputted polynomial is p ¼ u 4 þ u, so u is the gcd of the two terms of p, suggesting that u and u 3 þ 1 are two factors of p.
Otherwise, the initial and the separant of p, provided not being in K, should be considered zero and non-zero. However, each of them that satisfies in the hypothesis of Proposition 4.2 will be removed from zero conditions. When a polynomial q satisfies in Proposition 4.2, it means that there is a polynomial h in the set of inequations S v such that it forces the polynomial q not be zero. In fact, this proposition plays an important role in the Parametric-Rosenfeld-Gröbner algorithm. As mentioned, this proposition decreases the number of zero conditions leads to a decrease in the number of ineffectual branches that will be made in the sub-algorithm Make-Tree II. Now, we explain the general structure of the sub-algorithm Update. The input of this algorithm is a vertex u corresponding to the sextuplet hA u ; D u ; P u ; S u ; N u ; W u i, a polynomial q and nonzero conditions. This algorithm adds the new non-zero conditions to the set of inequations S u and the new polynomial q to the set of processed polynomials A u . Then based on two analogues of Buchberger's criteria, it starts to make possible critical pairs between q and the other members of A u and adds them to the set of critical pairs D u . In this way, a new vertex that corresponds to the sextuplet hA v ; D v ; P v ; S v ; N v ; W v i is created.
Algorithm 4.6. The Update sub-algorithm Input: A vertex u, a polynomial q and its non-zero conditions.
A u j p is reduced w:r:t qg P v :¼ P u [ fp j p 2 A u s:th lcdðldq; ldpÞÞldq and p is not reduced w:r:t qg D 0 :¼ possiblecriticalpairs p; q f gj p 2 A u s:th p is reduced w:r:t q or lcdðldq; ldpÞ ¼ ldq f g there exist a critical pair p; p 0 f g in D u such that the triple ½p; q; p 0 satisfies in the conditions C of the Proposition 3.7 and lcdðldp; ldp 0 Þ is different from both lcdðldp; ldqÞ and lcdðldp 0 ; ldqÞ.
If a polynomial p in the set A v is not reduced with respect to the new polynomial q, then it exits from the set A v for reprocessing. Now, if ldp is not reduced with respect to ldq, then the critical pair p; q f g is added to the set D 0 to recognise more solved critical pairs by the analogues of the Buchberger criteria; otherwise, it is added to the set P v . The rest of the algorithm is based on two propositions 3.6 and 3.7.
Remark 1. This sub-algorithm is similar to the Complete sub-algorithm. For further information about this sub-algorithm, see the part 5:2 of the article (Boulier et al., 2009).
Finally, we present the sub-algorithms Parametric-Consistency and Differential-Consistency, which check the termination conditions in the Make-Tree I algorithm. Parametric-Consistency checks the sets of zero and non-zero parametric conditions N v and W v of a vertex v and returns FALSE if the pair ðN v ; W v Þ is inconsistent. Otherwise, it returns a k-quasi-canonical representation of the pair ðN v ; W v Þ according the definition 4.1. For more details and the proof of correctness of this algorithm, the reader can refer to (Montes, 2002). Now, we explain another sub-algorithm for checking the consistency of the vertices, which is called Differential-Consistency sub-algorithm. For each vertex v corresponding to the sextuplet i , if the output of the Parametric-Consistency is not FALSE, then this vertex will be refined by the k-quasi-canonical representation of N v and W v . After that, Differential-Consistency sub-algorithm checks the consistency of this vertex regarding the differential conditions. According to this algorithm, this vertex is inconsistent if either a non-zero element of K appears among the equations A v or 0 appears among the inequations S v , or the system A v ¼ 0 and S v Þ0 satisfies in the following proposition. As mentioned in subsection 5:5:2 of (Boulier et al., 2009), using this proposition is not very CPU expensive and can point out inconsistencies.
Otherwise, it refines the vertex by reducing the set of inequations S v with respect to the set of processed equations A v . Proposition 4.3. Let A ¼ 0 and SÞ0 be a system of equations and inequations such that the initials and the separants of the members of A belong to S 1 . If there is a polynomial h 2 S such that h is reduced to 0 with respect to A, then the system A ¼ 0 and SÞ0 is inconsistent.
Proof. Let A ¼ p 1 ; :::; p t f gand for some h 2 S we have h fullrem A ¼ 0. Then, for some integers a i and b i we have i a 1 p 1 Á Á Á i at pt s b 1 p 1 Á Á Á s bt pt h ; 0 ðmod ½AÞ. Thus, for some non-zero polynomials q i and derivatives θ i 2 Θ we can write: Since for each i, θ i p i ¼ 0 and the coefficient of h is non-zero, h should be zero and so the system A ¼ 0 and SÞ0 is inconsistent.
Algorithm 4.8 The Differential-Consistency sub-algorithm Output: FALSE, if the system A v ¼ 0 and S v Þ0 is inconsistent and the refinement of v, otherwise.
Begin if A v \ KÞ[ then sub-algorithm, and makes new vertices with different parametric conditions. If this polynomial does not have any parametric condition, the Make-Tree II begins to branch the vertex by differential conditions of the polynomial and the parametric conditions of these new vertices are equal. So, it is sufficient that we show when a vertex v is branched by differential conditions of a polynomial, the radical ideal ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi ffi A v : S 1 v p equals to the intersection of radicals of saturation ideals corresponding to the created vertices. If the polynomial p is as a product of some polynomials, then Find-New-DiffCondition returns some zero conditions and Make-Tree II makes some new vertices by adding these conditions to the set of equations. According to the previous lemma, the radical of the saturation ideal of the system corresponding to the vertex v is equal to the intersections of radicals of saturation ideals corresponding to new vertices. Otherwise, Find-New-DiffCondition returns some conditions that should be considered zero and non-zero. In addition, according to Lemma 4.4, the radical of the saturation ideal of the system corresponding to the vertex v is also equal to the intersections of radicals of saturation ideals corresponding to the new vertices. So, the radical of the corresponding saturation ideal with the root vertex for each parametric condition is as the intersections of radicals of saturation ideals corresponding to terminal vertices with the same parametric conditions. Finally, since this ideals are regular and regular ideals are radical (Lazard's lemma, see Boulier et al., 1995), the claim of the theorem is proved.

Example
In this section, we present the output of the Parametric-Rosenfeld-Gröbner algorithm for several examples in the differential ring R ¼ Q½a; b; c; dðx; y; zÞ m; u; v; w f gconsidering the orderly ranking as w 0 v 0 u 0 m and elimination ranking as m 0 u 0 v 0 w for the graded lexical order z < y < x. The implementation of this algorithm in Maple is available at the address http://faculty.du.ac.ir/ rahmani/software. The output of this algorithm is in the form of a discussion about the distinct representations of given system as an intersection of regular ideals for different cases of values of parameters. As stated in section 5 of (Boulier, 2018), DifferentialAlgebra packege of Maple permits to define parameters and makes such decompositions.
First consider the parametric differential system P 1 , also known as Lorenz system (Harrington & Van Gorder, 2017), with the orderly ranking. Table 1 describes the discussion of decomposing of system P 1 for different values of the parameters a, b and c. As can be seen, when the parameter a is considered non-zero, we have the following representation for the radical of ideal ½P 1 for each arbitrary values of b and c: ffiffiffiffiffiffiffi ffi ½P 1 p ¼ ½au À av þ u x ; Àabu þ auw þ au þ au x þ u x þ u x;x ; Àabcu 2 þ au 4 þ acu 2 þ acuu x þ u 3 u x þ auu x;x À au 2 x þ cuu x þ cuu x;x þ uu x;x þ uu x;x;x À u 2 x À u x u x;x : fug 1 \ ½u; v; cw þ w x It is notable that if we substitute a ¼ 0 in this representation, then the first ideal will be inconsistent, suggesting that it is essential that this parameter is not zero. According to this table for the case a ¼ 0 we have another representation as follows: ffiffiffiffiffi P 1 p ¼ ½u x ; Àbu þ uw þ v þ v x ; bcu À u 2 v À cv À cv x À v x À v x;x : fug 1 \ ½u; v þ v x ; cw þ w x ; This representation is also independent of the values of b and c.
Now, consider the Genesio-Tesi system (Harrington & Van Gorder, 2017) that contains three ODE equations and the orderly ranking.
The output of the Parametric-Rosenfeld-Gröbner algorithm contains only one case meaning that for each value of the parameters a, b and c we have the same representation as follows: ffiffiffiffiffiffiffi ffi ½P 2 p ¼ ½v À u x ; w À u x;x ; u 3 þ au þ bu x þ cu x;x À u x;x;x For arbitrary values of a, b and c the ideal of this representation is regular and consistent, so this representation can be used for all cases of the values of the parameters.
Finally, we discuss the following PDE system with the elimination ranking. Although this system has no physical significance, it has more distinct representations.
x;x v þ bu x;x v þ cu x ¼ 0 u x;y ¼ 0 au y;y À 1 ¼ 0 8 < : Table 2 presents the decomposing of this system. The table shows all distinct representations for all possible values of the parameters. It means that for not mentioned cases there is no regular representation for the radical of ideal ½P 3 . For instance, in the case a ¼ 0, the system P 3 is inconsistent so the output of Parametric-Rosenfeld-Gröbner algorithm does not contain this case.

Conclusion
We presented a new algorithm with branching style that examines the values of the parameters of the parametric differential system and returns all distinct regular representations for all possible Table 1. Discussion of the system P 1 (Lorenz system)