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
Determinants and ranks of random matrices over Zm
β Scribed by Richard P Brent; Brendan D McKay
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 739 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let Zm be the ring of integers modulo m. The m-rank of an integer matrix is the largest order of a square submatrix whose determinant is not divisible by m. We determine the probability that a random rectangular matrix over ~Ym has a specified m-rank and, if it is square, a specified determinant. These results were previously known only for prime m.
π SIMILAR VOLUMES
Let M = m ij be a random n Γ n matrix over GF(2). Each matrix entry m ij is independently and identically distributed, with Pr m ij = 0 = 1 -p n and Pr m ij = 1 = p n . The probability that the matrix M is nonsingular tends to c 2 β 0 28879 provided min p 1 -p β₯ log n + d n /n for any d n β β. Sharp
Let V be a vector space of dimension n β₯ 3 over GF(2). We are concerned with the incidence of k-dimensional subspaces in (k + 2)-dimensional subspaces where 1 β€ k β€ n -2. We compute here an upper bound for the rank of the associated incidence matrices over GF(2).