2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2021★ 2 cited
A decomposition of ballot permutations, pattern avoidance and Gessel walks
Zhicong Lin, David G. L. Wang, Tongyuan Zhao
A permutation whose any prefix has no more descents than ascents is called a ballot permutation. In this paper, we present a decomposition of ballot permutations that enables us to…
math.CO2021
Refined Eulerian numbers and ballot permutations
Tongyuan Zhao, Yue Sun, Feng Zhao
A ballot permutation is a permutation π such that in any prefix of π the descent number is not more than the ascent number. In this article, we obtained a formula in close form for…
math.CO2020★ 2 cited
The peak and descent statistics over ballot permutations
David G. L. Wang, T. Zhao
A ballot permutation is a permutation such that in any prefix of the descent number is not more than the ascent number. By using a reversal concatenation map, we give a for…