Alexander Burstein's Lovely Combinatorial Proof of John Noonan's Beautiful Formula that the number of n-permutations that contain the Pattern 321 Exactly Once Equals (3/n)(2n)!/((n-3)!(n+3)!)
From MaRDI portal
Publication:6228482
arXiv1110.4379MaRDI QIDQ6228482
Publication date: 19 October 2011
This page was built for publication: Alexander Burstein's Lovely Combinatorial Proof of John Noonan's Beautiful Formula that the number of n-permutations that contain the Pattern 321 Exactly Once Equals (3/n)(2n)!/((n-3)!(n+3)!)
