Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields
Keyword(s):
Abstract The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix B ∈ 𝔽 n×n is defined as ℓ1ℓ2· · · ℓ n , where ℓ j ∈ {A, S, 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 𝔽 = 𝔽2, we initiate a study of the case 𝔽= 𝔽3. Moreover, epr-sequences over finite fields are shown to have connections to Ramsey theory and coding theory.
2017 ◽
Vol 32
◽
pp. 273-290
◽
Keyword(s):
Keyword(s):
1992 ◽
Vol 06
(13)
◽
pp. 773-784
◽
2014 ◽
Vol 17
(A)
◽
pp. 203-217
◽
2000 ◽
Vol 43
(2)
◽
pp. 379-393
◽