On Rank Problems for Subspaces of Matrices over Finite Fields

نویسندگان

  • John Sheekey
  • Roderick Gow
چکیده

In this thesis we are concerned with themes suggested by rank properties of subspaces of matrices. Historically, most work on these topics has been devoted to matrices over such fields as the real or complex numbers, where geometric or analytic methods may be applied. Such techniques are not obviously applicable to finite fields, and there were very few general theorems relating to rank problems over finite fields. In this thesis we are concerned mainly with constant rank subspaces of matrices over finite fields, with particular focus on two subcases: (1) constant rank subspaces of symmetric or hermitian matrices; and (2) constant full rank subspaces of matrices, which correspond to nonassociative algebraic structures known as semifields. In Chapter 1 we will introduce constant rank subspaces of matrices, and review the known results on the maximum dimension of such a subspace. In Chapter 2 we will recall the definition of a semifield, and illustrate how these algebraic structures are related to constant rank subspaces of matrices. In Chapter 3 we will prove a general theorem on subspaces of function spaces, and apply the results to obtain new upper bounds on subspaces of matrices, which are sharp in some cases. In Chapter 4 we will study primitive elements in finite semifields, and prove their existence for a certain family of semifields. In Chapters 5 and 6 we will introduce a construction for semifields using skew-polynomial rings. We will show how they are related to other known constructions, use this representation to obtain new results, and provide elegant new proofs for some known results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank properties of subspaces of symmetric and hermitian matrices over finite fields

We investigate constant rank subspaces of symmetric and hermitian matrices over finite fields, using a double counting method related to the number of common zeros of the corresponding subspaces of symmetric bilinear and hermitian forms. We obtain optimal bounds for the dimensions of constant rank subspaces of hermitian matrices, and good bounds for the dimensions of subspaces of symmetric and ...

متن کامل

Dimension Bounds for Constant Rank Subspaces of Symmetric Bilinear Forms over a Finite Field

Let V be a vector space of dimension n over the the finite field Fq, where q is odd, and let Symm(V ) denote the space of symmetric bilinear forms defined on V ×V . We investigate constant rank r subspaces of Symm(V ) in this paper (equivalently, constant rank r subspaces of symmetric n × n matrices with entries in Fq). We have proved elesewhere that such a subspace has dimension at most n if q...

متن کامل

Subspaces of Matrices with Special Rank Properties

Let K be a field and let V be a vector space of finite dimension n over K. We investigate properties of a subspaceM of EndK(V ) of dimension n(n − r + 1) in which each non-zero element of M has rank at least r and show that such subspaces exist if K has a cyclic Galois extension of degree n. We also investigate the maximum dimension of a constant rank r subspace of EndK(V ) when K is finite.

متن کامل

How Much Does a Matrix of Rank k Weigh?

Matrices with very few nonzero entries cannot have large rank. On the other hand matrices without any zero entries can have rank as low as 1. These simple observations lead us to our main question. For matrices over finite fields, what is the relationship between the rank of a matrix and the number of nonzero entries in the matrix? This question motivated a summer research project collaboration...

متن کامل

Computing the Rank of Large Sparse Matrices over Finite Fields

We want to achieve efficient exact computations, such as the rank, of sparse matrices over finite fields. We therefore compare the practical behaviors, on a wide range of sparse matrices of the deterministic Gaussian elimination technique, using reordering heuristics, with the probabilistic, blackbox, Wiedemann algorithm. Indeed, we prove here that the latter is the fastest iterative variant of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012