Talk:Permutation pattern

Good lead required

A good lead paragraph is needed for this page to explain what it is about, set it in a broader context, and to link the title to the content. In addition reliable sources are needed to verify the text. Bridgeplayer (talk) 01:24, 17 September 2009 (UTC)[reply]

I have added back the tags because the concerns have not been met. Since 'Permutation pattern' is the heading, the lead para needs to explain what this term means and set it in context. The existing two paras seem, to my {admittedly untutored) eye, simply to exemplify the (hitherto undefined) subject. Please do not remove the tags, again, until these matters have been remedied. Bridgeplayer (talk) 00:20, 19 September 2009 (UTC)[reply]

Reference to Planetmath??

Not sure what referencing an awkward and incorrect article on another wiki adds to the article. Replacing with something more correct now. —Preceding unsigned comment added by Vince Vatter (talk • contribs) 16:24, 2 October 2009 (UTC)[reply]

Thank you for fixing this but we now have the needed lead sentence. I should also like to thank you for your incredible work on this page. Bridgeplayer (talk) 01:52, 3 October 2009 (UTC)[reply]

Complexity Issues

One topic to be fleshed out is the complexity of determining if one permutation is contained in another. [1] is a fairly recent reference here. Vince Vatter (talk) 17:00, 30 November 2009 (UTC)[reply]

Gessel / Noonan-Zeilberger Conjecture

Another topic that should be on the PP page is the conjecture, sometimes attributed to Gessel, that the number of permutations of length n avoiding a finite set of forbidden patterns is always holonomic (P-recursive). Vince Vatter (talk) 19:56, 13 July 2010 (UTC)[reply]

Superpatterns

The Superpattern page should either be linked to from here or incorporated into this page. Vince Vatter (talk) 19:56, 13 July 2010 (UTC)[reply]

Generalizations

The generalizations section should include a reference to Branden and Claesson's new article.