@inproceedings{c62529dd6ef34ab78fdfe034427474a9,
title = "Generating and Numbering Permutations with the Use of Chaotic Maps",
abstract = "Finite set permutations play an essential role in many engineering applications. In the professional literature, you can find many algorithms that allow you to generate and number permutations. This article proposes a new algorithm for generating and numbering permutations using an adequately constructed chaotic mapping. This algorithm can be considered as a non-algebraic version of the well-known Fisher-Yates algorithm. A numerical example illustrates its operation.",
keywords = "Chaotic mapping, Generating permutations, Permutation numbering",
author = "Marcin Lawnik and Arkadiusz Banasik",
note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS 2021 ; Conference date: 22-09-2021 Through 25-09-2021",
year = "2021",
doi = "10.1109/IDAACS53288.2021.9661044",
language = "English",
series = "Proceedings of the 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS 2021",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "387--390",
booktitle = "Proceedings of the 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems",
address = "United States",
}