{"title":"The sl(2)-weight system at c = 3/8 for graphs","authors":"Daniil Fomichev , Maksim Karev","doi":"10.1016/j.ejc.2025.104160","DOIUrl":"10.1016/j.ejc.2025.104160","url":null,"abstract":"<div><div>We construct a 4-invariant that extends the specialization of the <span><math><mrow><mi>sl</mi><mrow><mo>(</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span>-weight system at <span><math><mrow><mi>c</mi><mo>=</mo><mfrac><mrow><mn>3</mn></mrow><mrow><mn>8</mn></mrow></mfrac></mrow></math></span> and satisfies a simple deletion–contraction relation.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"127 ","pages":"Article 104160"},"PeriodicalIF":1.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143895975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Complete threshold dynamics of a reaction–diffusion schistosomiasis model in different time-evolving domains","authors":"Yonghui Ren , Peng Wu","doi":"10.1016/j.chaos.2025.116478","DOIUrl":"10.1016/j.chaos.2025.116478","url":null,"abstract":"<div><div>The significance of river and lake regions in the propagation of schistosomiasis cannot be overlooked, as this disease is transmitted predominantly through water. In this paper, we focus on the complete dynamics of a reaction–diffusion model for schistosomiasis, which accounts for domain that evolve over time. By employing theories of asymptotically autonomous and nonautonomous semiflows, we delineate the global dynamics of the system within domains that are fixed, asymptotically periodic, and bounded, with the dynamics being dictated by the basic reproduction number. Utilizing the sub-and supersolutions method alongside the comparison principle, we substantiate the threshold dynamics of the system in asymptotically unbounded domains. In numerical simulation part, we explore the influence of the evolving domain on the schistosomiasis transmission by comparing the basic reproduction numbers across various domains. Our findings reveal that the asymptotic growth and periodic changes in the size of these areas are pivotal in the transmission of schistosomiasis, with the growth of the regional evolution ratio being particularly conducive to the spread of the disease. These insights suggest that it is imperative for prevention and control authorities to enhance their schistosomiasis countermeasures, especially during the rainy seasons when the risk of transmission is significantly increased.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"197 ","pages":"Article 116478"},"PeriodicalIF":5.3,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143895459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Activation functions enabling the addition of neurons and layers without altering outcomes","authors":"Sergio López-Ureña","doi":"10.1016/j.cam.2025.116730","DOIUrl":"10.1016/j.cam.2025.116730","url":null,"abstract":"<div><div>In this work, we propose activation functions for neuronal networks that are <em>refinable</em> and <em>sum the identity</em>. This new class of activation functions allows the insertion of new layers between existing ones and/or the increase of neurons in a layer, both without altering the network outputs.</div><div>Our approach is grounded in <em>subdivision</em> theory. The proposed activation functions are constructed from basic limit functions of convergent subdivision schemes. As a showcase of our results, we introduce a family of spline activation functions and provide comprehensive details for their practical implementation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116730"},"PeriodicalIF":2.1,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143891462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Targeted attack in spatial networks with minimal collateral damage","authors":"Keyuan Lai , An Zeng","doi":"10.1016/j.chaos.2025.116504","DOIUrl":"10.1016/j.chaos.2025.116504","url":null,"abstract":"<div><div>Targeted attacks in spatial networks have a wide range of applications in real systems such as transportation, power grids, and communication networks, but they may cause collateral damage in systems, so how to develop targeted attacks is an important research problem. This study introduces the reverse gradient attack (RGA), a novel efficient strategy designed to optimize attack precision while minimizing collateral damage. By incorporating spatial constraints and leveraging a gradient-based intensity mapping framework, RGA identifies the optimal attack centers for precise targeted interventions. A comprehensive evaluation across multiple real-world spatial networks demonstrates that RGA outperforms traditional methods in terms of precision and robustness, particularly in scenarios requiring minimal influence to non-target nodes. The study highlights a “black zone” phenomenon, referring to regions where increasing the attack radius paradoxically reduces the effectiveness of the attack, further highlighting the importance of carefully selecting the attack radius. The findings reveal RGA’s effectiveness in both random and topologically clustered target scenarios, suggesting the robustness of the methodology of targeted attacks in spatial networks.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"197 ","pages":"Article 116504"},"PeriodicalIF":5.3,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143891895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Linlin Liu , Liang Cao , Wenshuai Lin , Wenbin Xiao , Xiaomeng Li
{"title":"Improved LESO-based distributed adaptive fixed-time tracking control for vehicle platoon system with input saturation","authors":"Linlin Liu , Liang Cao , Wenshuai Lin , Wenbin Xiao , Xiaomeng Li","doi":"10.1016/j.chaos.2025.116503","DOIUrl":"10.1016/j.chaos.2025.116503","url":null,"abstract":"<div><div>With the continuous advancement of technology and the expansion of applications, vehicle platoon control is an important technology for improving road traffic efficiency and saving energy consumption. This paper proposes a distributed adaptive fixed-time disturbance rejection tracking control strategy with input saturation based on an improved linear extended state observer (LESO), ensuring the convergence of the tracking error. Firstly, a fixed-time controller is constructed to ensure that the system achieves the expected performance. The singularity problems in fixed-time control are effectively solved through power transformation schemes and the use of an input saturation estimator avoids the occurrence of input saturation phenomenon. With the help of the principle of deviation control, the deviation between the state variables and their observed values in LESO is improved. Theoretical proof and simulation demonstrate that the improved LESO can achieve better estimation accuracy. Finally, the control strategy is implemented to the vehicle platoon systems, and simulation results confirm the performance of the control strategy.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"197 ","pages":"Article 116503"},"PeriodicalIF":5.3,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143895458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Jacky III Batkam Mbatchou , Frédéric Patras , Calvin Tcheka
{"title":"Posets, their incidence algebras and relative operads, and the cohomology comparison theorem","authors":"V. Jacky III Batkam Mbatchou , Frédéric Patras , Calvin Tcheka","doi":"10.1016/j.ejc.2025.104162","DOIUrl":"10.1016/j.ejc.2025.104162","url":null,"abstract":"<div><div>Motivated by various developments in algebraic combinatorics and its applications, we investigate here the fine structure of a fundamental but little known theorem, the Gerstenhaber and Schack cohomology comparison theorem. The theorem classically asserts that there is a cochain equivalence between the usual singular cochain complex of a simplicial complex and the relative Hochschild complex of its incidence algebra, and a quasi-isomorphism with the standard Hochschild complex. Here, we will be mostly interested in its application to arbitrary posets (or, equivalently, finite topological spaces satisfying the <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> separation axiom) and their incidence algebras. We construct various structures, classical and new, on the above two complexes: cosimplicial, differential graded algebra, operadic and brace algebra structures and show that the comparison theorem preserves all of them. These results provide non standard insights on links between the theory of posets, incidence algebras, endomorphism operads and finite and combinatorial topology. By <em>non standard</em>, we refer here to the use of <em>relative</em> versions of Hochschild complexes and operads.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"127 ","pages":"Article 104162"},"PeriodicalIF":1.0,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143885987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The diameter of random Schreier graphs","authors":"Daniele Dona , Luca Sabatini","doi":"10.1016/j.ejc.2025.104164","DOIUrl":"10.1016/j.ejc.2025.104164","url":null,"abstract":"<div><div>We give a combinatorial proof of the following theorem. Let <span><math><mi>G</mi></math></span> be any finite group acting transitively on a set of cardinality <span><math><mi>n</mi></math></span>. If <span><math><mrow><mi>S</mi><mo>⊆</mo><mi>G</mi></mrow></math></span> is a random set of size <span><math><mi>k</mi></math></span>, with <span><math><mrow><mi>k</mi><mo>≥</mo><msup><mrow><mrow><mo>(</mo><mo>log</mo><mi>n</mi><mo>)</mo></mrow></mrow><mrow><mn>1</mn><mo>+</mo><mi>ɛ</mi></mrow></msup></mrow></math></span> for some <span><math><mrow><mi>ɛ</mi><mo>></mo><mn>0</mn></mrow></math></span>, then the diameter of the corresponding Schreier graph is <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msub><mrow><mo>log</mo></mrow><mrow><mi>k</mi></mrow></msub><mi>n</mi><mo>)</mo></mrow></mrow></math></span> with high probability. Except for the implicit constant, this result is the best possible.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"127 ","pages":"Article 104164"},"PeriodicalIF":1.0,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143885988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simplified condition for quantile regression","authors":"Liang Peng , Yongcheng Qi","doi":"10.1016/j.spl.2025.110444","DOIUrl":"10.1016/j.spl.2025.110444","url":null,"abstract":"<div><div>Quantile regression is effective in modeling and inferring the conditional quantile given some predictors and has become popular in risk management due to wide applications of quantile-based risk measures. When forecasting risk for economic and financial variables, quantile regression has to account for heteroscedasticity, which raises the question of whether the identification condition on residuals in quantile regression is equivalent to one independent of heteroscedasticity. In this paper, we present some identification conditions under three probability models and use them to establish simplified conditions in quantile regression.</div></div>","PeriodicalId":49475,"journal":{"name":"Statistics & Probability Letters","volume":"224 ","pages":"Article 110444"},"PeriodicalIF":0.9,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899658","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":"Maxitive functions with respect to general orders","authors":"Michael Kupper , José M. Zapata","doi":"10.1016/j.fss.2025.109430","DOIUrl":"10.1016/j.fss.2025.109430","url":null,"abstract":"<div><div>In decision-making, maxitive functions are used for worst-case and best-case evaluations. Maxitivity gives rise to a rich structure that is well-studied in the context of the pointwise order. In this article, we investigate maxitivity with respect to general preorders and provide a representation theorem for such functions. The results are illustrated for different stochastic orders in the literature, including the usual stochastic order, the increasing convex/concave order, and the dispersive order.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"516 ","pages":"Article 109430"},"PeriodicalIF":3.2,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143895974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exploring graphs with distinct M-eigenvalues: Product operation, Wronskian vertices, and controllability","authors":"Haiying Shan, Xiaoqi Liu","doi":"10.1016/j.dam.2025.04.055","DOIUrl":"10.1016/j.dam.2025.04.055","url":null,"abstract":"<div><div>Let <span><math><msup><mrow><mi>G</mi></mrow><mrow><mi>M</mi></mrow></msup></math></span> denote the set of connected graphs with distinct <span><math><mi>M</mi></math></span>-eigenvalues. This paper explores the <span><math><mi>M</mi></math></span>-spectrum and eigenvectors of a new product <span><math><mrow><mi>G</mi><msub><mrow><mo>∘</mo></mrow><mrow><mi>C</mi></mrow></msub><mi>H</mi></mrow></math></span> of graphs <span><math><mi>G</mi></math></span> and <span><math><mi>H</mi></math></span>. We present the necessary and sufficient condition for <span><math><mrow><mi>G</mi><msub><mrow><mo>∘</mo></mrow><mrow><mi>C</mi></mrow></msub><mi>H</mi></mrow></math></span> to have distinct <span><math><mi>M</mi></math></span>-eigenvalues. Specifically, for the rooted product <span><math><mrow><mi>G</mi><mo>∘</mo><mi>H</mi></mrow></math></span>, we present a more concise and precise condition. A key concept, <span><math><mi>M</mi></math></span>-Wronskian vertex, which plays a crucial role in determining graph properties related to separability and construction of specific graph families, is investigated. We propose a novel method for constructing infinite pairs of non-isomorphic <span><math><mi>M</mi></math></span>-cospectral graphs in <span><math><msup><mrow><mi>G</mi></mrow><mrow><mi>M</mi></mrow></msup></math></span> by leveraging the structural properties of <span><math><mi>M</mi></math></span>-Wronskian vertex. Moreover, the necessary and sufficient condition for <span><math><mrow><mi>G</mi><mo>∘</mo><mi>H</mi></mrow></math></span> to be <span><math><mi>M</mi></math></span>-controllable is given.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"373 ","pages":"Pages 125-136"},"PeriodicalIF":1.0,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143890818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}