Stack words and a bound for 3-stack sortable permutations release_b5qioeil45gqbem7piysnkppam

by Miklos Bona

Released as a article .

2019  

Abstract

We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length.
In text/plain format

Archived Files and Locations

application/pdf  94.8 kB
file_dzxn6lr6pzdxrapj6lzgyoikoy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-03-11
Version   v1
Language   en ?
arXiv  1903.04113v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 301e6c4d-5538-409e-9c0f-568af4c004b5
API URL: JSON