Timeline for Permutations which avoid consecutive entries of the form (m,m+1)
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 15, 2018 at 16:33 | vote | accept | sayantan dasgupta | ||
Jan 15, 2018 at 9:59 | comment | added | sayantan dasgupta | Yeah thank you. I have the book " Discrete and combinatorial mathematics" by Grimaldi. I've read a few pages of it and am quite enjoying it | |
Jan 15, 2018 at 9:57 | comment | added | Per Alexandersson | @sayantandasgupta try perhaps Enumerative Combinatorics I by R. Stanley, or the combinatorics book by Grimaldi. A basic understanding of generating functions and how to produce these from recurrences is what is needed, and from there, solutions to problems as above becomes standard (the above could be a finals problem on a graduate course in enumerative combinatorics). | |
Jan 15, 2018 at 3:57 | comment | added | Gjergji Zaimi | @sayantandasgupta I believe math.stackexchange has a wealth of introductory enumerative problems, either with recurrences or bijections, so I suggest browsing their "recurrence relatons" tag. Good luck! | |
Jan 15, 2018 at 3:54 | comment | added | sayantan dasgupta | Thanks. Can you suggest me some good sites for learning more about recurrence related counting problems | |
Jan 15, 2018 at 3:50 | history | answered | Gjergji Zaimi | CC BY-SA 3.0 |