Show simple item record

dc.contributor.advisorQuinlan, Rachel
dc.contributor.authorMcTigue, James
dc.date.accessioned2015-04-17T12:02:52Z
dc.date.available2015-04-17T12:02:52Z
dc.date.issued2015-03-23
dc.identifier.urihttp://hdl.handle.net/10379/4925
dc.description.abstractA partial matrix over a field is a matrix whose entries are either elements of the field or independent indeterminates. A completion of a partial matrix is any matrix that results from assigning a field element to each indeterminate. The set of completions of a partial matrix forms an affine subspace of the corresponding space of matrices. This thesis investigates partial matrices whose sets of completions satisfy particular rank properties - specifically partial matrices whose completions all have ranks that are bounded below and partial matrices whose completions all have the same rank. The maximum possible number of indeterminates in such partial matrices are determined and the partial matrices that attain these bounds are fully characterized for all fields. These characterizations utilize a duality between properties of affine spaces of matrices that are related by the trace bilinear form. Precise conditions (based on field order, rank and size) are provided to determine if a partial matrix whose completions all have the same rank r must possess a square partial sub-matrix of order r whose completions are all nonsingular. Finally a characterization of maximal nonsingular partial matrices is provided - a maximal nonsingular partial matrix is a square partial matrix each of whose completions has full rank, with the property that replacement of any constant entry with an indeterminate results in a partial matrix having a singular completion.en_US
dc.subjectPartial matricesen_US
dc.subjectMatricesen_US
dc.subjectCompletionen_US
dc.subjectRanken_US
dc.subjectMathematicsen_US
dc.titleCompletions of partial matricesen_US
dc.typeThesisen_US
dc.contributor.funderCollege of Arts, Social Sciences, and Celtic Studies, National University of Ireland, Galwayen_US
dc.local.noteA partial matrix is a matrix in which some entries are specified and some are not. A completion of a partial matrix is any matrix that results by specifying all of all entries. In this thesis we investigate partial matrices whose completions have special rank properties.en_US
dc.local.finalYesen_US
nui.item.downloads312


Files in this item

Attribution-NonCommercial-NoDerivs 3.0 Ireland
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. Please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

The following license files are associated with this item:

Thumbnail

This item appears in the following Collection(s)

Show simple item record