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

TL;DR

This paper explores the properties of enhanced principal rank characteristic sequences (epr-sequences) of symmetric matrices over finite fields, specifically extending previous work from field  to , and reveals connections to Ramsey and coding theories.

Contribution

It introduces the classification of epr-sequences over  and investigates their combinatorial properties, expanding understanding from  to  and linking to other mathematical areas.

Findings

Classification of epr-sequences over 

Connections between epr-sequences, Ramsey theory, and coding theory

Extension of previous  results to 

Abstract

The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix $B \in \mathbb{F}^{n \times n}$ is defined as $\ell_1 \ell_2 \cdots \ell_n$, where $\ell_j \in \{\tt{A}, \tt{S}, \tt{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 $\mathbb{F}=\mathbb{F}_2$, we initiate a study of the case $\mathbb{F}=\mathbb{F}_3$. Moreover, epr-sequences over finite fields are shown to have connections to Ramsey theory and coding theory.