https://annalsmcs.org/index.php/amcs/issue/feed Annals of Mathematics and Computer Science 2026-07-21T11:23:58+00:00 Firuz Kamalov admin@annalsmcs.org Open Journal Systems <p><em>Annals of Mathematics and Computer Science</em> (ISSN: 2789-7206) is an international, peer-reviewed journal publishing original research on the mathematics that supports computation and learning, including machine learning and its mathematical foundations, operator theory and spectral analysis, approximation and iterative methods, numerical analysis, stochastic modelling, and discrete structures and algorithms.</p> <p>We uphold rigorous peer review as a cornerstone of scholarly excellence. All articles are open access under the Creative Commons CC BY-NC-ND 4.0 license. As a Crossref member, AMCS assigns a DOI to each published article.</p> <p>The journal charges no publication, submission, or processing fees. The current acceptance rate for publication is 13%. The median time to first decision is 12 days.</p> https://annalsmcs.org/index.php/amcs/article/view/837 New Approach for Analysis of Solution of Certain Fractional Sum-Difference Equations 2026-05-08T10:28:28+00:00 Yogesh Shirole yogeshshirole2611@gmail.com Surykant M. Jodand smjog12@gmail.com This paper investigates a class of nonlinear fractional sum–difference equations in a discrete setting. By converting the considered problem into an equivalent fractional summation equation, fixed point techniques are effectively applied to analyze the behavior of solutions. The existence of solutions is established through the Leray–Schauder alternative, whereas uniqueness is derived using a discrete form of Bihari’s inequality. The obtained results extend several existing works related to fractional discrete systems under suitable growth conditions. Moreover, the developed approach offers an efficient framework for studying nonlinear fractional dynamical models with memory effects arising in discrete fractional calculus. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/850 Innovative Option Pricing Using the Conformable Black Scholes Model 2026-05-17T23:05:09+00:00 Abdessamad AIT BRAHIM abdessamad11117@gmail.com Abdelmajid EL HAJAJI abdessamad11118@gmail.com Khalid HILAL abdessamad1117@gmail.com <p>Fractional calculus has become an important tool in financial modeling due to its ability to capture memory effects and anomalous diffusion observed in financial markets. In this paper, we develop a fractional extension of the classical Black–Scholes option pricing model using the conformable fractional derivative. Owing to its local nature and preservation of key properties of classical differentiation, the conformable derivative allows for an analytically tractable and arbitrage-free framework. We derive the conformable fractional Black–Scholes partial differential equation, obtain closed-form solutions for European options, and provide a financial interpretation of the fractional order parameter.</p> 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/852 Markov and Hidden Markov Models for Genomic Sequence Classification 2026-05-19T03:35:50+00:00 Ali Souleymane DABYE dabye_ali@yahoo.fr Doudou DIAKHATE douds7@yahoo.fr Mamadou Momar FALL mamadoumomar@gmail.com The rapid growth of genomic data generated by high-throughput sequencing technologies has created significant challenges for statistical modeling and sequence classification. In this paper, we investigate genomic sequence classification using probabilistic and machine learning approaches based on Markov chains, Hidden Markov Models (HMMs), and Support Vector Machines (SVMs). Markov and Hidden Markov models are employed to capture local nucleotide dependencies and latent biological structures associated with coding and non-coding regions. Building upon these models, we introduce a hybrid HMM–SVM framework that combines generative likelihood-based features, hidden-state representations, and biologically interpretable compositional descriptors. Experimental results on genomic data demonstrate that the proposed hybrid approach substantially improves classification performance while maintaining biological interpretability. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/860 Some Results on Symmetrized A H-Convexity 2026-05-20T23:38:56+00:00 Jamal El-achky jamal.el-achky@uit.ac.ma The Hermite-Hadamard inequality is applied to several classes of functions in many fields of analysis. This inequality has become a powerful mathematical tool for researchers. The idea of convexity has undergone numerous generalizations and extensions in recent years. This study presents the concept of a symmetrized AH-convex function and proves Hermite-Hadamard type inequalities via symmetrized A H-convex function and symmetrized h-A H-convex function. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/863 Risk Modeling on the BRVM 2026-05-25T07:49:23+00:00 Vini Yves Bernadin LOYARA loyarayves@outlook.com Jean ZONGO jlozongo@yahoo.fr Fabrice OUOBA didifab@yahoo.fr Classical risk measurement models assume normality of returns and linear dependence, which systematically underestimates extreme losses in emerging markets. This paper evaluates two complementary approaches to model the risk of a portfolio of BRVM assets (SONATURG and BOA BF) over 2020–2023. The first uses copulas to capture tail dependence between assets. The second employs Markov chains to model market regime persistence. Results show that the Student's t-copula captures non-zero tail dependence (0.28) and the Markov chain reveals strong regime inertia (probability of staying in same regime above 0.85). Combining both approaches provides a more comprehensive view of risk for BRVM investors. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/864 Adaptive Hybrid B-Spline PINN for Fractional Equations 2026-05-26T10:45:52+00:00 Balaji Padhy balaji.padhy@cutm.ac.in Prabhu Sankardarshi Mahapatra 250506153003@centurionuniv.edu.in Tumbanath Samantara tnsamantara@gmail.com We propose a hybrid numerical framework combining a redefined quintic B-spline collocation method with a Physics-Informed Neural Network (PINN) correction layer for solving nonlinear space-time fractional advection-diffusion-reaction equations. The spatial fractional derivative is discretised via a shifted Grünwald–Letnikov approximation embedded in the B-spline basis, achieving high-order spatial accuracy. The temporal Caputo derivative is handled by an L2-1σ Crank–Nicolson scheme surpassing standard methods. A PINN residual corrector suppresses oscillations in high-Péclet-number regimes without mesh refinement. Adaptive time-stepping reduces computational cost by over 60%. Rigorous stability and convergence analysis are provided. Seven benchmark problems confirm the framework outperforms existing quintic B-spline, spectral, and PINN-only methods by one to two orders of magnitude. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/871 Evaluating Zero-Day Generalisation in VANET Detection 2026-06-01T14:18:42+00:00 Anthony Ibrahim 20230003036@students.cud.ac.ae The rapid expansion of the Internet of Vehicles has introduced security vulnerabilities, requiring robust Intrusion Detection Systems. This study evaluates the generalisation capabilities of Random Forest, XGBoost, Naive Bayes, Logistic Regression and Extra Trees against zero-day vehicular attacks. Using the VeReMi NextGen dataset, the methodology separates known and unseen attacks using the Leave-One-Attack-Out strategy to simulate realistic, unseen threat scenarios. Results demonstrate that while Random Forest excels at identifying known threats, it suffers from overfitting, resulting in a low F1-score for zero-day attacks. Conversely, XGBoost and Extra Trees exhibit more consistent zero-day performance, suggesting improved robustness against novel vehicular attacks. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/873 3D Navier-Stokes Equation with Multivalued Friction 2026-06-02T12:51:01+00:00 Simon ZONGO simonzongo14arti@gmail.com BILA ADOLPHE KYELEM kyeleadoc@yahoo.fr We prove the existence of weak solutions and their continuous dependence on the data for a three-dimensional incompressible Navier-Stokes system subject to multivalued friction boundary conditions, within a Hilbert space framework. Under suitable assumptions, a fixed point argument yields the existence of a solution to the associated perturbed stationary problem. Using nonlinear semigroup theory, we then establish the existence of a mild solution to the non-stationary problem and prove a contraction principle. Finally, by combining the Crandall-Liggett implicit discretization scheme with a priori estimates for the approximating mild solutions, we obtain weak solutions that depend continuously on the initial data. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/884 Approximation on Fixed Point for F-Iterative Scheme 2026-06-10T07:35:57+00:00 Vinod Kumar Sahu vksahu07@gmail.com Yamini Vaishnav Yamini 19yamini1997@gmail.com In this paper, we study the approximation of fixed points of mappings satisfying the (η,θ)-condition in uniformly convex Banach spaces. Using the F-iterative scheme, we establish weak and strong convergence results under suitable assumptions. Our results extend and generalize several existing fixed point theorems, including those for Suzuki-type mappings. Finally, the applicability of the proposed (η,θ)-condition and the associated iterative scheme is demonstrated through an image restoration problem, supported by numerical experiments. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science https://annalsmcs.org/index.php/amcs/article/view/890 Quasilinear Elliptic Equations via Gradient-Form-Boundedness 2026-06-25T09:39:25+00:00 Mykola Yaremenko Math.kiev@gmail.com This paper studies the Dirichlet problem for quasilinear elliptic equations with singular coefficients, extending the classical Ladyzhenskaya-Ural'tseva theory. We replace the standard L-r-integrability condition (with r greater than n) with a more flexible p-gradient-form-boundedness assumption. Under this weakened hypothesis, we establish local and global a priori estimates, existence of weak solutions, and Holder continuity of bounded weak solutions. The results hold on arbitrary bounded open sets without boundary regularity requirements. 2026-07-21T00:00:00+00:00 Copyright (c) 2026 Annals of Mathematics and Computer Science