February 15, 2024Open Access

Permutations with a Given X-Descent Set

Key Points

Key points are not available for this paper at this time.

Abstract

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.

Read Full Paperexternally

Bookmark

View Full Paper

Cite This Study

M. A. Omar (Thu,) studied this question.

synapsesocial.com/papers/68e79098b6db643587702305 https://doi.org/https://doi.org/10.48550/arxiv.2402.10443

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Descent set distribution for permutations with cycles of only odd or only even lengths2026
2Descents in powers of permutations2024
3Metrics on permutations with the same descent set2024
4Counting Pattern-Avoiding Permutations by Big Descents2026
5Some distributions on increasing and flattened permutations2026

Bookmark

View Full Paper