ON A CONNECTION BETWEEN OEIS,THE FESTIVAL OF YOUNG MATHEMATICIANS 2025 AND THE FUTURAMA ANIMATED SERIES
Mathematics and Informatics · 2026 · 69 (3) · 255-267
DOI: 10.53656/math2026-3-1-ocb ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics and Informatics, 2026. Verfasst von Ivaylo Kortezov und 2 weiteren Autor:innen.
Abstract (Originalsprache)
The starting point of the article is a combinatorial problem from the Festival of Young Mathematicians 2025, investigating the maximal number of distinct transpositions that can be performed on a given permutation so that the initial configuration is restored. A connection with sequence A011848 from the Online Encyclopedia of Integer Sequences (OEIS) is established, and a generalization is proved concerning the maximal length of a sequence of distinct transpositions connecting two elements of the symmetric group Sn.
Zitieren
APA
Kortezov, I., Valkov, M., & Marinov, M. (2026). ON A CONNECTION BETWEEN OEIS,THE FESTIVAL OF YOUNG MATHEMATICIANS 2025 AND THE FUTURAMA ANIMATED SERIES. Mathematics and Informatics, 69(3), 255-267. https://doi.org/10.53656/math2026-3-1-ocb
Vancouver
Kortezov I, Valkov M, Marinov M. ON A CONNECTION BETWEEN OEIS,THE FESTIVAL OF YOUNG MATHEMATICIANS 2025 AND THE FUTURAMA ANIMATED SERIES. Mathematics and Informatics. 2026;69(3):255-267. doi:10.53656/math2026-3-1-ocb
BibTeX
@article{Kortezov2026,
author = {Kortezov, Ivaylo and Valkov, Mladen and Marinov, Miroslav},
title = {ON A CONNECTION BETWEEN OEIS,THE FESTIVAL OF YOUNG MATHEMATICIANS 2025 AND THE FUTURAMA ANIMATED SERIES},
journal = {Mathematics and Informatics},
year = {2026},
volume = {69},
number = {3},
pages = {255--267},
doi = {10.53656/math2026-3-1-ocb}
}
EUVIMED