Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Diehl, Joscha, Verri, Emanuele
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2408.08293
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916727461249024
author Diehl, Joscha
Verri, Emanuele
author_facet Diehl, Joscha
Verri, Emanuele
contents Corner trees, introduced in "Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of finite (strict) double posets, which we term twin-tree double posets. They are contained in both twin double posets and tree double posets, giving candidate sets for generalizations of corner tree countings. We provide the generalization of an algorithm proposed by Even-Zohar/Leng to a class of tree double posets, thereby enlarging the space of permutations that can be counted in O(n^{5/3}).
format Preprint
id arxiv_https___arxiv_org_abs_2408_08293
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Efficient counting of permutation patterns via double posets
Diehl, Joscha
Verri, Emanuele
Combinatorics
Discrete Mathematics
Corner trees, introduced in "Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of finite (strict) double posets, which we term twin-tree double posets. They are contained in both twin double posets and tree double posets, giving candidate sets for generalizations of corner tree countings. We provide the generalization of an algorithm proposed by Even-Zohar/Leng to a class of tree double posets, thereby enlarging the space of permutations that can be counted in O(n^{5/3}).
title Efficient counting of permutation patterns via double posets
topic Combinatorics
Discrete Mathematics
url https://arxiv.org/abs/2408.08293