Timeline for Counting Nearest Neighbors that Stay Nearest Neighbors after Random Rearrangements
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2012 at 12:16 | history | edited | Jesse W. Collins | CC BY-SA 3.0 |
deleted 32 characters in body; edited body
|
| Apr 5, 2012 at 19:04 | history | edited | Jesse W. Collins | CC BY-SA 3.0 |
added 1 characters in body; deleted 2 characters in body
|
| Apr 5, 2012 at 17:35 | history | edited | Jesse W. Collins | CC BY-SA 3.0 |
edited body
|
| Apr 5, 2012 at 16:52 | history | edited | Jesse W. Collins | CC BY-SA 3.0 |
added 281 characters in body; deleted 7 characters in body
|
| Apr 5, 2012 at 15:13 | history | edited | Jesse W. Collins | CC BY-SA 3.0 |
deleted 462 characters in body
|
| Apr 2, 2012 at 0:08 | vote | accept | Jesse W. Collins | ||
| Apr 2, 2012 at 0:07 | answer | added | Jesse W. Collins | timeline score: 4 | |
| Apr 1, 2012 at 23:48 | history | edited | Jesse W. Collins | CC BY-SA 3.0 |
edited title; edited title
|
| Jan 25, 2012 at 11:56 | comment | added | Jesse W. Collins | "THE DINNER TABLE PROBLEM" by Bengt Aspvall and Frank Liang looks at the cyclic permutation case. Robbins' work considered a linear permutation. These two sources seem quite useful; I'll edit the question based on the terms used therein. | |
| Jan 24, 2012 at 19:41 | history | edited | Jesse W. Collins |
edited tags
|
|
| Jan 24, 2012 at 19:35 | comment | added | Gerhard Paseman | You might add a reference-request tag, as that part of the question makes it (in my view) quite suitable for MathOverflow. Gerhard "Ask Me About System Design" Paseman, 2012.01.24 | |
| Jan 24, 2012 at 19:29 | comment | added | Jesse W. Collins | I was going to delete this post and move the question to Mathematics Stack Exchange, but as long as I continue to receive helpful comments I will leave it here. | |
| Jan 24, 2012 at 19:28 | comment | added | Jesse W. Collins | Thanks Richard, the reference there by D. P. Robbins, "The probability that neighbors remain neighbors after random rearrangements. Amer. Math. Monthly 87 (1980), 122-124." looks particularly helpful. | |
| Jan 24, 2012 at 18:11 | comment | added | Gerhard Paseman | Let me piggyback on this. mathoverflow.net/questions/31364/… has a couple of Shellsort analysis references which may provide you with good search terms. Further, if you find more on inversion density, I'd appreciate a comment to that effect. Gerhard "Ask Me About System Design" Paseman, 2012.01.24 | |
| Jan 24, 2012 at 16:42 | history | undeleted | Jesse W. Collins | ||
| Jan 24, 2012 at 16:34 | history | deleted | Jesse W. Collins | ||
| Jan 24, 2012 at 14:42 | comment | added | Richard Stanley | For the case of zero adjacent pairs, see OEIS A002464. Perhaps some of the references there will treat your more general question. | |
| Jan 24, 2012 at 12:42 | history | asked | Jesse W. Collins | CC BY-SA 3.0 |