[Submitted on 23 May 2025 (v1), last revised 26 Jun 2026 (this version, v5)]

View PDF HTML (experimental)

Abstract:We define a class of partially labeled trees and use them to find simple proofs for two recent enumeration results of Colin Defant concerning stack-sorting preimages of permutation classes.

Submission history

From: Miklos Bona [view email]
[v1] Fri, 23 May 2025 18:38:22 UTC (21 KB)
[v2] Wed, 21 Jan 2026 19:26:30 UTC (21 KB)
[v3] Thu, 26 Feb 2026 01:29:03 UTC (21 KB)
[v4] Thu, 19 Mar 2026 22:30:25 UTC (27 KB)
[v5] Fri, 26 Jun 2026 20:41:59 UTC (27 KB)

Current browse context:

math.CO

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.