Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Combinatorics of non-ambiguous trees;Aval;Adv. in Appl. Math.,2014
2. Simply-laced isomonodromy systems;Boalch;Publ. Math. Inst. Hautes Études Sci.,2012
3. q-Eulerian polynomials arising from Coxeter groups;Brenti;European J. Combin.,1994
4. q-Bernoulli and Eulerian numbers;Carlitz;Trans. Amer. Math. Soc.,1954
5. Eulerian polynomials of spherical type;Cohen;Münster J. Math.,2008
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. About the Determinant of Complete non-ambiguous Trees;Electronic Proceedings in Theoretical Computer Science;2024-06-24
2. Proving identities on weight polynomials of tiered trees via Tutte polynomials;Journal of Combinatorial Theory, Series A;2023-01
3. Tiered Trees and Theta Operators;International Mathematics Research Notices;2022-09-22
4. A maxdrop statistic for standard Young tableaux;Discrete Mathematics, Algorithms and Applications;2021-03-29
5. A bijective enumeration of tiered trees;Discrete Mathematics;2020-09