首页 > 最新文献

Afrika Matematika最新文献

英文 中文
Multivalued weak Suzuki type ((mathcal {theta },{hat{{mathcal {R}}}})) contractions with applications 多值弱Suzuki型((mathcal {theta },{hat{{mathcal {R}}}}))收缩及其应用
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-07-01 DOI: 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.

本文的目的是提出多值弱铃木型((mathcal {theta },{hat{{mathcal {R}}}}))缩约的概念,其单值缩约在文献中也是新颖的。建立了这种映射在具有二元关系的度量空间坐标系中的不动点结果,并给出了一些实例。作为结果的应用,讨论了不动点的数据依赖性和矩阵方程解的存在性。
{"title":"Multivalued weak Suzuki type ((mathcal {theta },{hat{{mathcal {R}}}})) contractions with applications","authors":"Hira Iqbal,&nbsp;Mujahid Abbas,&nbsp;Hina Dilawer,&nbsp;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}
引用次数: 0
Combinatorial sums, series and integrals involving odd harmonic numbers 包含奇调和数的组合和、级数和积分
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-28 DOI: 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.

我们提出了几种涉及中心二项式系数、调和数和奇调和数的普通生成函数。我们的研究结果补充了Boyadzhiev(2012)和Chen(2016)的研究结果。在这些生成函数的基础上,我们以封闭形式求出了几个无穷级数。此外,我们还给出了一些涉及加泰罗尼亚数、调和数和奇调和数的组合和恒等式。最后,我们分析了一个包含奇调和数和斐波那契数的特殊对数积分。
{"title":"Combinatorial sums, series and integrals involving odd harmonic numbers","authors":"Kunle Adegoke,&nbsp;Robert Frontczak,&nbsp;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}
引用次数: 0
Soft GE-algebras 软GE-algebras
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-28 DOI: 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.

本文在ge代数理论的框架内引入了软ge代数的概念,结合软集理论的原理对已有的方法进行了扩展。我们研究了软ge代数的结构性质,定义了这些结构上的运算,并建立了识别软子代数的准则。此外,我们提出了将软ge代数的性质与交、并和映射等运算联系起来的关键定理,特别强调了ge态射的作用。这些发现为进一步探索ge代数背景下的软结构及其在决策和计算逻辑中的潜在应用奠定了基础。
{"title":"Soft GE-algebras","authors":"Hashem Bordbar,&nbsp;Ravikumar Bandaru,&nbsp;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}
引用次数: 0
A study of compactness for proximal groups 近端群紧致性的研究
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-25 DOI: 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.

本文重新讨论了近端群的概念,近端群是拓扑群的推广。进一步,我们证明了接近空间的Kuratowski-Mrówka定理,该定理激励我们定义范畴紧致的近端群。最后,我们证明了近端群的Tychonoff定理。这项研究得到了许多例子的支持。
{"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}
引用次数: 0
Method of Lie symmetry for analytical solutions, periodicity and attractivity of a family of tenth-order difference equations 一类十阶差分方程解析解的李氏对称方法、周期性和吸引性
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-25 DOI: 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,&nbsp;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}
引用次数: 0
Separation Axioms on Topological (Gamma)-Semihypergroups 拓扑上的分离公理(Gamma) -半超群
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-25 DOI: 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,&nbsp;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}
引用次数: 0
Cosmic and thermodynamic analysis of Barrow holographic dark energy model in logarithmic Brans-Dicke gravity 对数Brans-Dicke引力中Barrow全息暗能量模型的宇宙和热力学分析
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-16 DOI: 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.

本文研究了在Brans-Dicke引力理论框架下,结合对数标量场的Bianchi - i型Barrow全息暗能量模型。我们建立了一个以无压力物质和暗能量结构为特征的空间均匀和各向异性时空的场方程。通过对宇宙天文钟和万神殿数据集的联合分析,推导出模型的哈勃函数,并对其进行约束,从而获得模型参数(H_{0})和(vartheta _{3})在(1sigma )和(2sigma )置信水平下的值。基于这些参数值,我们计算了导出的参数,并通过说明宇宙学量的几何行为来讨论结果。在这种情况下,我们分析了所提出模型的宇宙学和动力学参数的图形行为。稳定性通过声速平方判据进行检验。提出的框架可能潜在地解决宇宙巧合问题。此外,我们通过分析热力学量来评估我们模型的有效性。所有的宇宙学评估都表明,选择合适的模型参数会导致宇宙加速。所建议的模式在早期和现在的时代表现出稳定性,但在后期阶段变得不稳定。
{"title":"Cosmic and thermodynamic analysis of Barrow holographic dark energy model in logarithmic Brans-Dicke gravity","authors":"Y. Aditya,&nbsp;U. Y. Divya Prasanthi,&nbsp;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}
引用次数: 0
Poisson network SIR epidemic model 泊松网络SIR流行病模型
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-16 DOI: 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.

我们在基于网络的框架内研究了经典易感-感染-恢复(SIR)模型的流行扩展,其中节点度遵循泊松分布。首先,我们回顾了该扩展的性质,它与经典SIR模型的联系,以及它与网络上随机流行病的两两闭合条件的关系。然后我们将其应用于数据分析。这种基于网络的公式引入了一个表示平均节点度的附加参数,允许在接触模式中合并异质性。利用扩展SIR模型,采用生存法与哈密顿蒙特卡罗方法相结合的方法,分析了刚果民主共和国2018-2020年埃博拉疫情的流行数据。我们的研究结果表明,基于网络的模型比传统的隔间模型更准确地捕捉到流行病的异质性,而不会引入不必要的额外复杂性。
{"title":"Poisson network SIR epidemic model","authors":"Josephine Wairimu,&nbsp;Andrew Gothard,&nbsp;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}
引用次数: 0
On pseudoprime RSA moduli
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-10 DOI: 10.1007/s13370-025-01338-1
Florian Luca, Dimbinaina Ralaivaosaona, Jorge Jiménez Urroz

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.

2010年,Dieulefait和Urroz考虑了RSA模的延展性的概念。他们证明了,给定一些关于数的素数因子的信息,其中n是RSA模数,存在一种算法可以在时间上找到n的合适因子(O(log n))。作为他们算法的一个特例,只要知道(2^npm 1)的因子就足以分解n除非n是一个以2为基底的伪素数。他们继续证明这些素数因子在z和2z之间的特殊RSA模的集合的大小最多为(O(z^2/(log z)^3))。在本文中,我们显著地改进了这个界,并证明了这些RSA模的计数函数有(O(z^{8/5}/(log z)^2))的上界。此外,作为一个相关问题,我们证明了两个素数乘积的以2为基数的伪素数的个数的上界(O(z^{4/5}/(log z)^{2/5}))。
{"title":"On pseudoprime RSA moduli","authors":"Florian Luca,&nbsp;Dimbinaina Ralaivaosaona,&nbsp;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}
引用次数: 0
The ensemble learning algorithms for prediction high entropy alloys phases 高熵合金相预测的集成学习算法
IF 0.7 Q2 MATHEMATICS Pub Date : 2025-06-06 DOI: 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.

集成学习算法是HEA(s)预测阶段未知的一种统计方法。集成学习算法用于检查相位选择原则,利用401个不同HEAs的大型实验案例研究,包括174个SS, 54个IM和173个SS + IM阶段。与其他集成学习算法相比,随机森林(RF)具有最高的准确性,即在分配HEA时,其确定性比支持向量机(SVM)和k近邻(KNN)高约10%。本文的研究结果表明了所提出算法的有效性和可靠性。因此,研究结果显示了分配HEAs的两个主要优势:首先是决策树的推导和提高了谨慎性,其次是丢失值的自动化。此外,为了验证机器学习结果的实用准确性,给出了TiZrNbCrV、tizrnbbfecr和Ti ZrNbFeV合金的XRD结果。所有合金都处于固溶体状态,没有金属间相。实际结果表明,集成学习算法在实际条件下具有良好的一致性,可以为设计新型高熵合金提供很大的帮助。
{"title":"The ensemble learning algorithms for prediction high entropy alloys phases","authors":"Masoud Yousefi,&nbsp;Khosrow Rahmani,&nbsp;Masoud Rajabi,&nbsp;Ali Reyhani,&nbsp;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}
引用次数: 0
期刊
Afrika Matematika
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1