Recursive computation of adjoint conditions for a subtree of the
- a basis of the vector space V in the k-algebra of the
chart identified by IDP in which the adjoints are to be computed,
- the order of adjunction ( >= 1),
- the identifier of the chart in the chartHistory for which
the computation is to be done.
- The set of constraints for being an m-adjoint in V
with respect to the singularities which are resolved in the subtree
with root IDP.