The classical discriminant D_n of degree n polynomials detects whether a given univariate polynomial f has a repeated root. It is itself a polynomial in the coefficients of f which, according to several classical results by Bézout, Sylvester, Cayley, and others, may be expressed as the determinant of a matrix whose entries are much simpler polynomials in the coefficients of f. This thesis is concerned with the construction and classification of such determinantal formulae for D_n.
In particular, all of the formulae for D_n appearing in the classical literature are equivalent in the sense that the cokernels of their associated matrices are isomorphic as modules over the associated polynomial ring. This begs the question of whether there exist formulae which are not equivalent to the classical formulae and not trivial in the sense of having the same cokernel as the 1 x 1 matrix (D_n).
The results of this thesis lie in two directions. First, we construct an explicit non-classical formula: the presentation matrix of the open swallowtail first studied by Arnol'd and Givental. We study the properties of this formula, contrasting them with the properties of the classical formulae.
Second, for the discriminant of the polynomial x^4+a_2x^2+a_3x+a_4 we embark on a classification of determinantal formulae which are homogeneous in the sense that the cokernels of their associated matrices are graded modules with respect to the grading deg a_i=i. To this end, we use deformation theory: a moduli space of such modules arises from the base spaces of versal deformations of certain modules over the E_6 singularity {x^4-y^3}. The method developed here can in principle be used to classify determinantal formulae for all discriminants, and, indeed, for all singularities.
| Identifer | oai:union.ndltd.org:TORONTO/oai:tspace.library.utoronto.ca:1807/17466 |
| Date | 16 July 2009 |
| Creators | Hovinen, Bradford |
| Contributors | Ragnar-Olaf, Buchweitz |
| Source Sets | University of Toronto |
| Language | en_ca |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0022 seconds