Stack-sorting preimages and 0-1-trees

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. 7 pages, 5 figures

Publication Details

Journal
Discrete Mathematics & Theoretical Computer Science
Published
2026-03-26
DOI
https://doi.org/10.46298/dmtcs.16393
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stack-sorting preimages and 0-1-trees

Discrete Mathematics & Theoretical Computer Science
Advanced Combinatorial Mathematics
article

Stack-sorting preimages and 0-1-trees

article en

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. 7 pages, 5 figures

Discrete Mathematics & Theoretical Computer ScienceVol. vol. 28:1, Permutation...(Special issues)
Openalex Percentile: Top 5%
Advanced Combinatorial Mathematics
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Stack-sorting preimages and 0-1-trees · Discrete Mathematics & Theoretical Computer Science (2026) | TGRS Research Map | TGRS