Stack words and a bound for 3-stack sortable permutations

Miklos Bona

Stack words and a bound for 3-stack sortable permutations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.04113 v4 pith:QXZRXHLY submitted 2019-03-11 math.CO

Miklos Bona This is my paper · ORCID

classification math.CO

keywords stackwordsboundpermutationssortablebestfindfirst

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original 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. This is the first time that stack words are used to obtain such a result.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
math.CO 2019-08 conditional novelty 6.0 of 10

Nine classes of pattern-avoiding uniquely sorted permutations are enumerated via bijections with Dyck, S-Motzkin, and Schröder paths, confirming Defant's conjectures.

Pith tools