Permutations containing many patterns

M. H. Albert; Micah Colernan; Ryan Flynn; Imre Leader

doi:10.1007/s00026-007-0319-9

Back

Journal article

Peer reviewed

Permutations containing many patterns

M. H. Albert, Micah Colernan, Ryan Flynn and Imre Leader

Annals of combinatorics, Vol.11(3-4), pp.265-270

12/2007

DOI: https://doi.org/10.1007/s00026-007-0319-9

Abstract

Mathematics

Mathematics, Applied

Physical Sciences

Science & Technology

It is shown that the maximum number of patterns that can occur in a permutation of length n is asymptotically 2(n). This significantly improves a previous result of Coleman.

Metrics

1 Record Views

Details

Record Identifier: 9926517917501891
Title: Permutations containing many patterns
Creators: M. H. Albert
Micah Colernan
Ryan Flynn
Imre Leader
Publication Details: Annals of combinatorics, Vol.11(3-4), pp.265-270
Academic Unit: Computer Science
Publisher: Springer Nature
Date published ; e-published: 12/2007
Language: English
Resource Type: Journal article

Permutations containing many patterns

Abstract

Related links

Metrics

Details

Usage Policy