{"title":"A note on Erdős’s mysterious remark","authors":"Zoltán Kovács","doi":"10.1007/s10472-025-09998-2","DOIUrl":"10.1007/s10472-025-09998-2","url":null,"abstract":"<div><p>We give an alternative proof of the statement, by using elimination from algebraic geometry, that the only set <span>(Ssubset mathbb {R}^2)</span>, <span>(left| Sright| =6)</span> such that all subsets that form a triangle are isosceles triangles, is the regular pentagon with its center. Our proof can be extended to answer some related questions raised by Erdős.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 5","pages":"867 - 879"},"PeriodicalIF":1.6,"publicationDate":"2026-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149331230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Weakest sufficient conditions of HML under weak bisimulation in communicating systems","authors":"Xin Zhou, Yisong Wang, Renyan Feng, Jonas Hansen, Panfeng Chen, Hongbo Hu, Songhang Xu","doi":"10.1007/s10472-025-09996-4","DOIUrl":"10.1007/s10472-025-09996-4","url":null,"abstract":"<div><p>Ubiquitous reactive systems compute by reacting to stimuli from their environment. Their concurrence, nondeterminism and communication behaviours can usually be captured in the well-known Calculus of Communicating Systems (CCS), among other methods. Reactive systems usually suffer from changes related to fixing bugs or new requirements. This paper concerns the problem of automated revision of reactive systems for new requirements in some principle and observable way: A component should remain unchanged unless modification is necessary from the perspective of external observers. For this purpose, this paper generalizes the weak bisimulation of the CCS to given actions and presents a weak forgetting to logically discard given actions for the observable Hennessy-Milner Logic <span>(varvec{mathcal {H}}^{varvec{O}})</span>, which can capture the behaviour equivalence of the CCS under weak bisimulation. Finally, the weakest sufficient condition for <span>(varvec{mathcal {H}}^{varvec{O}})</span> theories is established via weak forgetting. This sufficient condition provides a theoretical foundation for automated revision of reactive systems (CCS) under the desired principle when the new requirements are expressed as <span>(varvec{mathcal {H}}^{varvec{O}})</span> formulas.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 5","pages":"701 - 737"},"PeriodicalIF":1.6,"publicationDate":"2026-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09996-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149331298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On shallow feedforward neural networks with inputs from a topological space","authors":"Vugar E. Ismailov","doi":"10.1007/s10472-026-10003-7","DOIUrl":"10.1007/s10472-026-10003-7","url":null,"abstract":"<div><p>We study feedforward neural networks with inputs from a topological space (TFNNs). We prove a universal approximation theorem for shallow TFNNs, which demonstrates their capacity to approximate any continuous function defined on this topological space. As an application, we obtain an approximative version of Kolmogorov’s superposition theorem for compact metric spaces.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 5","pages":"689 - 700"},"PeriodicalIF":1.6,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149331229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Universum support vector machines with elastic net loss and RoBoSS loss","authors":"Ping Li","doi":"10.1007/s10472-025-10002-0","DOIUrl":"10.1007/s10472-025-10002-0","url":null,"abstract":"<div><p>Support vector machine with Universum data (USVM) is an effective algorithm which utilizes the prior information embedded in Universum data to improve its generalization ability. However, the <span>(l_{1})</span>-loss adopted by USVM has an irrationality in geometric definition, which makes it unable to accurately reflect the location information of violated samples, thus degrading the model’s performance to some extent. To address the above limitation, we propose a novel elastic net support vector machine with Universum data (ENUSVM). It adopts the elastic net loss instead of <span>(l_{1})</span>-loss to achieve a one-to-one mapping between the training samples and the slack variables. This improvement makes it more reasonable in geometric definition and thus improves the performance. Further, we derive the violation tolerance upper bound for labeled samples and Universum samples to better interpret the numerical relationship between the distance of violated samples and the slack variables. Experiments on three artificial datasets and twenty benchmark datasets prove that our proposed ENUSVM performs better. Finally, to enhance the robustness of USVM, we incorporate the RoBoSS loss and propose the least squares RoBoSS USVM (<span>( mathcal {L}_{RoBoSS})</span>-USVM). The performance is evaluated on five diverse UCI and KEEL datasets (with and without noise).</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"577 - 603"},"PeriodicalIF":1.6,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Combinatorial and algorithmic analysis of oriented hierarchies in statistical implicative analysis","authors":"Fidy Andrianarivony, Vlady Ravelomanana, Jean-Claude Régnier, Angelo Raherinirina","doi":"10.1007/s10472-025-10001-1","DOIUrl":"10.1007/s10472-025-10001-1","url":null,"abstract":"<div><p>This paper introduces a novel and more efficient method for constructing oriented hierarchies within the framework of Statistical Implicative Analysis. The primary focus of this study is the computational complexity of the original algorithm proposed by Gras, whose cubic time complexity is established in this work. To address this limitation, a detailed combinatorial analysis of hierarchical structures is performed, leveraging tools from analytic combinatorics. This methodology facilitates the enumeration of the number of possible configurations as a function of input size and enables the investigation of both the depth and width characteristics of the hierarchy’s block structure. This study then proposes a reconstruction algorithm based on a formal correspondence between the statistical implication graph and the oriented hierarchy. The proposed method achieves quadratic worst-case complexity, thereby resulting in a substantial improvement in computational performance. Moreover, the analytic framework also makes it possible to characterise the average-case behaviour of the algorithm. The findings of the comparative computational experiments demonstrate the clear advantage of the proposed method over Gras’s algorithm, both in terms of execution time and overall algorithmic efficiency.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"605 - 646"},"PeriodicalIF":1.6,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A MaxSAT-based framework for computing circumscription","authors":"Zhongtao Xie, Yisong Wang, Lei Yang, Hongbo Hu","doi":"10.1007/s10472-025-09997-3","DOIUrl":"10.1007/s10472-025-09997-3","url":null,"abstract":"<div><p>The circumscription is an elegant non-monotonic logic. However, computing circumscription remains challenging due to its computational complexity. This paper presents a weighted partial Maximum Satisfiability (MaxSAT) encoding approach that addresses circumscription, allowing us to leverage state-of-the-art MaxSAT solvers for efficient computation. This approach introduces a linear-time encoding scheme that captures both parallel and prioritized circumscription without requiring fresh predicates. Furthermore, we develop a systematic model enumeration strategy using blocking clauses, which enables the complete and efficient enumeration of circumscription models while avoiding redundancy. Extensive experiments have been conducted on benchmarks such as model-based circuit diagnostics, random and industrial SAT problems, and extended stable marriage problems. The results indicate that our MaxSAT-based implementation, <span>circ-maxsat</span>, achieves comparable performance with state-of-the-art methods such as <span>circ2dlp</span> and <span>aspino</span>. Notably, <span>circ-maxsat</span> outperforms other solvers on the (extended) stable marriage problem in terms of computational efficiency. This study advances the computation of circumscription and introduces new applications of MaxSAT in non-monotonic reasoning.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 4","pages":"549 - 576"},"PeriodicalIF":1.6,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148926683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards an effective use of preferences in argumentation frameworks: extension = consistency + preferences","authors":"Sung-Jun Pyon, Yong-Sok Ri","doi":"10.1007/s10472-025-09990-w","DOIUrl":"10.1007/s10472-025-09990-w","url":null,"abstract":"<div><p>In this paper, we present a hypothesis: ‘<i>extension</i> = <i>consistency</i> + <i>preferences</i>’. It implies, on the one hand, that an extension of an argumentation framework under one of Dung’s standard semantics consists of arguments which are mutually consistent and on the other hand, that the extension is preferred to any of the non-extensions with respect to a certain relation based on some argument preferences. We propose a way of comparing consistent sets of arguments on the basis of argument preferences, which is similar to that widely used in structured argumentation frameworks for inferring the relative strength of arguments from an ordering over rules or premises. Under some constraints, i.e., when the attack relation of an argumentation framework is symmetric, when the given preference relation is strict and total or when we gain argument preferences only from the asymmetric attacks between arguments, the best sets of arguments with respect to the democratic relation exactly coincide with the extensions under standard semantics. Therefore, such a relation makes it possible to integrate two roles of preferences in preference-based argumentation frameworks. Furthermore, the relation enables us to propose a so-called preference-based semantics, in which argument extensions are identified according to the relation taken from asymmetric attacks between arguments. For example, stable extensions of an abstract argumentation framework coincide with the best sets among the maximally conflict-free sets of the framework with respect to the proposed relation.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 5","pages":"647 - 687"},"PeriodicalIF":1.6,"publicationDate":"2025-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149331301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xicheng Peng, Jingzhong Zhang, Mao Chen, Sannyuya Liu
{"title":"Heuristic strategies for geometry theorem extension based on complex number identity*","authors":"Xicheng Peng, Jingzhong Zhang, Mao Chen, Sannyuya Liu","doi":"10.1007/s10472-025-09988-4","DOIUrl":"10.1007/s10472-025-09988-4","url":null,"abstract":"<div><p>In previous research on geometric theorem proving, the primary focus has been on the feasibility of successfully proving specific theorems. Typically, once a theorem was successfully proven, little attention was given to revisiting the process to explore the potential value of the proof results. However, effectively leveraging the geometric knowledge obtained from the proving process is a crucial and underexplored research area. Building upon the complex number identity method—an automated geometric theorem proving approach—and the corresponding complex number identities derived from geometric theorems, this paper introduces an automatic geometric theorem extension algorithm. The algorithm begins by transforming the obtained complex number identity and reinterpreting the geometric significance of each complex number term. It then determines the coordinates of points that satisfy the given geometric conditions by solving equations. Finally, it employs coordinate plotting to generate new geometric propositions. Experimental evaluations on over 300 geometric theorems demonstrate that this automatic extension algorithm not only expands a single geometric theorem into multiple related propositions but also broadens its applicability and reveals underlying connections among different geometric theorems.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 5","pages":"751 - 772"},"PeriodicalIF":1.6,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149331300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel intrusion detection framework using ensemble learning in MQTT IoT applications","authors":"Mitesh Solanki, Shilpi Gupta","doi":"10.1007/s10472-025-09993-7","DOIUrl":"10.1007/s10472-025-09993-7","url":null,"abstract":"<div><p>The Internet of Things (IoT) ecosystem increasingly relies on the Message Queuing and Telemetry Transport (MQTT) protocol due to its lightweight and efficient communication capabilities. However, MQTT-enabled networks are vulnerable to various security threats, including eavesdropping, weak authentication, and malicious payload injections. Detecting such intrusions is particularly challenging in IoT environments because of constrained resources, high traffic volumes, and heterogeneous attack vectors. To address these challenges, this study proposes an ensemble learning-based Intrusion Detection System (IDS) specifically designed for MQTT-enabled IoT networks. The ensemble integrates Gaussian Naive Bayes (GNB), Kernel-based Support Vector Machines (K-SVM), and Multi-Layer Perceptrons (MLP) as base classifiers, with Logistic Regression serving as the meta-classifier. Among these, MLP plays a pivotal role by leveraging its deep learning capabilities and parallel processing strengths to capture complex, nonlinear attack patterns that are often missed by conventional models. The combination of diverse classifiers in a stacked architecture significantly enhances the system’s precision, scalability, and adaptability. Experimental evaluation of binary and multi-class classification tasks using the MQTT-IoT-IDS2020 dataset demonstrate that the proposed model achieves outstanding detection accuracies of 99.80% and 99.59%, respectively, outperforming traditional machine learning and standalone deep learning approaches. These results highlighted the effectiveness of the ensemble framework, particularly the critical contribution of MLP, in building a robust, high-performance, and scalable intrusion detection solution for secure IoT communications.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 3","pages":"395 - 417"},"PeriodicalIF":1.6,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148613088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space","authors":"Roman V. Belavkin","doi":"10.1007/s10472-025-09987-5","DOIUrl":"10.1007/s10472-025-09987-5","url":null,"abstract":"<div><p>Inspired by Fisher’s geometric approach to study beneficial mutations, we analyse probabilities of beneficial mutation and crossover recombination of strings in a general Hamming space with arbitrary finite alphabet. Mutations and recombinations that reduce the distance to an optimum are considered as beneficial. Geometric and combinatorial analysis is used to derive closed-form expressions for transition probabilities between spheres around an optimum giving a complete description of Markov evolution of distances from an optimum over multiple generations. This paves the way for optimization of parameters of mutation and recombination operators. Here we derive optimality conditions for mutation and recombination radii maximizing the probabilities of mutation and crossover into the optimum. The analysis highlights important differences between these evolutionary operators. While mutation can potentially reach any part of the search space, the probability of beneficial mutation decreases with distance to an optimum, and the optimal mutation radius or rate should also decrease resulting in a slow-down of evolution near the optimum. Crossover recombination, on the other hand, acts in a subspace of the search space defined by the current population of strings. However, probabilities of beneficial and deleterious crossover are balanced, and their characteristics, such as variance, are translation invariant in a Hamming space, suggesting that recombination may complement mutation and boost the rate of evolution near the optimum.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 1","pages":"127 - 161"},"PeriodicalIF":1.0,"publicationDate":"2025-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09987-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}