Pub Date : 2025-07-01DOI: 10.1007/s13370-025-01289-7
Hira Iqbal, Mujahid Abbas, Hina Dilawer, Vladimir Rakočević
The purpose of this article is to put forth the idea of multivalued weak Suzuki Type ((mathcal {theta },{hat{{mathcal {R}}}})) contractions whose single valued version is also novel in literature. A fixed point result in the frame of metric space endowed with binary relation for such a mapping is established and some examples are provided. Data dependence of fixed points and existence of solution of matrix equations are also discussed as an application of our results.
{"title":"Multivalued weak Suzuki type ((mathcal {theta },{hat{{mathcal {R}}}})) contractions with applications","authors":"Hira Iqbal, Mujahid Abbas, Hina Dilawer, Vladimir Rakočević","doi":"10.1007/s13370-025-01289-7","DOIUrl":"10.1007/s13370-025-01289-7","url":null,"abstract":"<div><p>The purpose of this article is to put forth the idea of multivalued weak Suzuki Type <span>((mathcal {theta },{hat{{mathcal {R}}}}))</span> contractions whose single valued version is also novel in literature. A fixed point result in the frame of metric space endowed with binary relation for such a mapping is established and some examples are provided. Data dependence of fixed points and existence of solution of matrix equations are also discussed as an application of our results.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-28DOI: 10.1007/s13370-025-01346-1
Kunle Adegoke, Robert Frontczak, Taras Goy
We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these generating functions we evaluate several infinite series in closed form. In addition, we offer some combinatorial sum identities involving Catalan numbers, harmonic numbers and odd harmonic numbers. Finally, we analyze a special log-integral with Fibonacci numbers and odd harmonic numbers.
{"title":"Combinatorial sums, series and integrals involving odd harmonic numbers","authors":"Kunle Adegoke, Robert Frontczak, Taras Goy","doi":"10.1007/s13370-025-01346-1","DOIUrl":"10.1007/s13370-025-01346-1","url":null,"abstract":"<div><p>We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these generating functions we evaluate several infinite series in closed form. In addition, we offer some combinatorial sum identities involving Catalan numbers, harmonic numbers and odd harmonic numbers. Finally, we analyze a special log-integral with Fibonacci numbers and odd harmonic numbers.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145170418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-28DOI: 10.1007/s13370-025-01347-0
Hashem Bordbar, Ravikumar Bandaru, Young Bae Jun
In this paper, we introduce the concept of soft GE-algebras within the framework of GE-algebra theory, extending existing approaches by incorporating principles of soft set theory. We investigate the structural properties of soft GE-algebras, define operations on these structures, and establish criteria for identifying soft subalgebras. Furthermore, we present key theorems that relate the properties of soft GE-algebras to operations such as intersection, union, and mapping, particularly emphasizing the role of GE-morphisms. These findings lay the groundwork for further exploration of soft structures in the context of GE-algebras and their potential applications in decision-making and computational logic.
{"title":"Soft GE-algebras","authors":"Hashem Bordbar, Ravikumar Bandaru, Young Bae Jun","doi":"10.1007/s13370-025-01347-0","DOIUrl":"10.1007/s13370-025-01347-0","url":null,"abstract":"<div><p>In this paper, we introduce the concept of soft GE-algebras within the framework of GE-algebra theory, extending existing approaches by incorporating principles of soft set theory. We investigate the structural properties of soft GE-algebras, define operations on these structures, and establish criteria for identifying soft subalgebras. Furthermore, we present key theorems that relate the properties of soft GE-algebras to operations such as intersection, union, and mapping, particularly emphasizing the role of GE-morphisms. These findings lay the groundwork for further exploration of soft structures in the context of GE-algebras and their potential applications in decision-making and computational logic.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-025-01347-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145170055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-25DOI: 10.1007/s13370-025-01341-6
Surabhi Tiwari
In this paper, we revisit the concept of proximal groups, which are generalization of topological groups. Further, we prove Kuratowski–Mrówka theorem for proximity spaces which motivate us to define categorically compact proximal groups. Finally, we prove Tychonoff theorems for proximal groups. The study is supported by various examples.
{"title":"A study of compactness for proximal groups","authors":"Surabhi Tiwari","doi":"10.1007/s13370-025-01341-6","DOIUrl":"10.1007/s13370-025-01341-6","url":null,"abstract":"<div><p>In this paper, we revisit the concept of proximal groups, which are generalization of topological groups. Further, we prove Kuratowski–Mrówka theorem for proximity spaces which motivate us to define categorically compact proximal groups. Finally, we prove Tychonoff theorems for proximal groups. The study is supported by various examples.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145168795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-25DOI: 10.1007/s13370-025-01342-5
M. Folly-Gbetoula, Kwassi Anani
Symmetry is a powerful tool for finding analytical solutions to differential equations, both partial and ordinary, via the similarity variables or via the invariance of the equation under group transformations. It is the largest group of transformations that leaves the differential equation invariant. It is now known that this differential equation method plays the same role when it comes to the study of difference equations. Difference equations can be used to model various phenomena where the changes occur in discrete manner. The use of symmetries on recurrence equations, usually, leads to reductions of order and hence eases the process of finding their solutions. One of the aims of this work is to employ symmetries to generalize some results in the literature. We present new generalized formula solutions of a class of difference equations and we investigate the periodicity and behavior of these solutions.
{"title":"Method of Lie symmetry for analytical solutions, periodicity and attractivity of a family of tenth-order difference equations","authors":"M. Folly-Gbetoula, Kwassi Anani","doi":"10.1007/s13370-025-01342-5","DOIUrl":"10.1007/s13370-025-01342-5","url":null,"abstract":"<div><p>Symmetry is a powerful tool for finding analytical solutions to differential equations, both partial and ordinary, via the similarity variables or via the invariance of the equation under group transformations. It is the largest group of transformations that leaves the differential equation invariant. It is now known that this differential equation method plays the same role when it comes to the study of difference equations. Difference equations can be used to model various phenomena where the changes occur in discrete manner. The use of symmetries on recurrence equations, usually, leads to reductions of order and hence eases the process of finding their solutions. One of the aims of this work is to employ symmetries to generalize some results in the literature. We present new generalized formula solutions of a class of difference equations and we investigate the periodicity and behavior of these solutions.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-025-01342-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145169128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-25DOI: 10.1007/s13370-025-01343-4
Fatemeh Barkhori Mehni, Sohrab Ostadhadi-Dehkordi
In this paper, we investigate the concept of topological (Gamma)-semihypergroups as a generalization of topological semihypergroups. Also, we present the new connection between topological (Gamma)-semihypergroups and topological semihypergroups by special equivalence relation. Furthermore, we define and consider (Gamma)-hyperideals and selection function on (Gamma)-semihypergroups. Additionally, we consider separation axioms((T_1) to (T_4)) for topological (Gamma) -semihypergroup and we present a connection between topological (Gamma) -semihypergroups and topological semihypergroups(semigroups). Finally, we prove that topological (Gamma)-semihypergroup H is (T_i,) for (1le i le 4) if and only if (mid H mid =1.)
本文研究了拓扑(Gamma) -半超群作为拓扑半超群的推广的概念。利用特殊等价关系,给出了拓扑(Gamma) -半超群与拓扑半超群之间的新联系。此外,我们定义并考虑了(Gamma) -半超群上的(Gamma) -超群和选择函数。此外,我们考虑了拓扑(Gamma) -半超群的分离公理((T_1)到(T_4)),并提出了拓扑(Gamma) -半超群和拓扑半超群(半群)之间的联系。最后,我们证明了拓扑(Gamma) -半超群H对于(1le i le 4)是(T_i,)当且仅当 (mid H mid =1.)
{"title":"Separation Axioms on Topological (Gamma)-Semihypergroups","authors":"Fatemeh Barkhori Mehni, Sohrab Ostadhadi-Dehkordi","doi":"10.1007/s13370-025-01343-4","DOIUrl":"10.1007/s13370-025-01343-4","url":null,"abstract":"<div><p>In this paper, we investigate the concept of topological <span>(Gamma)</span>-semihypergroups as a generalization of topological semihypergroups. Also, we present the new connection between topological <span>(Gamma)</span>-semihypergroups and topological semihypergroups by special equivalence relation. Furthermore, we define and consider <span>(Gamma)</span>-hyperideals and selection function on <span>(Gamma)</span>-semihypergroups. Additionally, we consider separation axioms(<span>(T_1)</span> to <span>(T_4)</span>) for topological <span>(Gamma)</span> -semihypergroup and we present a connection between topological <span>(Gamma)</span> -semihypergroups and topological semihypergroups(semigroups). Finally, we prove that topological <span>(Gamma)</span>-semihypergroup <i>H</i> is <span>(T_i,)</span> for <span>(1le i le 4)</span> if and only if <span>(mid H mid =1.)</span></p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145169108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-16DOI: 10.1007/s13370-025-01340-7
Y. Aditya, U. Y. Divya Prasanthi, Dinesh Chandra Maurya
This research investigates the Bianchi type-I Barrow holographic dark energy model within the framework of Brans-Dicke gravity theory, incorporating logarithmic scalar fields. We formulate the field equations for a spatially homogeneous and anisotropic spacetime characterized by a configuration of pressure-less matter and dark energy. The Hubble function for the model is derived and constrained using a joint analysis of the cosmic chronometers and Pantheon datasets to obtain values for the model parameters (H_{0}) and (vartheta _{3}) at (1sigma ) and (2sigma ) confidence levels. Based on these parameter values, we compute derived parameters and discuss the results by illustrating the geometrical behavior of cosmological quantities. In this context, we analyze the graphical behavior of the cosmological and dynamical parameters of the proposed model. Stability is examined through the squared sound speed criterion. The proposed framework may potentially address the cosmic coincidence problem. Furthermore, we assess the validity of our model by analyzing thermodynamic quantities. All cosmological evaluations suggest that a suitable choice of model parameters results in an accelerating universe. The suggested model exhibits stability in the early and present epochs but becomes unstable in the later stages.
{"title":"Cosmic and thermodynamic analysis of Barrow holographic dark energy model in logarithmic Brans-Dicke gravity","authors":"Y. Aditya, U. Y. Divya Prasanthi, Dinesh Chandra Maurya","doi":"10.1007/s13370-025-01340-7","DOIUrl":"10.1007/s13370-025-01340-7","url":null,"abstract":"<div><p>This research investigates the Bianchi type-<i>I</i> Barrow holographic dark energy model within the framework of Brans-Dicke gravity theory, incorporating logarithmic scalar fields. We formulate the field equations for a spatially homogeneous and anisotropic spacetime characterized by a configuration of pressure-less matter and dark energy. The Hubble function for the model is derived and constrained using a joint analysis of the cosmic chronometers and Pantheon datasets to obtain values for the model parameters <span>(H_{0})</span> and <span>(vartheta _{3})</span> at <span>(1sigma )</span> and <span>(2sigma )</span> confidence levels. Based on these parameter values, we compute derived parameters and discuss the results by illustrating the geometrical behavior of cosmological quantities. In this context, we analyze the graphical behavior of the cosmological and dynamical parameters of the proposed model. Stability is examined through the squared sound speed criterion. The proposed framework may potentially address the cosmic coincidence problem. Furthermore, we assess the validity of our model by analyzing thermodynamic quantities. All cosmological evaluations suggest that a suitable choice of model parameters results in an accelerating universe. The suggested model exhibits stability in the early and present epochs but becomes unstable in the later stages.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145166662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-16DOI: 10.1007/s13370-025-01339-0
Josephine Wairimu, Andrew Gothard, Grzegorz Rempala
We examine a popular extension of the classical Susceptible-Infected-Recovered (SIR) model within a network-based framework, where node degrees follow a Poisson distribution. First, we review the properties of this extension, its connection to the classical SIR model, and its relationship with the pairwise closure condition for stochastic epidemics on networks. We then apply it to data analysis. This network-based formulation introduces an additional parameter representing the mean node degree, allowing for the incorporation of heterogeneity in contact patterns. Using the extended SIR model, we analyze epidemic data from the 2018–2020 Ebola outbreak in the Democratic Republic of the Congo, employing a survival approach combined with the Hamiltonian Monte Carlo method. Our findings suggest that network-based models more accurately capture epidemic heterogeneity than traditional compartmental models, without introducing unnecessary additional complexity.
{"title":"Poisson network SIR epidemic model","authors":"Josephine Wairimu, Andrew Gothard, Grzegorz Rempala","doi":"10.1007/s13370-025-01339-0","DOIUrl":"10.1007/s13370-025-01339-0","url":null,"abstract":"<div><p>We examine a popular extension of the classical Susceptible-Infected-Recovered (SIR) model within a network-based framework, where node degrees follow a Poisson distribution. First, we review the properties of this extension, its connection to the classical SIR model, and its relationship with the pairwise closure condition for stochastic epidemics on networks. We then apply it to data analysis. This network-based formulation introduces an additional parameter representing the mean node degree, allowing for the incorporation of heterogeneity in contact patterns. Using the extended SIR model, we analyze epidemic data from the 2018–2020 Ebola outbreak in the Democratic Republic of the Congo, employing a survival approach combined with the Hamiltonian Monte Carlo method. Our findings suggest that network-based models more accurately capture epidemic heterogeneity than traditional compartmental models, without introducing unnecessary additional complexity.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-025-01339-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145165521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 2010, Dieulefait and Urroz considered the notion of malleability of an RSA modulus. They proved that, given some information on the factors of numbers coprime to n, where n is an RSA modulus, there exists an algorithm that finds a proper factor of n in time (O(log n)). As a particular case of their algorithm, just some knowledge of the factors of (2^npm 1) is enough to factor n except possibly when n is a base-2 pseudoprime. They went on to prove that the set of these exceptional RSA moduli with prime factors between z and 2z has size at most (O(z^2/(log z)^3)). In the present paper, we improve this bound significantly and show that the counting function for these RSA moduli is bounded above by (O(z^{8/5}/(log z)^2)). In addition, as a related problem, we prove an upper bound of (O(z^{4/5}/(log z)^{2/5})) for the number of base-2 pseudoprimes up to z that are products of two primes.
{"title":"On pseudoprime RSA moduli","authors":"Florian Luca, Dimbinaina Ralaivaosaona, Jorge Jiménez Urroz","doi":"10.1007/s13370-025-01338-1","DOIUrl":"10.1007/s13370-025-01338-1","url":null,"abstract":"<div><p>In 2010, Dieulefait and Urroz considered the notion of malleability of an RSA modulus. They proved that, given some information on the factors of numbers coprime to <i>n</i>, where <i>n</i> is an RSA modulus, there exists an algorithm that finds a proper factor of <i>n</i> in time <span>(O(log n))</span>. As a particular case of their algorithm, just some knowledge of the factors of <span>(2^npm 1)</span> is enough to factor <i>n</i> except possibly when <i>n</i> is a base-2 pseudoprime. They went on to prove that the set of these exceptional RSA moduli with prime factors between <i>z</i> and 2<i>z</i> has size at most <span>(O(z^2/(log z)^3))</span>. In the present paper, we improve this bound significantly and show that the counting function for these RSA moduli is bounded above by <span>(O(z^{8/5}/(log z)^2))</span>. In addition, as a related problem, we prove an upper bound of <span>(O(z^{4/5}/(log z)^{2/5}))</span> for the number of base-2 pseudoprimes up to <i>z</i> that are products of two primes.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-025-01338-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145164388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-06-06DOI: 10.1007/s13370-025-01334-5
Masoud Yousefi, Khosrow Rahmani, Masoud Rajabi, Ali Reyhani, Nayereh Asgari
The ensemble learning algorithm is a statistical method that is unknown in HEA(s)'s prediction phase. The ensemble learning algorithm is used to check on the phase selection principles, utilizing a large experimental case study on 401 distinct HEAs, comprising 174 SS, 54 IM, and 173 SS + IM phases. Random forest(RF) has the highest accuracy compared with other ensemble learning algorithms i.e. its certainty is about 10% higher than support-vector machines(SVM) and K-nearest neighbors(KNN) for allocating HEA(s). The validity and reliability of the proposed algorithms are announced as results of the paper. Therewith, findings show two main advantages to allocating HEAs: First deduction of decision trees and improving the carefulness, and second automating missing values. In addition, to check the practical accuracy of the machine learning results, the XRD results of the TiZrNbCrV, TiZrNbFeCr, and Ti ZrNbFeV alloys are presented. All alloys are in solid solution statues without any intermetallic phases. The practical results show the ensemble learning algorithms have suitable consistency in real conditions and can be a great help to design new high entropy alloys.
{"title":"The ensemble learning algorithms for prediction high entropy alloys phases","authors":"Masoud Yousefi, Khosrow Rahmani, Masoud Rajabi, Ali Reyhani, Nayereh Asgari","doi":"10.1007/s13370-025-01334-5","DOIUrl":"10.1007/s13370-025-01334-5","url":null,"abstract":"<div><p>The ensemble learning algorithm is a statistical method that is unknown in HEA(s)'s prediction phase. The ensemble learning algorithm is used to check on the phase selection principles, utilizing a large experimental case study on 401 distinct HEAs, comprising 174 SS, 54 IM, and 173 SS + IM phases. Random forest(RF) has the highest accuracy compared with other ensemble \u0000learning algorithms i.e. its certainty is about 10% higher than support-vector machines(SVM) and K-nearest neighbors(KNN) for allocating HEA(s). The validity and reliability of the proposed algorithms are announced as results of the paper. Therewith, findings show two main advantages to allocating HEAs: First deduction of decision trees and improving the carefulness, and second automating missing values. In addition, to check the practical accuracy of the machine learning results, the XRD results of the TiZrNbCrV, TiZrNbFeCr, and Ti ZrNbFeV \u0000alloys are presented. All alloys are in solid solution statues without any intermetallic phases. The practical results show the ensemble learning algorithms have suitable consistency in real conditions and can be a great help to design new high entropy alloys.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 3","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145162388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}