Abstract

The idea of this chapter is to provide a catalogue of known, mostly enumerative results, on classical and partially ordered patterns in permutations and words. We do not state any proofs, which can be found following the references we provide. When stating a result on (sets of) patterns, we normally pick just one representative from the corresponding symmetry class (the equivalence class modulo trivial bijections).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call