Timeline for An Pure intriguing counting problem of index sets
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2012 at 21:59 | history | edited | Michael Hardy | CC BY-SA 3.0 |
added 2 characters in body
|
| Aug 11, 2012 at 6:31 | comment | added | WangYao | Hi Gerhard. Thanks very much about your links.It seems that I need time to dig it out. | |
| Aug 11, 2012 at 2:12 | comment | added | Gerhard Paseman | Here is the first in a chain of links that might be of interest. mathoverflow.net/questions/104028/string-possible-combinations/… . My answer has a comment from me which contains the next link. My guess is that parking functions and Gessel-Viennot (somewhere after the third link) will be relevant to your problem. Gerhard "Ring Around The Web References" Paseman, 2012.08.10 | |
| Aug 10, 2012 at 22:04 | comment | added | Gerhard Paseman | Your last constraint expression might be easier to grok if written as n^2+1-(n-j). Also, there have been a few questions asked on related matters recently on specialized combnations, which is what your sets appear to be. You might check those out. (Link to be provided later.) Gerhard "Search Engines Stole My Memory" Paseman, 2012.08.10 | |
| Aug 10, 2012 at 18:16 | history | asked | WangYao | CC BY-SA 3.0 |