EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Log-Convexity and Fixed Points of Permutations

Miklós Bóna

Axioms · 01.04.2026 · 15 (4) · 255

DOI: 10.3390/axioms15040255 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Axioms, online erschienen am 01.04.2026. Verfasst von Miklós Bóna. Die Arbeit nennt 6 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Simons Collaboration.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We provide a combinatorial proof for the fact that the numbers of derangements of length n form a log-convex sequence for n≥3. A minor modification of our proof yields the same result for permutations of length n≥4 that have exactly one fixed point. We explain why these statements do not generalize for permutations with exactly k fixed points where k≥3.

Förderung

  • Simons Collaboration

Zitieren

APA

Bóna, M. (2026). Log-Convexity and Fixed Points of Permutations. Axioms, 15(4), 255. https://doi.org/10.3390/axioms15040255

Vancouver

Bóna M. Log-Convexity and Fixed Points of Permutations. Axioms. 2026;15(4):255. doi:10.3390/axioms15040255

BibTeX
@article{Bna2026,
  author = {Bóna, Miklós},
  title = {Log-Convexity and Fixed Points of Permutations},
  journal = {Axioms},
  year = {2026},
  volume = {15},
  number = {4},
  pages = {255},
  doi = {10.3390/axioms15040255}
}
Kostenlos starten →