EUVIMEDEUVIMED entdecken
Crossref

Breaking cycles, the odd versus the even

William Y.C. Chen

Enumerative Combinatorics and Applications · 19.10.2023 · 4 (3) · Article #S2R17

DOI: 10.54550/eca2024v4s3r17 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Enumerative Combinatorics and Applications, online erschienen am 19.10.2023. Verfasst von William Y.C. Chen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated problem concerning odd cycles and even cycles, arising in the combinatorial study of the Cayley continuants by E. Munarini and D. Torri. In extreme cases, one encounters two special classes of permutations of $2n$ elements with the same cardinality. A bijection of this appealing relation has been found by E. Sayag. A combinatorial study of permutations with only odd cycles has been carried out by M. B\'ona, A. Mclennan and D. White. We find an intermediate structure which leads to a linkage between these two antipodal structures. A recursive setting reveals that everything boils down to only one trick -- breaking the cycles.

Zitieren

APA

Chen, W. Y. (2023). Breaking cycles, the odd versus the even. Enumerative Combinatorics and Applications, 4(3), Article #S2R17. https://doi.org/10.54550/eca2024v4s3r17

Vancouver

Chen WY. Breaking cycles, the odd versus the even. Enumerative Combinatorics and Applications. 2023;4(3):Article #S2R17. doi:10.54550/eca2024v4s3r17

BibTeX
@article{Chen2023,
  author = {Chen, William Y.C.},
  title = {Breaking cycles, the odd versus the even},
  journal = {Enumerative Combinatorics and Applications},
  year = {2023},
  volume = {4},
  number = {3},
  pages = {Article #S2R17},
  doi = {10.54550/eca2024v4s3r17}
}
Kostenlos starten →