Growing at a perfect speed

Authors:
M. h. Albert;S. a. Linton
Affiliations:
Department of computer science, university of otago, dunedin, new zealand (e-mail: malbert@cs.otago.ac.nz);Centre for interdisciplinary research in computational algebra, university of st andrews, fife, scotland (e-mail: sal@dcs.st-and.ac.uk)
Venue:
Combinatorics, Probability and Computing
Year:
2009

Citing 3
Cited 1

Regular closed sets of permutations

Theoretical Computer Science
Excluded permutation matrices and the Stanley-Wilf conjecture

Journal of Combinatorial Theory Series A
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation

Random Structures & Algorithms

Embedding dualities for set partitions and for relational structures

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A collection of permutation classes is exhibited whose growth rates form a perfect set, thereby refuting some conjectures of Balogh, Bollobás and Morris.