We bound from below the complexity of the top Chern class $\lambda _g$ of the Hodge bundle in the Chow ring of the moduli space of curves: no formulas for $\lambda _g$ in terms of classes of degrees 1 and 2 can exist. As a consequence of the Torelli map, the 0-section over the second Voronoi compactification of the moduli of principally polarized abelian varieties also cannot be expressed in terms of classes of degree 1 and 2. Along the way, we establish new cases of Pixton's conjecture for tautological relations. In the log Chow ring of the moduli space of curves, however, we prove $\lambda _g$ lies in the subalgebra generated by logarithmic boundary divisors. The proof is effective and uses Pixton's double ramification cycle formula together with a foundational study of the tautological ring defined by a normal crossings divisor. The results open the door to the search for simpler formulas for $\lambda _g$ on the moduli of curves after log blow-ups.

We discuss practical methods for computing the space of solutions to an arbitrary homogeneous linear system of partial differential equations with constant coefficients. These rest on the Fundamental Principle of Ehrenpreis–Palamodov from the 1960s. We develop this further using recent advances in computational commutative algebra.

Computer algebra removes much of the drudgery from mathematics; it allows users to formulate models by using the language of mathematics and to have those models evaluated with little effort. This symbolic form of representation is often thought of as being separate to dedicated computational programs such as Rietveld refinement. These dedicated programs are often written in low level languages; they are relatively inflexible in what they do and modifying them to change functionality in a small manner is often a major programming task. This paper describes a symbolic system that is integrated into the dedicated Rietveld refinement program called TOPAS. The symbolic component allows large functional changes to be made at run time and with a relatively small amount of effort. In addition, the system as a whole reduces the programming complexity at the developmental stage.

Lately, there have been numerous applications of computer algebra to special functions used in the various field of science and engineering. In this paper, we consider an efficient algorithm which generates velocity Jacobians for any class of general serial link manipulators in a compact form throughout the effective use of frame transformations. Compared with conventional techniques, a marked improvement of that capability is found in computer algebra applications to one class of a seven-joint manipulator. Together with finding of explicit solutions for joint rates, closed form arm solutions for the desired position of the hand are presented by relating the rotational motion of the elbow to a geometry problem.

A stochastic dynamical context is developed for Bookstein's shape theory. It is shown how Bookstein's shape space for planar triangles arises naturally when the landmarks are moved around by a special Brownian motion on the general linear group of invertible (2×2) real matrices. Asymptotics for the Brownian transition density are used to suggest an exponential family of distributions, which is analogous to the von Mises-Fisher spherical distribution and which has already been studied by J. K. Jensen. The computer algebra implementation Itovsn3 (W. S. Kendall) of stochastic calculus is used to perform the calculations (some of which actually date back to work by Dyson on eigenvalues of random matrices and by Dynkin on Brownian motion on ellipsoids). An interesting feature of these calculations is that they include the first application (to the author's knowledge) of the Gröbner basis algorithm in a stochastic calculus context.

This paper introduces the use of symbolic computation (also known as computer algebra) in stochastic analysis and particularly in the Itô calculus. Two related examples are considered: the Clifford-Green theorem on random Gaussian triangles, and a generalization of the D. G. Kendall theorem on the kinematics of shape.

The Clifford–Green theorem gives a remarkable characterization of the joint distribution of the squared-side-lengths of n independent Gaussian points in n-space, namely that this distribution is that of n independent exponential random variables conditioned to satisfy all the inequalities requisite if they are to arise as squared-side-lengths from a point-set in n-space. The D. G. Kendall theorem on the diffusion of shape identifies the statistics of the diffusion arising (under a time-change) as the shape of a triangle whose vertices diffuse by Brownian motion in 2-space or 3-space.

Symbolic Itô calculus is used to give a new proof of the Clifford-Green theorem, and to generalize the D. G. Kendall theorem to the case of triangles in higher-dimensional space whose vertices diffuse either according to Brownian motion or according to an Ornstein–Uhlenbeck process.