arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.3250cs.ITmath.IT
收藏

关于有限域上随机矩阵的秩

On the rank of random matrices over finite fields

Daniel Salmond, Alex Grant, Ian Grivell, Terence Chan

摘要:

本文给出了随机有限域矩阵满秩概率的一个新的下界,其中若干已知位置的元素同为零,其余元素在域上均匀地相互独立地选取.主要成分是一个结果,表明将附加元素约束为零不能导致更高的满秩概率。然后通过将元素“归零”来产生块对角矩阵,其满秩概率可以精确计算。的界限被证明是至少一样紧,可以严格严格比现有的界限。

英文摘要:

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly over the field. The main ingredient is a result showing that constraining additional elements to be zero cannot result in a higher probability of full rank. The bound then follows by "zeroing" elements to produce a block-diagonal matrix, whose full rank probability can be computed exactly. The bound is shown to be at least as tight and can be strictly tighter than existing bounds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑