Jump to content

Talk:Permutation pattern

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by JayBeeEll (talk | contribs) at 20:05, 17 October 2016 (Leading example makes no sense). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics B‑class Mid‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
BThis article has been rated as B-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-priority on the project's priority scale.

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]

I just rewrote superpattern substantially; it doesn't look like it receives any attention at all. I vote in favor of incorporating it into this page. --Joel B. Lewis (talk) 18:42, 10 July 2011 (UTC)[reply]

Generalizations

The generalizations section should include a reference to Branden and Claesson's new article. — Preceding unsigned comment added by Vince Vatter (talkcontribs) 05:00, 28 February 2011 (UTC)[reply]

Applications

Are there any applications -- to real world problems or to other math/tcs problems -- of pattern matching/avoidance in permutations? 78.129.59.167 (talk) 21:39, 20 June 2011 (UTC)[reply]

Leading example makes no sense

This makes no sense:

For example, the permutation π = 391867452 contains the pattern σ = 51342, as can be seen in the highlighted subsequence of π = 391867452 (or π = 391867452 or π = 391867452 or π = 391867452). Each of the subsequences 91674, 91675, 91672, and 91452 is called a copy, instance, or occurrence of σ.

Christopher Ursich (talk) 19:57, 17 October 2016 (UTC)[reply]

Christopher.ursich, it makes sense to me. Maybe you could make a more precise comment? --JBL (talk) 20:05, 17 October 2016 (UTC)[reply]