One aim of symbolic computation in the
area of differential equations is to find closed form solutions.
In this talk, we'll discuss algorithms and applications
for maximally overdetermined systems of linear partial
differential equations. For instance, we'll see how
to find polynomial and rational solutions on the computer.
Some of the underlying tools are Grobner bases and
homological algebra, which are subjects of frequent
study by the computational algebraists in our department.