We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different language...
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
We show that given any polynomial ring R over a field and any ideal J R which is generated by three cubic forms, the projective dimension of R/J is at most 36. We also settle the...