A new lower bound for deterministic pop-stack-sorting
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911999729860608 |
|---|---|
| author | Bauer, Morgan Copenhaver, Keith |
| author_facet | Bauer, Morgan Copenhaver, Keith |
| contents | The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of $\frac{3}{5}n$ for the number of sorts to fully sort a uniformly randomly chosen permutation via a useful lemma. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_08188 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A new lower bound for deterministic pop-stack-sorting Bauer, Morgan Copenhaver, Keith Combinatorics Probability 05A05, 60C05, 68Q87 The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of $\frac{3}{5}n$ for the number of sorts to fully sort a uniformly randomly chosen permutation via a useful lemma. |
| title | A new lower bound for deterministic pop-stack-sorting |
| topic | Combinatorics Probability 05A05, 60C05, 68Q87 |
| url | https://arxiv.org/abs/2307.08188 |