Skip to Main content Skip to Navigation
Journal articles

Common intervals in permutations

Abstract : An interval of a permutation is a consecutive substring consisting of consecutive symbols. For example, 4536 is an interval in the permutation 71453682. These arise in genetic applications. For the applications, it makes sense to generalize so as to allow gaps of bounded size δ -1, both in the locations and the symbols. For example, 4527 has gaps bounded by 1 (since 3 and 6 are missing) and is therefore a δ -interval of 389415627 for δ =2. After analyzing the distribution of the number of intervals of a uniform random permutation, we study the number of 2-intervals. This is exponentially large, but tightly clustered around its mean. Perhaps surprisingly, the quenched and annealed means are the same. Our analysis is via a multivariate generating function enumerating pairs of potential 2-intervals by size and intersection size.\par
Keywords : permutations intervals
Document type :
Journal articles
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00961109
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 19, 2014 - 2:31:14 PM
Last modification on : Thursday, June 4, 2020 - 10:34:02 AM
Long-term archiving on: : Thursday, June 19, 2014 - 11:59:10 AM

File

dm080112.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00961109, version 1

Collections

Citation

Sylvie Corteel, Guy Louchard, Robin Pemantle. Common intervals in permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2006, 8, pp.189-214. ⟨hal-00961109⟩

Share

Metrics

Record views

317

Files downloads

1592