Asymptotic bounds for permutations containing many different patterns-Reference-Cited by-同舟云学术

Asymptotic bounds for permutations containing many different patterns

Published:2009-01 Issue:1 Volume:116 Page:92-108
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Miller Alison

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference7 articles.

1. Permutations containing many patterns;Albert;Ann. Comb.,2007

2. On the Stanley–Wilf conjecture for the number of permutations avoiding a given pattern;Arratia;Electron. J. Combin.,1999

3. M. Bóna, M. Coleman, personal correspondence

4. An answer to a question by Wilf on packing distinct patterns in a permutation;Coleman;Electron. J. Combin.,2004

5. H. Eriksson, K. Eriksson, S. Linusson, J. Wästlund, Dense packing of patterns in a permutation, in: Proceedings of the 15th Conference on Formal Power Series and Algebraic Combinatorics, Melbourne, Australia, 8–12 July 2002, paper #26

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The expected number of distinct consecutive patterns in a random permutation;Pure Mathematics and Applications;2022-12-01

2. Lower bounds for superpatterns and universal sequences;Journal of Combinatorial Theory, Series A;2021-08

3. Containing All Permutations;The American Mathematical Monthly;2021-01-02

4. Universality of random permutations;Bulletin of the London Mathematical Society;2020-05-16

5. Supertrees;The Electronic Journal of Combinatorics;2020-04-17