Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields

Abstract: The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix

B i n m a t h b b F^{n i m e s n}

is defined as

e l l_{1} e l l_{2} c d o t s e l l_{n}

, where

e l l_{j} i n t A, t S, t N

according to whether all, some but not all, or none of the principal minors of order

j

of

B

are nonzero. Building upon the second author's recent classification of the epr-sequences of symmetric matrices over the field

m a t h b b F = m a t h b b F_{2}

, we initiate a study of the case

m a t h b b F = m a t h b b F_{3}

. Moreover, epr-sequences over finite fields are shown to have connections to Ramsey theory and coding theory.

Cites Work

Cited In (2)

This page was built for publication: Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields