On the Distribution of the Number of Occurrences of an Order-Preserving Pattern of Length Three in a Random Permutation-Reference-Cited by-同舟云学术

On the Distribution of the Number of Occurrences of an Order-Preserving Pattern of Length Three in a Random Permutation

Published:2012-03-17 Issue:3 Volume:14 Page:831-842
ISSN:1387-5841
Container-title:Methodology and Computing in Applied Probability
language:en
Short-container-title:Methodol Comput Appl Probab

Author:

Fu James C.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/s11009-012-9279-6.pdf

Reference28 articles.

1. Barcucci E, Del Lungo A, Pergola E, Pinzani R (2000) Permutations avoiding an increasing number of length-increasing forbidden subsequences. Discrete Math Theor Comput Sci 4(1):31–44

2. Bóna M (1998) Permutations with one or two 132-subsequences. Discrete Math 181(1–3):267–274

3. Bose P, Buss JF, Lubiw A (1998) Pattern matching for permutations. Inform Process Lett 65(5):277–283

4. Carlitz L (1974) Permutations and sequences. Adv Math 14:92–120

5. Chang MS, Wang FH (1992) Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Inform Process Lett 43(6):293–295

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

1. Analysis for a qualification test procedure with FMCIA (finite Markov chain imbedding approach);Mathematics Applied to Engineering;2017

2. Reliability Evaluation for a Portable Ethernet Data Acquisition Device Subjected to Competing Failure of Random Shocks;Queueing Theory and Network Applications;2017

3. Waiting Time Distribution for the Emergence of Superpatterns;Methodology and Computing in Applied Probability;2015-02-13

4. On the Distribution of the Length of the Longest Increasing Subsequence in a Random Permutation;Methodology and Computing in Applied Probability;2013-10-03