✦ LIBER ✦

The minimum rank problem over the finite field of order 2: Minimum rank 3

✍ Scribed by Wayne Barrett; Jason Grout; Raphael Loewy

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 590 KB
Volume: 430
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.08.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The rank of sparse random matrices over

The rank of sparse random matrices over finite fields

✍ Johannes Blömer; Richard Karp; Emo Welzl 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 2 views

Let M be a random n = n -matrix over GF q such that for each entry M in i j w x Ž . M and for each nonzero field element ␣ the probability Pr M s ␣ is pr q y 1 , where i j ## Ž . p slog n y c rn and c is an arbitrary but fixed positive constant. The probability for a Ž . matrix entry to be zero

On the ranks of Toeplitz matrices over f

On the ranks of Toeplitz matrices over finite fields

✍ Geoffrey L. Price; Glenn H. Truitt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Let T be a skew-symmetric Toeplitz matrix with entries in a ®nite ®eld. For all positive integers n let n be the upper n Â n corner of T, with nullity m n m n . The sequence fm n X n P Ng satis®es a unimodality property and is eventually periodic if the entries of T satisfy a periodicity condition.

On the Ranks of Skew Centrosymmetric Mat

On the Ranks of Skew Centrosymmetric Matrices over Finite Fields

✍ William C. Waterhouse 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 169 KB

On the distribution of rank of a random

On the distribution of rank of a random matrix over a finite field

✍ C. Cooper 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB 👁 2 views

A note on universally optimal matrices a

A note on universally optimal matrices and field independence of the minimum rank of a graph

✍ Liang-Hao Huang; Gerard J. Chang; Hong-Gwa Yeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

For a simple graph G on n vertices, the minimum rank of G over a field F, written as mr F (G), is defined to be the smallest possible rank among all n × n symmetric matrices over F whose (i, j)th entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. A symmetric integ

On the Minimum Linear Complexity of de B

On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields

✍ Peter A. Hines 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

It has been conjectured that over any non-prime finite field F p m and for any positive integer n, there exists a span n de Bruijn sequence over F p m which has the minimum possible linear complexity p nm&1 +n. We give a proof by construction that this conjecture is true.