EUVIMEDEUVIMED entdecken
Crossref

Stack-sorting preimages and 0-1-trees

Miklos Bona

Discrete Mathematics & Theoretical Computer Science · 26.03.2026 · vol. 28:1, Permutation... (Special issues)

DOI: 10.46298/dmtcs.16393 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 26.03.2026. Verfasst von Miklos Bona.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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

Zitieren

APA

Bona, M. (2026). Stack-sorting preimages and 0-1-trees. Discrete Mathematics & Theoretical Computer Science, vol. 28:1, Permutation...(Special issues). https://doi.org/10.46298/dmtcs.16393

Vancouver

Bona M. Stack-sorting preimages and 0-1-trees. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:1, Permutation...(Special issues). doi:10.46298/dmtcs.16393

BibTeX
@article{Bona2026,
  author = {Bona, Miklos},
  title = {Stack-sorting preimages and 0-1-trees},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  year = {2026},
  volume = {vol. 28:1, Permutation...},
  number = {Special issues},
  doi = {10.46298/dmtcs.16393}
}
Kostenlos starten →