Timeline for Vanishing zeroes in matrix powers
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2017 at 20:14 | vote | accept | Hauke Reddmann | ||
| Dec 29, 2016 at 17:50 | history | edited | Federico Poloni | CC BY-SA 3.0 |
deleted 174 characters in body
|
| Dec 29, 2016 at 17:29 | answer | added | Douglas Zare | timeline score: 3 | |
| Dec 29, 2016 at 15:40 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 29, 2016 at 22:35 | comment | added | Gerry Myerson | See math.stackexchange.com/questions/450090/… for a detailed discussion and references. | |
| Nov 29, 2016 at 16:10 | comment | added | Benjamin Steinberg | Or try ac.els-cdn.com/S0024379502004147/… | |
| Nov 29, 2016 at 16:08 | comment | added | Benjamin Steinberg | If you are looking for the relation between the minimum power such that a primitive matrix is strictly positive and the size of the matrix, look at H. Wielandt, “Unzerlegbare, nicht negative Matrizen,” Math. Z., 52, 642–648 (1950). The paper arxiv.org/abs/1302.5793 summarizes some of the results. | |
| Nov 29, 2016 at 15:38 | comment | added | Serguei Popov | By the way, maybe the following strategy may be of use: since you can assume that all elements of the initial matrix are 0 or 1, you can brute-force this $m(n)$ on a computer at least for n=1,2,3,4,5 (maybe 6 too - there are $2^{n^2}$ matrices). And then look up that sequence on oeis.org | |
| Nov 29, 2016 at 15:24 | answer | added | Serguei Popov | timeline score: 1 | |
| Nov 29, 2016 at 14:33 | history | asked | Hauke Reddmann | CC BY-SA 3.0 |