This is a multi-part message in MIME format. --------------FE9CD54CABED6E2725254723 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit
During work om my math thesis i have come across a strange expression that it seems to be possible to simplify quite a lot. When you count the number of complete exceptional sequences over the hereditary algebra An you get the expression I for convenience have attached in a Sci.Word file. The original hypothesis was however that I would get (n+1)^(n-1), and when you test the two expressions in maple you find that the difference is 0 at least up to n=11. I would like to get a proof that the two expressions are equal for all positive integers, and, no, you can not use the binomial rule because the terms x and y in (x+y)^n change for each term inside the expression.