首页 > 最新文献

数学最新文献

英文 中文
IF:
Set-theoretically perfect ideals and residual intersections
IF 1 2区 数学 Q1 MATHEMATICS Pub Date : 2025-03-06 DOI: 10.1112/jlms.70108
S. Hamid Hassanzadeh

This paper studies algebraic residual intersections in rings with Serre's condition Ss$ S_{s}$. It demonstrates that a wide class of residual intersections is set theoretically perfect. This fact leads to determining a uniform upper bound for the multiplicity of residual intersections. In positive characteristic, it follows that residual intersections are cohomologically complete intersection, and hence, their variety is connected in codimension 1.

本文研究了具有塞尔条件 S s $ S_{s}$ 的环中的代数残交。它证明了一大类残交在集合论上是完美的。这一事实导致确定了残差交叉多重性的统一上限。在正特征中,剩余交集是同调完全交集,因此它们的种类在标引维数 1 中是连通的。
{"title":"Set-theoretically perfect ideals and residual intersections","authors":"S. Hamid Hassanzadeh","doi":"10.1112/jlms.70108","DOIUrl":"https://doi.org/10.1112/jlms.70108","url":null,"abstract":"<p>This paper studies algebraic residual intersections in rings with Serre's condition <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>S</mi>\u0000 <mi>s</mi>\u0000 </msub>\u0000 <annotation>$ S_{s}$</annotation>\u0000 </semantics></math>. It demonstrates that a wide class of residual intersections is set theoretically perfect. This fact leads to determining a uniform upper bound for the multiplicity of residual intersections. In positive characteristic, it follows that residual intersections are cohomologically complete intersection, and hence, their variety is connected in codimension 1.</p>","PeriodicalId":49989,"journal":{"name":"Journal of the London Mathematical Society-Second Series","volume":"111 3","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143564679","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
Solutions to Strongly Indefinite Chern-Simons-Schrödinger Systems
IF 1.2 4区 数学 Q2 MATHEMATICS, APPLIED Pub Date : 2025-03-06 DOI: 10.1007/s10440-025-00719-9
Jin Deng

In this paper, we consider the following Chern-Simons-Schrödinger system

where (u in H^{1}(mathbb{R}^{2})), (p > 4), (A_{alpha }: mathbb{R}^{2} rightarrow mathbb{R}) are the components of the gauge potential, (N: mathbb{R}^{2} rightarrow mathbb{R}) is a neutral scalar field, (V(x)) is a periodic potential function, the parameters (kappa , q>0) represent the Chern-Simons coupling constant and the Maxwell coupling constant, respectively, and (e>0) is the coupling constant. We prove that system ((P)) has a nontrivial solution by using a new infinite-dimensional linking theorem.

在本文中,我们考虑如下的切尔恩-西蒙斯-薛定谔系统,其中 (u (in H^{1}(mathbb{R}^{2})), (p > 4), (A_{alpha }: mathbb{R}^{2} rightarrow mathbb{R})是规势的分量, (N:是中性标量场,(V(x))是周期势函数,参数((kappa , q>0)分别代表切尔-西蒙斯耦合常数和麦克斯韦耦合常数,(e>0)是耦合常数。我们利用一个新的无穷维链接定理证明系统 ((P)) 有一个非难解。
{"title":"Solutions to Strongly Indefinite Chern-Simons-Schrödinger Systems","authors":"Jin Deng","doi":"10.1007/s10440-025-00719-9","DOIUrl":"10.1007/s10440-025-00719-9","url":null,"abstract":"<div><p>In this paper, we consider the following Chern-Simons-Schrödinger system </p><div><figure><div><div><picture><img></picture></div></div></figure></div><p> where <span>(u in H^{1}(mathbb{R}^{2}))</span>, <span>(p &gt; 4)</span>, <span>(A_{alpha }: mathbb{R}^{2} rightarrow mathbb{R})</span> are the components of the gauge potential, <span>(N: mathbb{R}^{2} rightarrow mathbb{R})</span> is a neutral scalar field, <span>(V(x))</span> is a periodic potential function, the parameters <span>(kappa , q&gt;0)</span> represent the Chern-Simons coupling constant and the Maxwell coupling constant, respectively, and <span>(e&gt;0)</span> is the coupling constant. We prove that system <span>((P))</span> has a nontrivial solution by using a new infinite-dimensional linking theorem.</p></div>","PeriodicalId":53132,"journal":{"name":"Acta Applicandae Mathematicae","volume":"196 1","pages":""},"PeriodicalIF":1.2,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143553786","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
Non-smoothable homeomorphisms of 4-manifolds with boundary
IF 1.5 1区 数学 Q1 MATHEMATICS Pub Date : 2025-03-06 DOI: 10.1016/j.aim.2025.110191
Daniel Galvin , Roberto Ladu
We construct the first examples of non-smoothable self-homeomorphisms of smooth 4-manifolds with boundary that fix the boundary and act trivially on homology. As a corollary, we construct self-diffeomorphisms of 4-manifolds with boundary that fix the boundary and act trivially on homology but cannot be isotoped to any self-diffeomorphism supported in a collar of the boundary and, in particular, are not isotopic to any generalised Dehn twist.
{"title":"Non-smoothable homeomorphisms of 4-manifolds with boundary","authors":"Daniel Galvin ,&nbsp;Roberto Ladu","doi":"10.1016/j.aim.2025.110191","DOIUrl":"10.1016/j.aim.2025.110191","url":null,"abstract":"<div><div>We construct the first examples of non-smoothable self-homeomorphisms of smooth 4-manifolds with boundary that fix the boundary and act trivially on homology. As a corollary, we construct self-diffeomorphisms of 4-manifolds with boundary that fix the boundary and act trivially on homology but cannot be isotoped to any self-diffeomorphism supported in a collar of the boundary and, in particular, are not isotopic to any generalised Dehn twist.</div></div>","PeriodicalId":50860,"journal":{"name":"Advances in Mathematics","volume":"467 ","pages":"Article 110191"},"PeriodicalIF":1.5,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143552551","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
A class of ternary codes with few weights
IF 1.6 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2025-03-06 DOI: 10.1007/s10623-025-01605-z
Kaimin Cheng

Let (ell ^m) be a power with (ell ) a prime greater than 3 and (m) a positive integer such that 3 is a primitive root modulo (2ell ^m). Let (mathbb {F}_3) be the finite field of order 3, and let (mathbb {F}) be the (ell ^{m-1}(ell -1))-th extension field of (mathbb {F}_3). Denote by (text {Tr}) the absolute trace map from (mathbb {F}) to (mathbb {F}_3). For any (alpha in mathbb {F}_3) and (beta in mathbb {F}), let (D) be the set of nonzero solutions in (mathbb {F}) to the equation (text {Tr}(x^{frac{q-1}{2ell ^m}} + beta x) = alpha ). In this paper, we investigate a ternary code (mathcal {C}) of length (n), defined by (mathcal {C}:= {(text {Tr}(d_1x), text {Tr}(d_2x), dots , text {Tr}(d_nx)): x in mathbb {F}}) when we rewrite (D = {d_1, d_2, dots , d_n}). Using recent results on explicit evaluations of exponential sums, the Weil bound, and combinatorial techniques, we determine the Hamming weight distribution of the code (mathcal {C}). Furthermore, we show that when (alpha = beta = 0), the dual code of (mathcal {C}) is optimal with respect to the Hamming bound.

{"title":"A class of ternary codes with few weights","authors":"Kaimin Cheng","doi":"10.1007/s10623-025-01605-z","DOIUrl":"https://doi.org/10.1007/s10623-025-01605-z","url":null,"abstract":"<p>Let <span>(ell ^m)</span> be a power with <span>(ell )</span> a prime greater than 3 and <span>(m)</span> a positive integer such that 3 is a primitive root modulo <span>(2ell ^m)</span>. Let <span>(mathbb {F}_3)</span> be the finite field of order 3, and let <span>(mathbb {F})</span> be the <span>(ell ^{m-1}(ell -1))</span>-th extension field of <span>(mathbb {F}_3)</span>. Denote by <span>(text {Tr})</span> the absolute trace map from <span>(mathbb {F})</span> to <span>(mathbb {F}_3)</span>. For any <span>(alpha in mathbb {F}_3)</span> and <span>(beta in mathbb {F})</span>, let <span>(D)</span> be the set of nonzero solutions in <span>(mathbb {F})</span> to the equation <span>(text {Tr}(x^{frac{q-1}{2ell ^m}} + beta x) = alpha )</span>. In this paper, we investigate a ternary code <span>(mathcal {C})</span> of length <span>(n)</span>, defined by <span>(mathcal {C}:= {(text {Tr}(d_1x), text {Tr}(d_2x), dots , text {Tr}(d_nx)): x in mathbb {F}})</span> when we rewrite <span>(D = {d_1, d_2, dots , d_n})</span>. Using recent results on explicit evaluations of exponential sums, the Weil bound, and combinatorial techniques, we determine the Hamming weight distribution of the code <span>(mathcal {C})</span>. Furthermore, we show that when <span>(alpha = beta = 0)</span>, the dual code of <span>(mathcal {C})</span> is optimal with respect to the Hamming bound.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"17 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143569770","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
Sparse systems with high local multiplicity
IF 1 2区 数学 Q1 MATHEMATICS Pub Date : 2025-03-06 DOI: 10.1112/jlms.70106
Frédéric Bihan, Alicia Dickenstein, Jens Forsgård
<p>Consider a sparse system of <span></span><math> <semantics> <mi>n</mi> <annotation>$n$</annotation> </semantics></math> Laurent polynomials in <span></span><math> <semantics> <mi>n</mi> <annotation>$n$</annotation> </semantics></math> variables with complex coefficients and support in a finite lattice set <span></span><math> <semantics> <mi>A</mi> <annotation>$mathcal {A}$</annotation> </semantics></math>. The maximal number of isolated roots of the system in the torus <span></span><math> <semantics> <msup> <mrow> <mo>(</mo> <msup> <mi>C</mi> <mo>∗</mo> </msup> <mo>)</mo> </mrow> <mi>n</mi> </msup> <annotation>$(mathbb {C}^*)^n$</annotation> </semantics></math> is known to be the normalized volume of the convex hull of <span></span><math> <semantics> <mi>A</mi> <annotation>$mathcal {A}$</annotation> </semantics></math> (the BKK bound). We explore the following question: if the cardinality of <span></span><math> <semantics> <mi>A</mi> <annotation>$mathcal {A}$</annotation> </semantics></math> equals <span></span><math> <semantics> <mrow> <mi>n</mi> <mo>+</mo> <mi>m</mi> <mo>+</mo> <mn>1</mn> </mrow> <annotation>$n+m+1$</annotation> </semantics></math>, what is the maximum local intersection multiplicity at one point in the torus in terms of <span></span><math> <semantics> <mi>n</mi> <annotation>$n$</annotation> </semantics></math> and <span></span><math> <semantics> <mi>m</mi> <annotation>$m$</annotation> </semantics></math>? This study was initiated by Gabrielov [13] in the multivariate case. We give an upper bound that is always sharp when <span></span><math> <semantics> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <annotation>$m=1$</annotation> </semantics></math> and, under a technical hypothesis, it is considerably smaller than the previous upper bound for any dimension <span></span><math> <semantics> <mi>n</mi> <annotation>$n$</annotation> </semantics></math> and codimension <span></span><math> <semantics> <mi>m</mi> <annotation>$m$</annotation
{"title":"Sparse systems with high local multiplicity","authors":"Frédéric Bihan,&nbsp;Alicia Dickenstein,&nbsp;Jens Forsgård","doi":"10.1112/jlms.70106","DOIUrl":"https://doi.org/10.1112/jlms.70106","url":null,"abstract":"&lt;p&gt;Consider a sparse system of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;annotation&gt;$n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; Laurent polynomials in &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;annotation&gt;$n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; variables with complex coefficients and support in a finite lattice set &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;A&lt;/mi&gt;\u0000 &lt;annotation&gt;$mathcal {A}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. The maximal number of isolated roots of the system in the torus &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;C&lt;/mi&gt;\u0000 &lt;mo&gt;∗&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$(mathbb {C}^*)^n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is known to be the normalized volume of the convex hull of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;A&lt;/mi&gt;\u0000 &lt;annotation&gt;$mathcal {A}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; (the BKK bound). We explore the following question: if the cardinality of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;A&lt;/mi&gt;\u0000 &lt;annotation&gt;$mathcal {A}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; equals &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$n+m+1$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, what is the maximum local intersection multiplicity at one point in the torus in terms of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;annotation&gt;$n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 &lt;annotation&gt;$m$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;? This study was initiated by Gabrielov [13] in the multivariate case. We give an upper bound that is always sharp when &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$m=1$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and, under a technical hypothesis, it is considerably smaller than the previous upper bound for any dimension &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;annotation&gt;$n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and codimension &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 &lt;annotation&gt;$m$&lt;/annotation","PeriodicalId":49989,"journal":{"name":"Journal of the London Mathematical Society-Second Series","volume":"111 3","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143554363","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
Light-fueled self-ejecting liquid crystal elastomer launcher inspired by lizard tail autotomy
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-06 DOI: 10.1016/j.chaos.2025.116265
Zhuangzhuang Zhang, Yunlong Qiu, Kai Li
Self-oscillating systems can autonomously generate and sustain periodic motion without the need for an external periodic driving force. However, conventional self-oscillating systems often require materials capable of rapid responses to external stimuli. Inspired by the survival strategy of lizards shedding their tails to escape danger, this paper designs a self-ejecting liquid crystal elastomer launcher powered by steady illumination, which eliminates the need for materials to respond quickly to external stimuli through detachment mechanism. The mechanical model of the launcher is established based on the photothermally-responsive liquid crystal elastomer model, followed by an investigation of the dynamic behaviors of photo-driven self-ejection, including alternating up-ejection and down-ejection. The calculations show that self-ejection results from the competition between the tension in the liquid crystal elastomer fiber and the adhesive force of the adhesive plates. The critical conditions for self-ejection are primarily influenced by the photo-driven contraction of the fiber. Additionally, the period of self-ejection is composed of durations of the up-ejection and the down-ejection. For given critical photo-driven contractions, the duration of the up-ejection depends on the contraction coefficient of the fiber and the photothermal power, while the duration of the down-ejection remains constant. Compared to existing self-oscillating systems, this launcher features a simple structure, rapid energy release, and independence from the material's fast response to stimuli. The results of this study provide broader design concepts for applications in soft robotics, sensors, and energy harvesters.
{"title":"Light-fueled self-ejecting liquid crystal elastomer launcher inspired by lizard tail autotomy","authors":"Zhuangzhuang Zhang,&nbsp;Yunlong Qiu,&nbsp;Kai Li","doi":"10.1016/j.chaos.2025.116265","DOIUrl":"10.1016/j.chaos.2025.116265","url":null,"abstract":"<div><div>Self-oscillating systems can autonomously generate and sustain periodic motion without the need for an external periodic driving force. However, conventional self-oscillating systems often require materials capable of rapid responses to external stimuli. Inspired by the survival strategy of lizards shedding their tails to escape danger, this paper designs a self-ejecting liquid crystal elastomer launcher powered by steady illumination, which eliminates the need for materials to respond quickly to external stimuli through detachment mechanism. The mechanical model of the launcher is established based on the photothermally-responsive liquid crystal elastomer model, followed by an investigation of the dynamic behaviors of photo-driven self-ejection, including alternating up-ejection and down-ejection. The calculations show that self-ejection results from the competition between the tension in the liquid crystal elastomer fiber and the adhesive force of the adhesive plates. The critical conditions for self-ejection are primarily influenced by the photo-driven contraction of the fiber. Additionally, the period of self-ejection is composed of durations of the up-ejection and the down-ejection. For given critical photo-driven contractions, the duration of the up-ejection depends on the contraction coefficient of the fiber and the photothermal power, while the duration of the down-ejection remains constant. Compared to existing self-oscillating systems, this launcher features a simple structure, rapid energy release, and independence from the material's fast response to stimuli. The results of this study provide broader design concepts for applications in soft robotics, sensors, and energy harvesters.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"194 ","pages":"Article 116265"},"PeriodicalIF":5.3,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563505","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
Infinitely many solutions for impulsive fractional Schrödinger-Kirchhoff-type equations involving p-Laplacian via variational method
IF 3 2区 数学 Q1 MATHEMATICS Pub Date : 2025-03-05 DOI: 10.1007/s13540-025-00380-x
Yi Wang, Lixin Tian

In this paper, we provide new multiplicity results for a class of impulsive fractional Schrödinger-Kirchhoff-type equations involving p-Laplacian and Riemann-Liouville derivatives. By using the variational method and critical point theory, we obtain that the impulsive fractional problem has infinitely many solutions under appropriate hypotheses when the parameter (lambda ) lies in different intervals.

{"title":"Infinitely many solutions for impulsive fractional Schrödinger-Kirchhoff-type equations involving p-Laplacian via variational method","authors":"Yi Wang, Lixin Tian","doi":"10.1007/s13540-025-00380-x","DOIUrl":"https://doi.org/10.1007/s13540-025-00380-x","url":null,"abstract":"<p>In this paper, we provide new multiplicity results for a class of impulsive fractional Schrödinger-Kirchhoff-type equations involving <i>p</i>-Laplacian and Riemann-Liouville derivatives. By using the variational method and critical point theory, we obtain that the impulsive fractional problem has infinitely many solutions under appropriate hypotheses when the parameter <span>(lambda )</span> lies in different intervals.</p>","PeriodicalId":48928,"journal":{"name":"Fractional Calculus and Applied Analysis","volume":"16 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143546505","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
Gaussian Process Regression under Computational and Epistemic Misspecification
IF 2.9 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2025-03-05 DOI: 10.1137/23m1624749
Daniel Sanz-Alonso, Ruiyi Yang
SIAM Journal on Numerical Analysis, Volume 63, Issue 2, Page 495-519, April 2025.
Abstract. Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper investigates the effect of such kernel approximations on the interpolation error. We introduce a unified framework to analyze Gaussian process regression under important classes of computational misspecification: Karhunen–Loève expansions that result in low-rank kernel approximations, multiscale wavelet expansions that induce sparsity in the covariance matrix, and finite element representations that induce sparsity in the precision matrix. Our theory also accounts for epistemic misspecification in the choice of kernel parameters.
{"title":"Gaussian Process Regression under Computational and Epistemic Misspecification","authors":"Daniel Sanz-Alonso, Ruiyi Yang","doi":"10.1137/23m1624749","DOIUrl":"https://doi.org/10.1137/23m1624749","url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 63, Issue 2, Page 495-519, April 2025. <br/> Abstract. Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper investigates the effect of such kernel approximations on the interpolation error. We introduce a unified framework to analyze Gaussian process regression under important classes of computational misspecification: Karhunen–Loève expansions that result in low-rank kernel approximations, multiscale wavelet expansions that induce sparsity in the covariance matrix, and finite element representations that induce sparsity in the precision matrix. Our theory also accounts for epistemic misspecification in the choice of kernel parameters.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"91 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143561189","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
Beak-type breathers and rogue waves for a coupled Hirota system with the negative coherent coupling in an optical fiber
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-05 DOI: 10.1016/j.chaos.2025.116177
Shao-Hua Liu, Bo Tian, Xiao-Tian Gao
In this paper, we investigate a coupled Hirota system with the negative coherent coupling in an optical fiber. Via an existing binary Darboux transformation, we obtain the vector one and two-peak beak-type Akhmediev breathers on the nonzero backgrounds. Besides, we also get the diverse vector rogue waves such as the vector eye-shaped rogue wave and vector beak-type rogue wave.
{"title":"Beak-type breathers and rogue waves for a coupled Hirota system with the negative coherent coupling in an optical fiber","authors":"Shao-Hua Liu,&nbsp;Bo Tian,&nbsp;Xiao-Tian Gao","doi":"10.1016/j.chaos.2025.116177","DOIUrl":"10.1016/j.chaos.2025.116177","url":null,"abstract":"<div><div>In this paper, we investigate a coupled Hirota system with the negative coherent coupling in an optical fiber. Via an existing binary Darboux transformation, we obtain the vector one and two-peak beak-type Akhmediev breathers on the nonzero backgrounds. Besides, we also get the diverse vector rogue waves such as the vector eye-shaped rogue wave and vector beak-type rogue wave.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"194 ","pages":"Article 116177"},"PeriodicalIF":5.3,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143552093","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
Effect of electromagnetic radiation on double-loop neural networks and its application to image encryption
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-03-05 DOI: 10.1016/j.chaos.2025.116208
Qiang Lai, Yidan Chen
Neurons often exhibit complex chaotic phenomena when they are electrically stimulated, and this property provides an important theoretical basis for the study of neural dynamics. In this paper, a novel double-loop neural network model is proposed to simulate electromagnetic radiation by introducing a simple quadratic function memristor, which acts on different neurons in the neural network, and systematically investigates the differential effects of electromagnetic radiation on the kinetic behaviour of neurons. It is found that the system exhibits rich dynamical phenomena, such as the coexistence of chaotic attractors and amplitude modulation, as the target neurons are changed. When electromagnetic radiation is applied to a specific neuron, the chaotic attractor breaks down with the change of a key parameter. The physical realizability of the theoretical model is verified by a digital circuit platform built with a microcontroller, and the experimental results are demonstrated. In addition, an efficient bit-level image encryption algorithm is designed based on the chaotic properties of this neural network model. The algorithm obfuscates the image pixel dimensions by a parity hopping diffusion operation and combines with chaotic sequences to randomize the arrangement of pixel positions, which significantly improves the security of the encryption scheme. Finally, the encryption performance of the algorithm is verified by various evaluation means.
{"title":"Effect of electromagnetic radiation on double-loop neural networks and its application to image encryption","authors":"Qiang Lai,&nbsp;Yidan Chen","doi":"10.1016/j.chaos.2025.116208","DOIUrl":"10.1016/j.chaos.2025.116208","url":null,"abstract":"<div><div>Neurons often exhibit complex chaotic phenomena when they are electrically stimulated, and this property provides an important theoretical basis for the study of neural dynamics. In this paper, a novel double-loop neural network model is proposed to simulate electromagnetic radiation by introducing a simple quadratic function memristor, which acts on different neurons in the neural network, and systematically investigates the differential effects of electromagnetic radiation on the kinetic behaviour of neurons. It is found that the system exhibits rich dynamical phenomena, such as the coexistence of chaotic attractors and amplitude modulation, as the target neurons are changed. When electromagnetic radiation is applied to a specific neuron, the chaotic attractor breaks down with the change of a key parameter. The physical realizability of the theoretical model is verified by a digital circuit platform built with a microcontroller, and the experimental results are demonstrated. In addition, an efficient bit-level image encryption algorithm is designed based on the chaotic properties of this neural network model. The algorithm obfuscates the image pixel dimensions by a parity hopping diffusion operation and combines with chaotic sequences to randomize the arrangement of pixel positions, which significantly improves the security of the encryption scheme. Finally, the encryption performance of the algorithm is verified by various evaluation means.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"194 ","pages":"Article 116208"},"PeriodicalIF":5.3,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143552144","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