首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   30篇
  免费   0篇
数学   1篇
物理学   29篇
  2018年   1篇
  2013年   1篇
  2011年   1篇
  1996年   1篇
  1991年   1篇
  1989年   8篇
  1988年   2篇
  1987年   6篇
  1986年   5篇
  1985年   4篇
排序方式: 共有30条查询结果,搜索用时 343 毫秒
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
We prove a lower bound expansion on the probability that a random ±1 matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second most likely, and so on, ways that a Bernoulli matrix can be singular; the most likely way is to have a null vector of the form e i ±e j , which corresponds to the integer partition 11, with two parts of size 1. The second most likely way is to have a null vector of the form e i ±e j ±e k ±e ? , which corresponds to the partition 1111. The fifth most likely way corresponds to the partition 21111. We define and characterize the “novel partitions” which show up in this series. As a family, novel partitions suffice to detect singularity, i.e., any singular Bernoulli matrix has a left null vector whose underlying integer partition is novel. And, with respect to this property, the family of novel partitions is minimal. We prove that the only novel partitions with six or fewer parts are 11, 1111, 21111, 111111, 221111, 311111, and 322111. We prove that there are fourteen novel partitions having seven parts. We formulate a conjecture about which partitions are “first place and runners up” in relation to the Erd?s-Littlewood-Offord bound. We prove some bounds on the interaction between left and right null vectors.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号