Timeline for about fixed points of permutations
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 28, 2011 at 9:31 | answer | added | Derek Holt | timeline score: 3 | |
| Jul 27, 2011 at 22:48 | vote | accept | CommunityBot | moved from User.Id=6976 by developer User.Id=69903 | |
| Jul 27, 2011 at 17:45 | answer | added | Gerhard Paseman | timeline score: 5 | |
| Jul 27, 2011 at 17:36 | comment | added | user6976 | @Gerhard: no, there are no restrictions on $k$, it can be arbitrary large. If you can construct a counterexample, it would be nice Although it would mean that this approximation of the original problem is not successful too, but nobody can guarantee that the answer to the original problem is positive either. | |
| Jul 27, 2011 at 17:15 | comment | added | Gerhard Paseman | If k is much much larger than n, say about the square of the size of the number of group words of length at most n generated by two letters, then I think the answer is no by a simple construction of a disjoint union of pieces. Do you intend to have restrictions on k? Gerhard "Ask Me About System Design" Paseman, 2011.07.27 | |
| Jul 27, 2011 at 16:58 | history | asked | user6976 | CC BY-SA 3.0 |