Key points are not available for this paper at this time.
Motivated by the work of Grinberg and Stanley, we investigate the enumeration of permutations with a given X-descent set, a generalization of the classical notion of a descent set. Our work expands on recent developments of Diaz-Lopez, Harris, Insko, Omar and Sagan and has interesting connections to Hamiltonian paths in directed graphs.
M. A. Omar (Thu,) studied this question.