## Entry pattern matrices

##### View/Open

##### Date

2019-03-29##### Author

Ha Van, Hieu

##### Metadata

Show full item record##### Usage

This item's downloads:

**94**(view details)

##### Abstract

An entry pattern matrix (EPM for short) is a rectangular matrix in which each entry is an indeterminate. The same indeterminate may appear in multiple positions, but different indeterminates are independent. For a field F, an F-completion of an EPM is the matrix that results from assigning a specific value from F to each indeterminate that appears as an entry of the matrix. In this thesis, we are concerned with the set of F-completions of an entry pattern matrix which can be considered as a vector space whose dimension is equal to the number of distinct indeterminates appearing in the entry pattern matrix.
Chapter 1 presents some background to the content of Chapters 3, 4, and 5. We discuss linear subspaces of square matrices in which every non-zero element is either nonsingular, and in which every element is nilpotent. In particular, we consider bounds on the dimensions of such spaces.
In Chapter 2 we will introduce the concept of an entry pattern matrix and discuss some general properties.
In Chapter 3 we will consider the maximum rank of a completion of a given entry pattern matrix over a field F. We will show that this number can depend on the field under consideration, and focus on cases where it does. We will define the generic rank and the maximal completion rank of an entry pattern matrix and introduce the concept "EPM-rank-tight" field and prove that every finite field of characteristic less than 17, except F_2, is EPM-rank-tight.
In Chapter 4 we will introduce the concept of an F-almost-nonsingular EPM as an EPM whose completions are all nonsingular provided that their entries are not all equal. We present constructions for entry pattern matrices that are almost-nonsingular over the real, the rational fields and over finite fields, and obtain lower bounds for their numbers of indeterminates
In Chapter 5 we will give bounds for the number of indeterminates in n*n nilpotent entry pattern matrices over fields of positive characteristic. We also give the classification of such entry pattern matrices attaining the bounds.

##### Collections

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: