首页 > 最新文献

数学最新文献

英文 中文
IF:
How to lose some weight: a practical template syndrome decoding attack
IF 1.6 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-03-07 DOI: 10.1007/s10623-025-01603-1
Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh

We study the hardness of the Syndrome Decoding problem, the base of most code-based cryptographic schemes, such as Classic McEliece, in the presence of side-channel information. We use ChipWhisperer equipment to perform a template attack on Classic McEliece running on an ARM Cortex-M4, and accurately classify the Hamming weights of consecutive 32-bit blocks of the secret error vector (textbf{e}in {{mathbb {F}}}_2^n). With these weights at hand, we optimize Information Set Decoding algorithms. Technically, we demonstrate how to speed up information set decoding via a dimension reduction, additional parity-check equations, and an improved information set search, all derived from the Hamming-weight information. Consequently, using our template attack, we can practically recover an error vector (textbf{e}in {{mathbb {F}}}_2^n) in dimension (n=2197) in a matter of seconds. Without side-channel information, such an instance has a complexity of around 88 bit. We also estimate how our template attack affects the security of the proposed McEliece parameter sets. Roughly speaking, even an error-prone leak of our Hamming weight information leads for (n=3488) to a security drop of 89 bits.

{"title":"How to lose some weight: a practical template syndrome decoding attack","authors":"Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh","doi":"10.1007/s10623-025-01603-1","DOIUrl":"https://doi.org/10.1007/s10623-025-01603-1","url":null,"abstract":"<p>We study the hardness of the Syndrome Decoding problem, the base of most code-based cryptographic schemes, such as Classic McEliece, in the presence of side-channel information. We use ChipWhisperer equipment to perform a template attack on Classic McEliece running on an ARM Cortex-M4, and accurately classify the Hamming weights of consecutive 32-bit blocks of the secret error vector <span>(textbf{e}in {{mathbb {F}}}_2^n)</span>. With these weights at hand, we optimize Information Set Decoding algorithms. Technically, we demonstrate how to speed up information set decoding via a dimension reduction, additional parity-check equations, and an improved information set search, all derived from the Hamming-weight information. Consequently, using our template attack, we can practically recover an error vector <span>(textbf{e}in {{mathbb {F}}}_2^n)</span> in dimension <span>(n=2197)</span> in a matter of seconds. Without side-channel information, such an instance has a complexity of around 88 bit. We also estimate how our template attack affects the security of the proposed McEliece parameter sets. Roughly speaking, even an error-prone leak of our Hamming weight information leads for <span>(n=3488)</span> to a security drop of 89 bits.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"67 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143569772","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}
引用次数: 0
Characterization of trees with second minimum eccentricity energy
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-03-07 DOI: 10.1016/j.dam.2025.02.036
Iswar Mahato
The eccentricity matrix of a connected graph G, denoted by E(G), is obtained from the distance matrix of G by keeping the largest entries in each row and each column, and putting the remaining entries as zero. The eigenvalues of E(G) are the E-eigenvalues of G. The eccentricity energy (or the E-energy) of G is the sum of the absolute values of all E-eigenvalues of G. In this article, we characterize the trees with second minimum E-energy among all trees on n5 vertices.
{"title":"Characterization of trees with second minimum eccentricity energy","authors":"Iswar Mahato","doi":"10.1016/j.dam.2025.02.036","DOIUrl":"10.1016/j.dam.2025.02.036","url":null,"abstract":"<div><div>The eccentricity matrix of a connected graph <span><math><mi>G</mi></math></span>, denoted by <span><math><mrow><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>, is obtained from the distance matrix of <span><math><mi>G</mi></math></span> by keeping the largest entries in each row and each column, and putting the remaining entries as zero. The eigenvalues of <span><math><mrow><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> are the <span><math><mi>E</mi></math></span>-eigenvalues of <span><math><mi>G</mi></math></span>. The eccentricity energy (or the <span><math><mi>E</mi></math></span>-energy) of <span><math><mi>G</mi></math></span> is the sum of the absolute values of all <span><math><mi>E</mi></math></span>-eigenvalues of <span><math><mi>G</mi></math></span>. In this article, we characterize the trees with second minimum <span><math><mi>E</mi></math></span>-energy among all trees on <span><math><mrow><mi>n</mi><mo>≥</mo><mn>5</mn></mrow></math></span> vertices.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"369 ","pages":"Pages 78-87"},"PeriodicalIF":1.0,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143561797","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}
引用次数: 0
Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
IF 0.7 3区 数学 Q2 MATHEMATICS Pub Date : 2025-03-07 DOI: 10.1016/j.disc.2025.114476
Qing Yang, Yingzhi Tian
Luo, Tian and Wu (2022) conjectured that for any tree T with bipartition X and Y, every k-connected bipartite graph G with minimum degree at least k+t, where t=max{|X|,|Y|}, contains a tree TT such that GV(T) is still k-connected. Note that t=m2 when the tree T is the path with order m. In this paper, we prove that every k-connected bipartite graph G with minimum degree at least k+m+12 contains a path P of order m such that GV(P) remains k-connected. This shows that the conjecture is true for paths with odd order. For paths with even order, the minimum degree bound in this paper is the bound in the conjecture plus one.
{"title":"Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs","authors":"Qing Yang,&nbsp;Yingzhi Tian","doi":"10.1016/j.disc.2025.114476","DOIUrl":"10.1016/j.disc.2025.114476","url":null,"abstract":"<div><div>Luo, Tian and Wu (2022) conjectured that for any tree <em>T</em> with bipartition <em>X</em> and <em>Y</em>, every <em>k</em>-connected bipartite graph <em>G</em> with minimum degree at least <span><math><mi>k</mi><mo>+</mo><mi>t</mi></math></span>, where <span><math><mi>t</mi><mo>=</mo><mi>max</mi><mo>⁡</mo><mo>{</mo><mo>|</mo><mi>X</mi><mo>|</mo><mo>,</mo><mo>|</mo><mi>Y</mi><mo>|</mo><mo>}</mo></math></span>, contains a tree <span><math><msup><mrow><mi>T</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>≅</mo><mi>T</mi></math></span> such that <span><math><mi>G</mi><mo>−</mo><mi>V</mi><mo>(</mo><msup><mrow><mi>T</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>)</mo></math></span> is still <em>k</em>-connected. Note that <span><math><mi>t</mi><mo>=</mo><mo>⌈</mo><mfrac><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌉</mo></math></span> when the tree <em>T</em> is the path with order <em>m</em>. In this paper, we prove that every <em>k</em>-connected bipartite graph <em>G</em> with minimum degree at least <span><math><mi>k</mi><mo>+</mo><mo>⌈</mo><mfrac><mrow><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌉</mo></math></span> contains a path <em>P</em> of order <em>m</em> such that <span><math><mi>G</mi><mo>−</mo><mi>V</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> remains <em>k</em>-connected. This shows that the conjecture is true for paths with odd order. For paths with even order, the minimum degree bound in this paper is the bound in the conjecture plus one.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 8","pages":"Article 114476"},"PeriodicalIF":0.7,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563866","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}
引用次数: 0
L-Systems and the Lovász Number
IF 1.1 2区 数学 Q1 MATHEMATICS Pub Date : 2025-03-07 DOI: 10.1007/s00493-025-00136-4
William Linz

Given integers (n> k > 0), and a set of integers (L subset [0, k-1]), an L-system is a family of sets (mathcal {F}subset left( {begin{array}{c}[n] kend{array}}right) ) such that (|F cap F'| in L) for distinct (F, F'in mathcal {F}). L-systems correspond to independent sets in a certain generalized Johnson graph G(nkL), so that the maximum size of an L-system is equivalent to finding the independence number of the graph G(nkL). The Lovász number (vartheta (G)) is a semidefinite programming approximation of the independence number (alpha ) of a graph G. In this paper, we determine the leading order term of (vartheta (G(n, k, L))) of any generalized Johnson graph with k and L fixed and (nrightarrow infty ). As an application of this theorem, we give an explicit construction of a graph G on n vertices with a large gap between the Lovász number and the Shannon capacity c(G). Specifically, we prove that for any (epsilon > 0), for infinitely many n there is a generalized Johnson graph G on n vertices which has ratio (vartheta (G)/c(G) = Omega (n^{1-epsilon })), which improves on all known constructions. The graph G a fortiori also has ratio (vartheta (G)/alpha (G) = Omega (n^{1-epsilon })), which greatly improves on the best known explicit construction.

{"title":"L-Systems and the Lovász Number","authors":"William Linz","doi":"10.1007/s00493-025-00136-4","DOIUrl":"https://doi.org/10.1007/s00493-025-00136-4","url":null,"abstract":"<p>Given integers <span>(n&gt; k &gt; 0)</span>, and a set of integers <span>(L subset [0, k-1])</span>, an <i>L</i>-<i>system</i> is a family of sets <span>(mathcal {F}subset left( {begin{array}{c}[n] kend{array}}right) )</span> such that <span>(|F cap F'| in L)</span> for distinct <span>(F, F'in mathcal {F})</span>. <i>L</i>-systems correspond to independent sets in a certain generalized Johnson graph <i>G</i>(<i>n</i>, <i>k</i>, <i>L</i>), so that the maximum size of an <i>L</i>-system is equivalent to finding the independence number of the graph <i>G</i>(<i>n</i>, <i>k</i>, <i>L</i>). The <i>Lovász number</i> <span>(vartheta (G))</span> is a semidefinite programming approximation of the independence number <span>(alpha )</span> of a graph <i>G</i>. In this paper, we determine the leading order term of <span>(vartheta (G(n, k, L)))</span> of any generalized Johnson graph with <i>k</i> and <i>L</i> fixed and <span>(nrightarrow infty )</span>. As an application of this theorem, we give an explicit construction of a graph <i>G</i> on <i>n</i> vertices with a large gap between the Lovász number and the Shannon capacity <i>c</i>(<i>G</i>). Specifically, we prove that for any <span>(epsilon &gt; 0)</span>, for infinitely many <i>n</i> there is a generalized Johnson graph <i>G</i> on <i>n</i> vertices which has ratio <span>(vartheta (G)/c(G) = Omega (n^{1-epsilon }))</span>, which improves on all known constructions. The graph <i>G</i> <i>a fortiori</i> also has ratio <span>(vartheta (G)/alpha (G) = Omega (n^{1-epsilon }))</span>, which greatly improves on the best known explicit construction.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"127 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143570294","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}
引用次数: 0
wStri spread dynamics in Nilaparvata lugens via discrete mathematical models.
IF 2.2 4区 数学 Q2 BIOLOGY Pub Date : 2025-03-06 DOI: 10.1007/s00285-025-02198-w
Bo Zheng, Huichao Yang, Saber Elaydi, Jianshe Yu

Wolbachia, an intracellular bacterium, is well-known for inducing cytoplasmic incompatibility, which has become a promising and environmentally sustainable strategy for controlling pest populations. The strain wStri, specifically identified in Nilaparvata lugens (brown planthopper), has shown potential for such biocontrol applications. In this study, we develop a comprehensive discrete mathematical model to analyze the dynamics of wStri spread in a mixed population of wStri-infected, wLug-infected, and uninfected Nilaparvata lugens under both constant and periodically varying environmental conditions. Under a constant environment, the model identifies the critical threshold necessary for the successful establishment of wStri within the population. Our analysis reveals that the model exhibits a strong Allee effect, where a population must exceed a certain critical density-the Allee threshold-for the wStri strain to persist and spread. Below this threshold, the wStri strain is likely to be eliminated, failing in pest control efforts. When the environment varies periodically, the model transforms into a non-autonomous periodic discrete model, introducing additional complexity. In this scenario, we derive sufficient conditions that ensure the composition of finitely many Allee maps continues to function as an Allee map. Furthermore, we prove that a unique periodic orbit exists within such a periodic environment. This orbit is characterized as unstable and acts as a threshold, determining whether wStri will establish itself in the population or die out over time. The findings from this model provide critical insights into the conditions under which wStri can be effectively used to control Nilaparvata lugens, particularly in environments that are not constant but fluctuate periodically. These insights have significant implications for the practical deployment of Wolbachia-based biocontrol methods in pest management strategies.

{"title":"wStri spread dynamics in Nilaparvata lugens via discrete mathematical models.","authors":"Bo Zheng, Huichao Yang, Saber Elaydi, Jianshe Yu","doi":"10.1007/s00285-025-02198-w","DOIUrl":"https://doi.org/10.1007/s00285-025-02198-w","url":null,"abstract":"<p><p>Wolbachia, an intracellular bacterium, is well-known for inducing cytoplasmic incompatibility, which has become a promising and environmentally sustainable strategy for controlling pest populations. The strain wStri, specifically identified in Nilaparvata lugens (brown planthopper), has shown potential for such biocontrol applications. In this study, we develop a comprehensive discrete mathematical model to analyze the dynamics of wStri spread in a mixed population of wStri-infected, wLug-infected, and uninfected Nilaparvata lugens under both constant and periodically varying environmental conditions. Under a constant environment, the model identifies the critical threshold necessary for the successful establishment of wStri within the population. Our analysis reveals that the model exhibits a strong Allee effect, where a population must exceed a certain critical density-the Allee threshold-for the wStri strain to persist and spread. Below this threshold, the wStri strain is likely to be eliminated, failing in pest control efforts. When the environment varies periodically, the model transforms into a non-autonomous periodic discrete model, introducing additional complexity. In this scenario, we derive sufficient conditions that ensure the composition of finitely many Allee maps continues to function as an Allee map. Furthermore, we prove that a unique periodic orbit exists within such a periodic environment. This orbit is characterized as unstable and acts as a threshold, determining whether wStri will establish itself in the population or die out over time. The findings from this model provide critical insights into the conditions under which wStri can be effectively used to control Nilaparvata lugens, particularly in environments that are not constant but fluctuate periodically. These insights have significant implications for the practical deployment of Wolbachia-based biocontrol methods in pest management strategies.</p>","PeriodicalId":50148,"journal":{"name":"Journal of Mathematical Biology","volume":"90 4","pages":"38"},"PeriodicalIF":2.2,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143568772","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}
引用次数: 0
Time-Global Regularity of the Navier–Stokes System with Hyper-Dissipation: Turbulent Scenario
IF 2.4 1区 数学 Q1 MATHEMATICS Pub Date : 2025-03-06 DOI: 10.1007/s40818-025-00199-y
Zoran Grujić, Liaosha Xu

The question of whether the hyper-dissipative (HD) Navier-Stokes (NS) system can exhibit spontaneous formation of singularities in the super-critical regime–the hyperviscous effects being represented by a fractional power of the Laplacian, say (beta ), confined to interval (bigl (1, frac{5}{4}bigr ))–has been a major open problem in the mathematical fluid dynamics since the foundational work of J.L. Lions in 1960s. In this work, an evidence of criticality of the Laplacian is presented, more precisely, a class of plausible blow-up scenarios is ruled out as soon as (beta ) is greater than one. While the framework is based on the ‘scale of sparseness’ of the super-level sets of the positive and negative parts of the components of the higher-order derivatives of the velocity previously introduced by the authors, a major novelty in the current work is classification of the HD flows near a potential spatiotemporal singularity in two main categories, ‘homogeneous’ (the case consistent with a near-steady behavior) and ‘non-homogenous’ (the case consistent with the formation and decay of turbulence). The main theorem states that in the non-homogeneous case any (beta ) greater than one prevents a singularity. In order to illustrate the impact of this result in a methodology-free setting, a two-parameter family of dynamically rescaled blow-up profiles is considered, and it is shown that as soon as (beta ) is greater than one, a new region in the parameter space is ruled out. More importantly, the region is a neighborhood (in the parameter space) of the self-similar profile, i.e., the approximately self-similar blow-up, a prime suspect in possible singularity formation, is ruled out for all HD NS models.

{"title":"Time-Global Regularity of the Navier–Stokes System with Hyper-Dissipation: Turbulent Scenario","authors":"Zoran Grujić,&nbsp;Liaosha Xu","doi":"10.1007/s40818-025-00199-y","DOIUrl":"10.1007/s40818-025-00199-y","url":null,"abstract":"<div><p>The question of whether the hyper-dissipative (HD) Navier-Stokes (NS) system can exhibit spontaneous formation of singularities in the super-critical regime–the hyperviscous effects being represented by a fractional power of the Laplacian, say <span>(beta )</span>, confined to interval <span>(bigl (1, frac{5}{4}bigr ))</span>–has been a major open problem in the mathematical fluid dynamics since the foundational work of J.L. Lions in 1960s. In this work, an evidence of criticality of the Laplacian is presented, more precisely, a class of plausible blow-up scenarios is ruled out as soon as <span>(beta )</span> is greater than one. While the framework is based on the ‘scale of sparseness’ of the super-level sets of the positive and negative parts of the components of the higher-order derivatives of the velocity previously introduced by the authors, a major novelty in the current work is classification of the HD flows near a potential spatiotemporal singularity in two main categories, ‘homogeneous’ (the case consistent with a near-steady behavior) and ‘non-homogenous’ (the case consistent with the formation and decay of turbulence). The main theorem states that in the non-homogeneous case any <span>(beta )</span> greater than one prevents a singularity. In order to illustrate the impact of this result in a methodology-free setting, a two-parameter family of dynamically rescaled blow-up profiles is considered, and it is shown that as soon as <span>(beta )</span> is greater than one, a new region in the parameter space is ruled out. More importantly, the region is a neighborhood (in the parameter space) of the self-similar profile, i.e., the approximately self-similar blow-up, a prime suspect in possible singularity formation, is ruled out for all HD NS models.</p></div>","PeriodicalId":36382,"journal":{"name":"Annals of Pde","volume":"11 1","pages":""},"PeriodicalIF":2.4,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s40818-025-00199-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Higher-Order Far-Field Boundary Conditions for Crystalline Defects
IF 2.9 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2025-03-06 DOI: 10.1137/24m165836x
Julian Braun, Christoph Ortner, Yangshuai Wang, Lei Zhang
SIAM Journal on Numerical Analysis, Volume 63, Issue 2, Page 520-541, April 2025.
Abstract. Crystalline materials exhibit long-range elastic fields due to the presence of defects, leading to significant domain size effects in atomistic simulations. A rigorous far-field expansion of these long-range fields identifies low-rank structure in the form of a sum of discrete multipole terms and continuum predictors [J. Braun, T. Hudson, and C. Ortner, Arch. Ration. Mech. Anal., 245 (2022), pp. 1437–1490]. We propose a novel numerical scheme that exploits this low-rank structure to accelerate material defect simulations by minimizing the domain size effects. Our approach iteratively improves the boundary condition, systematically following the asymptotic expansion of the far field. We provide both rigorous error estimates for the method and a range of empirical numerical tests to assess its convergence and robustness.
{"title":"Higher-Order Far-Field Boundary Conditions for Crystalline Defects","authors":"Julian Braun, Christoph Ortner, Yangshuai Wang, Lei Zhang","doi":"10.1137/24m165836x","DOIUrl":"https://doi.org/10.1137/24m165836x","url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 63, Issue 2, Page 520-541, April 2025. <br/> Abstract. Crystalline materials exhibit long-range elastic fields due to the presence of defects, leading to significant domain size effects in atomistic simulations. A rigorous far-field expansion of these long-range fields identifies low-rank structure in the form of a sum of discrete multipole terms and continuum predictors [J. Braun, T. Hudson, and C. Ortner, Arch. Ration. Mech. Anal., 245 (2022), pp. 1437–1490]. We propose a novel numerical scheme that exploits this low-rank structure to accelerate material defect simulations by minimizing the domain size effects. Our approach iteratively improves the boundary condition, systematically following the asymptotic expansion of the far field. We provide both rigorous error estimates for the method and a range of empirical numerical tests to assess its convergence and robustness.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"18 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143570457","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}
引用次数: 0
On the existence and prolongation of infinitesimal isometries on special sub-Riemannian manifolds
IF 1.4 3区 数学 Q1 MATHEMATICS Pub Date : 2025-03-06 DOI: 10.1007/s13324-025-01035-z
Marek Grochowski

In the present paper we deal with (local) infinitesimal isometries of special sub-Riemannian manifolds (a contact and oriented sub-Riemannian manifold is called special if the Reeb vector field is an infinitesimal isometry). The objective of the paper is to find some conditions on such manifolds which allow one to construct, locally around a given point, infinitesimal isometries and then, if possible, to prolong them onto bigger domains. The mentioned conditions are related to the so-called (mathfrak {i}^*)-regular and (mathfrak {i})-regular points, the notions introduced by Nomizu (Ann Math 2:105–120, 1960) in the Riemannian setting and slightly modified by the author.

{"title":"On the existence and prolongation of infinitesimal isometries on special sub-Riemannian manifolds","authors":"Marek Grochowski","doi":"10.1007/s13324-025-01035-z","DOIUrl":"10.1007/s13324-025-01035-z","url":null,"abstract":"<div><p>In the present paper we deal with (local) infinitesimal isometries of special sub-Riemannian manifolds (a contact and oriented sub-Riemannian manifold is called special if the Reeb vector field is an infinitesimal isometry). The objective of the paper is to find some conditions on such manifolds which allow one to construct, locally around a given point, infinitesimal isometries and then, if possible, to prolong them onto bigger domains. The mentioned conditions are related to the so-called <span>(mathfrak {i}^*)</span>-regular and <span>(mathfrak {i})</span>-regular points, the notions introduced by Nomizu (Ann Math 2:105–120, 1960) in the Riemannian setting and slightly modified by the author.</p></div>","PeriodicalId":48860,"journal":{"name":"Analysis and Mathematical Physics","volume":"15 2","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553781","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}
引用次数: 0
Averaging principle for slow-fast SPDEs driven by mixed noises
IF 2.4 2区 数学 Q1 MATHEMATICS Pub Date : 2025-03-06 DOI: 10.1016/j.jde.2025.02.080
Haoyuan Li, Hongjun Gao, Shiduo Qu
This paper investigates a class of slow-fast stochastic partial differential equations driven by fractional Brownian motion and standard Brownian motion. Firstly, the well-posedness for such equations are established. Secondly, we provide the uniform Lp-estimation for slow variable relying on the mild stochastic sewing Lemma. Finally, we obtain the approximate solution for slow variable via averaging principle.
{"title":"Averaging principle for slow-fast SPDEs driven by mixed noises","authors":"Haoyuan Li,&nbsp;Hongjun Gao,&nbsp;Shiduo Qu","doi":"10.1016/j.jde.2025.02.080","DOIUrl":"10.1016/j.jde.2025.02.080","url":null,"abstract":"<div><div>This paper investigates a class of slow-fast stochastic partial differential equations driven by fractional Brownian motion and standard Brownian motion. Firstly, the well-posedness for such equations are established. Secondly, we provide the uniform <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span>-estimation for slow variable relying on the mild stochastic sewing Lemma. Finally, we obtain the approximate solution for slow variable via averaging principle.</div></div>","PeriodicalId":15623,"journal":{"name":"Journal of Differential Equations","volume":"430 ","pages":"Article 113209"},"PeriodicalIF":2.4,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143550948","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}
引用次数: 0
How to tractably compute a productive repair for possibilistic partially ordered DL-LiteR ontologies?
IF 3.2 1区 数学 Q2 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-03-06 DOI: 10.1016/j.fss.2025.109361
Ahmed Laouar , Sihem Belabbes , Salem Benferhat
The lightweight description logic dialect DL-LiteR offers a framework for specifying and reasoning with formal inconsistent ontologies. Basically, an ontology is a knowledge base composed of a TBox, modelling conceptual knowledge of some domain of interest, and an ABox, asserting factual knowledge about specific entities of the domain. Inconsistency in an ontology is usually handled by evaluating queries over maximal conflict-free subsets of the ABox, called data repairs. Several inconsistency-tolerant semantics, with different levels of cautiousness and computational cost, propose strategies for selecting the repairs to consider when deriving new conclusions from an inconsistent ontology. In this paper, we focus on partially ordered ontologies where a partial order relation captures the reliability levels of the ABox elements. We propose a new tractable method, called “Cπ-repair”, which leverages possibility theory in repairing a partially ordered ABox. It proceeds in four steps as follows. First, the partial order relation is extended into a family of total orders, thus inducing as many compatible totally ordered ABoxes. Second, a single repair is computed for each compatible ABox. Third, these repairs are closed deductively in order to improve their productivity, i.e., to derive more facts. Finally, the closed repairs are intersected to produce a single repair for the initial partially ordered ABox. The main contribution of this paper is an equivalent characterization that determines the validity of the conclusions drawn with the “Cπ-repair” method, but without eliciting the compatible ABoxes or computing their repairs. This allows us to establish the tractability of the method by reformulating the problem using the notions of support for an assertion and dominance over the conflicts that arise between the ABox elements. Essentially, the valid conclusions are those derived from the supports that dominate all conflicts. In the last part of the paper, we explore the rationality properties of our method. We show that increasing repair productivity does not alter the satisfaction of the rationality properties. We also discuss the applicability of our proposed method to languages richer than DL-LiteR and to other inconsistency-tolerant semantics.
{"title":"How to tractably compute a productive repair for possibilistic partially ordered DL-LiteR ontologies?","authors":"Ahmed Laouar ,&nbsp;Sihem Belabbes ,&nbsp;Salem Benferhat","doi":"10.1016/j.fss.2025.109361","DOIUrl":"10.1016/j.fss.2025.109361","url":null,"abstract":"<div><div>The lightweight description logic dialect DL-Lite<span><math><msub><mrow></mrow><mrow><mi>R</mi></mrow></msub></math></span> offers a framework for specifying and reasoning with formal inconsistent ontologies. Basically, an ontology is a knowledge base composed of a TBox, modelling conceptual knowledge of some domain of interest, and an ABox, asserting factual knowledge about specific entities of the domain. Inconsistency in an ontology is usually handled by evaluating queries over maximal conflict-free subsets of the ABox, called data repairs. Several inconsistency-tolerant semantics, with different levels of cautiousness and computational cost, propose strategies for selecting the repairs to consider when deriving new conclusions from an inconsistent ontology. In this paper, we focus on partially ordered ontologies where a partial order relation captures the reliability levels of the ABox elements. We propose a new tractable method, called “C<em>π</em>-repair”, which leverages possibility theory in repairing a partially ordered ABox. It proceeds in four steps as follows. First, the partial order relation is extended into a family of total orders, thus inducing as many compatible totally ordered ABoxes. Second, a single repair is computed for each compatible ABox. Third, these repairs are closed deductively in order to improve their productivity, i.e., to derive more facts. Finally, the closed repairs are intersected to produce a single repair for the initial partially ordered ABox. The main contribution of this paper is an equivalent characterization that determines the validity of the conclusions drawn with the “C<em>π</em>-repair” method, but without eliciting the compatible ABoxes or computing their repairs. This allows us to establish the tractability of the method by reformulating the problem using the notions of support for an assertion and dominance over the conflicts that arise between the ABox elements. Essentially, the valid conclusions are those derived from the supports that dominate all conflicts. In the last part of the paper, we explore the rationality properties of our method. We show that increasing repair productivity does not alter the satisfaction of the rationality properties. We also discuss the applicability of our proposed method to languages richer than DL-Lite<span><math><msub><mrow></mrow><mrow><mi>R</mi></mrow></msub></math></span> and to other inconsistency-tolerant semantics.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109361"},"PeriodicalIF":3.2,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143562519","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}
引用次数: 0
期刊
全部 Dokl. Math. Funct. Anal. Appl. J. Homotopy Relat. Struct. J. Math. Fluid Mech. Math. Phys. Anal. Geom. ACTA MATH APPL SIN-E Adv. Nonlinear Stud. Adv. Appl. Clifford Algebras ADV GEOM ALGEBR LOG+ Am. J. Math. Am. Math. Mon. ANN I H POINCARE-PR APPL CATEGOR STRUCT ANN STAT ANN MATH Appl. Numer. Math. Ann. Mat. Pura Appl. Ann. Global Anal. Geom. Arch. Math. Archiv. Math. Logic BIOMETRICS BIOMETRIKA Bull. Math. Sci Bull. Math. Biol. B IRAN MATH SOC Calc. Var. Partial Differ. Equations Bull. Am. Math. Soc. CALCOLO CHAOS SOLITON FRACT CHAOS COMB PROBAB COMPUT COMMUN STAT-THEOR M Commun. Math. Stat. Commun. Pure Appl. Math. C.R. Math. Commun. Pure Appl. Anal. Demonstratio Mathematica Des. Codes Cryptogr. Duke Math. J. Electron. J. Comb. FILOMAT FORUM MATH Fractal and Fractional Geom. Funct. Anal. GRAPH COMBINATOR INTEGR EQUAT OPER TH INT J ALGEBR COMPUT Interfaces Free Boundaries Int. J. Comput. Math. INT J NUMBER THEORY INVENT MATH Int. Math. Res. Not. Int. Stat. Rev. Isr. J. Math. J. Algebra J ALGEBR COMB J. Appl. Math. Comput. J. Appl. Stat. J. Comb. Des. J. Comput. Graphical Stat. J. Complex Networks J. Differ. Equations Appl. J. Differ. Equations J. Dyn. Differ. Equations J. Differ. Geom. J. Funct. Anal. J. Funct. Spaces J. Global Optim. J.Fourier Anal. Appl. J. Graph Theory J. Inequal. Appl. J. Math. Imaging Vision J. Multivar. Anal. J. Symb. Log. Journal of Survey Statistics and Methodology J. Am. Stat. Assoc. Linear Algebra Appl. Math. Z. MATH SLOVACA Math. Modell. Nat. Phenom. Math. Notes Math. Program. MATHEMATICS-BASEL Math. Ann. Math. Proc. Cambridge Philos. Soc. METHODOL COMPUT APPL Math. Comput. MATHEMATIKA Numer. Methods Partial Differ. Equations PHYSICA D Probab. Theory Relat. Fields Proc. Edinburgh Math. Soc. Proc. Am. Math. Soc. Q. Appl. Math. Ric. Mat. Stochastic Models STAT COMPUT TAIWAN J MATH TOPOL METHOD NONL AN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1