EUVIMEDEUVIMED entdecken
Crossref

Descent set distribution for permutations with cycles of only odd or only even lengths

Ron M. Adin, Pál Hegedűs, Yuval Roichman

Algebraic Combinatorics · 03.03.2026 · 9 (1) · 161-182

DOI: 10.5802/alco.471 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 03.03.2026. Verfasst von Ron M. Adin und 2 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

It is known that the number of permutations in the symmetric group S 2 n with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent sets: the number of permutations in S 2 n with a prescribed descent set and all cycles of odd lengths is equal to the number of permutations with the complementary descent set and all cycles of even lengths. There is also a variant for S 2 n + 1 . The proof uses generating functions for character values and applies a new identity on higher Lie characters.

Zitieren

APA

Adin, R. M., Hegedűs, P., & Roichman, Y. (2026). Descent set distribution for permutations with cycles of only odd or only even lengths. Algebraic Combinatorics, 9(1), 161-182. https://doi.org/10.5802/alco.471

Vancouver

Adin RM, Hegedűs P, Roichman Y. Descent set distribution for permutations with cycles of only odd or only even lengths. Algebraic Combinatorics. 2026;9(1):161-182. doi:10.5802/alco.471

BibTeX
@article{Adin2026,
  author = {Adin, Ron M. and Hegedűs, Pál and Roichman, Yuval},
  title = {Descent set distribution for permutations with cycles of only odd or only even lengths},
  journal = {Algebraic Combinatorics},
  year = {2026},
  volume = {9},
  number = {1},
  pages = {161--182},
  doi = {10.5802/alco.471}
}
Kostenlos starten →