# Almost-sure asymptotic for the number of heaps inside a random sequence

@article{Basdevant2017AlmostsureAF,
title={Almost-sure asymptotic for the number of heaps inside a random sequence},
author={Anne-Laure Basdevant and Arvind Singh},
journal={arXiv: Probability},
year={2017}
}
• Published 21 February 2017
• Mathematics
• arXiv: Probability
We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In this note, we improve on the previous result by establishing the almost-sure and L 1 convergence.
4 Citations

## Figures from this paper

• Mathematics, Computer Science
Discret. Math. Theor. Comput. Sci.
• 2020
A characterization result reminiscent of the proof of Dilworth's theorem is proved, which yields as a byproduct a flow-based algorithm for computing such a minimal decomposition of sets and sequences of intervals.
• Mathematics, Computer Science
ArXiv
• 2017
A characterization result reminiscent of the proof of Dilworth's theorem is proved, which yields as a byproduct a flow-based algorithm for computing such a minimal decomposition of sets and sequences of intervals.
• Mathematics, Computer Science
IPEC
• 2020
A heapable sequence is a sequence of numbers that can be arranged in a min-heap data structure. Finding a longest heapable subsequence of a given sequence was proposed by Byers, Heeringa,
• Computer Science, Mathematics
MCU
• 2018
An algorithm for computing formal power series associated to the variants of the Hammersley's process, that have the formal languages studies in this paper as their support, are employed to settle the nature of the scaling constant.

## References

SHOWING 1-3 OF 3 REFERENCES

• Mathematics, Computer Science
ANALCO
• 2011
An efficient algorithm is obtained for determining the heapability of a sequence, and it is proved that the question of whether a sequence can be arranged in a complete binary heap is NP-hard.
• Mathematics
CPM
• 2015
It is shown that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS), and experimental evidence that the correct asymptotic scaling is $\frac{1+\sqrt{5}}{2}\cdot \ln(n)$.
• Mathematics, Computer Science
• 2016
It is shown that the number of heaps grows logarithmically with the size of the permutation in Hammersley’s tree process, which is related to the problem of the longest increasing subsequence and has a combinatorial interpretation.