TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Optimization of discrete data structures via combinatorial stirling numbers of the second kind

, * , , , ,

* Corresponding author · click or hover a name for details

pp. 453–460Vol. 29Issue 2-AFebruary 2026DOI: 10.47974/JDMSC-2477 Crossmark XML
Received:
07 May 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2477
Pages:
453–460

Abstract

Optimizing discrete data structures speeds up program development, security, and data storage. This study analyses how Combinatorial Stirling Numbers of the Second Kind improve discrete data structures. The main goals are to break sets up and simplify computations. A Stirling number is the number of ways to divide n objects into k non-empty groups. These mathematical tools assist manage developing data structures. These numbers help you minimize unnecessary copies, improve memory utilization, and build techniques that work better for static and moving data sets. Stirling numbers are used to maximize trees, heaps, and hash tables in the study. The experiments shown considerable time complexity and memory efficiency speed differences. This technique allows further research into sophisticated structure-based optimization strategies.

Keywords

Subject Classifications

39A12

References

[1] X. Yang, Z. Wang, H. Zhang, N. Ma, N. Yang, H. Liu, H. Zhang, and L. Yang, “A review: Machine learning for combinatorial optimization problems in energy areas,” Algorithms, vol. 15, no. 6, p. 205 (2022).
[2] N. Mazyavkina, S. Sviridov, S. Ivanov, and E. Burnaev, “Reinforcement learning for combinatorial optimization: A survey,” Comput. Oper. Res., vol. 134, p. 105400 (2021).
[3] Y. Bengio, A. Lodi, and A. Prouvost, “Machine learning for combinatorial optimization: A methodological tour d’horizon,” Eur. J. Oper. Res., vol. 290, no. 2, pp. 405–421 (2021).
[4] M. Karimi-Mamaghan, M. Mohammadi, P. Meyer, A. M. Karimi-Mamaghan, and E. G. Talbi, “Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art,” Eur. J. Oper. Res., vol. 296, no. 2, pp. 393–422 (2022).
[5] M. H. Hadi and L. A. A. Jabar, “Build new operator using cluster system,” J. Interdiscip. Math., vol. 28, no. 3-B, pp. 1117–1124 (2025), doi: 10.47974/JIM-2088.
[6] S. T. Shirkande, S. Misal, S. Mhaske, A. Salunkhe, and D. Mendke, “Blockchain in supply chain management: A survey of emerging trends and next-generation solutions,” Int. J. Electr., Electron. Comput. Syst., vol. 13, no. 2, pp. 36–42 (2025).
[7] T. D. Barrett, C. W. F. Parsonson, and A. Laterre, “Learning to solve combinatorial graph partitioning problems via efficient exploration,” arXiv preprint, arXiv:2205.14105 [cs.LG] (2022).
[8] A. Z. Wagner, “Constructions in combinatorics via neural networks,” arXiv preprint, arXiv:2104.14516 [math.CO] (2021).
[9] J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open, vol. 1, pp. 57–81 (2020).
[10] E. Rosemaro, Anasica, and I. Zellar, “AI-based decision support systems for emergency medical services,” Int. J. Recent Adv. Eng. Technol., vol. 13, no. 1, pp. 7–12 (2025).

Views: 172Downloads: 87Citations: 0