On a generalization of corner trees
<|reference_start|>On a generalization of corner trees: 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}).<|reference_end|>
@article{diehl2024on,
    title={On a generalization of corner trees},
    author={Joscha Diehl and Emanuele Verri},
    journal={arXiv preprint arXiv:2408.08293},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.08293},
    primaryClass={math.CO cs.DM}
}