A Proof of the Symmetric Theta Conjecture when q = 0
Combinatorics
2024-07-03 v1
Abstract
In 10.1093/imrn/rnac258, the authors conjecture a combinatorial formula for the expressions , known as Symmetric Theta Trees Conjecture, in terms of tiered trees with an inversion statistic. In 10.1017/fms.2024.14, the authors prove a combinatorial formula for the same symmetric function, in terms of doubly labelled Dyck paths with the area statistic. In this paper, we give an explicit bijection between the subsets of the two families of objects when the relevant statistic is equal to , thus proving the Symmetric Theta Tree Conjecture when .
Cite
@article{arxiv.2407.02368,
title = {A Proof of the Symmetric Theta Conjecture when q = 0},
author = {Alessandra Caraceni and Alessandro Iraci},
journal= {arXiv preprint arXiv:2407.02368},
year = {2024}
}
Comments
14 pages, 6 figures