首页 > 最新文献

数学最新文献

英文 中文
IF:
Interlacing property of polynomial sequences related to multinomial coefficients
IF 0.7 3区 数学 Q2 MATHEMATICS Pub Date : 2025-04-05 DOI: 10.1016/j.disc.2025.114522
Ming-Jian Ding
In this paper, we show that several consecutive generating functions of the multinomial coefficients form an interlacing sequence. As applications, we provide a positive response to a question proposed by Fisk regarding the interlacing property for zeros of polynomials, which are generated by the central trinomial (quadrinomial) coefficients.
Furthermore, we prove that some classical polynomial sequences also possess the interlacing property. These sequences include the (weak) exceedance polynomial sequence on involutions in the symmetric group, Motzkin polynomial sequence, local h-polynomial sequences of the cluster subdivision of Cartan-Killing types A, B and D, Narayana polynomial sequences of types A and B, and others.
{"title":"Interlacing property of polynomial sequences related to multinomial coefficients","authors":"Ming-Jian Ding","doi":"10.1016/j.disc.2025.114522","DOIUrl":"10.1016/j.disc.2025.114522","url":null,"abstract":"<div><div>In this paper, we show that several consecutive generating functions of the multinomial coefficients form an interlacing sequence. As applications, we provide a positive response to a question proposed by Fisk regarding the interlacing property for zeros of polynomials, which are generated by the central trinomial (quadrinomial) coefficients.</div><div>Furthermore, we prove that some classical polynomial sequences also possess the interlacing property. These sequences include the (weak) exceedance polynomial sequence on involutions in the symmetric group, Motzkin polynomial sequence, local <em>h</em>-polynomial sequences of the cluster subdivision of Cartan-Killing types <em>A</em>, <em>B</em> and <em>D</em>, Narayana polynomial sequences of types <em>A</em> and <em>B</em>, and others.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 8","pages":"Article 114522"},"PeriodicalIF":0.7,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143777021","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
Universal behavior of the two-times correlation functions of random processes with renewal
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-04-05 DOI: 10.1016/j.chaos.2025.116351
Marco Bianucci , Mauro Bologna , Daniele Lagomarsino-Oneto , Riccardo Mannella
Stochastic processes with renewal properties, or semi-Markovian processes, have emerged as powerful tools for modeling phenomena where the assumption of complete independence between temporally spaced events is unrealistic. These processes find applications across diverse disciplines, including biology, neuroscience, health sciences, social sciences, ecology, climatology, geophysics, oceanography, chemistry, physics, and finance. Investigating their statistical properties is crucial for understanding complex systems. Here we obtain a simple exact expression for the two-times correlation function, a key descriptor of renewal processes, as it determines the power spectrum and impacts the diffusion properties of systems influenced by such processes. Although results for the two-times correlation function have been derived, the exact expression has been evaluated only for some specific cases, as for systems with N states notably the simplest is the dichotomous scenario. By averaging over trajectory realizations, we obtain a universal result for the two-times correlation function, independent of the jump statistics, provided the variance is finite. Under the standard assumption for reaching asymptotic stationarity, where waiting times decay as tμ with μ>2, we show that stationarity depends solely on the first time t1, i.e., the time distance from the preparation time, while the time difference t2t1 is inconsequential. For systems where stationarity is unattainable (1<μ<2), we provide a universal asymptotic form of the correlation function for large t1, extending previous results limited to specific time difference regimes. We examine two interpretations of renewal processes: shot noise and step noise—, relevant to physical systems such as general Continuous Time Random Walks and Lévy walks with random velocities. While this study focuses on two-times correlations, the simple methodology is generalizable to n-times correlations, offering a pathway for future research into the statistical mechanics of renewal processes.
{"title":"Universal behavior of the two-times correlation functions of random processes with renewal","authors":"Marco Bianucci ,&nbsp;Mauro Bologna ,&nbsp;Daniele Lagomarsino-Oneto ,&nbsp;Riccardo Mannella","doi":"10.1016/j.chaos.2025.116351","DOIUrl":"10.1016/j.chaos.2025.116351","url":null,"abstract":"<div><div>Stochastic processes with renewal properties, or semi-Markovian processes, have emerged as powerful tools for modeling phenomena where the assumption of complete independence between temporally spaced events is unrealistic. These processes find applications across diverse disciplines, including biology, neuroscience, health sciences, social sciences, ecology, climatology, geophysics, oceanography, chemistry, physics, and finance. Investigating their statistical properties is crucial for understanding complex systems. Here we obtain a simple exact expression for the two-times correlation function, a key descriptor of renewal processes, as it determines the power spectrum and impacts the diffusion properties of systems influenced by such processes. Although results for the two-times correlation function have been derived, the exact expression has been evaluated only for some specific cases, as for systems with <span><math><mi>N</mi></math></span> states notably the simplest is the dichotomous scenario. By averaging over trajectory realizations, we obtain a universal result for the two-times correlation function, independent of the jump statistics, provided the variance is finite. Under the standard assumption for reaching asymptotic stationarity, where waiting times decay as <span><math><msup><mrow><mi>t</mi></mrow><mrow><mo>−</mo><mi>μ</mi></mrow></msup></math></span> with <span><math><mrow><mi>μ</mi><mo>&gt;</mo><mn>2</mn></mrow></math></span>, we show that stationarity depends solely on the first time <span><math><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>, i.e., the time distance from the preparation time, while the time difference <span><math><mrow><msub><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></math></span> is inconsequential. For systems where stationarity is unattainable (<span><math><mrow><mn>1</mn><mo>&lt;</mo><mi>μ</mi><mo>&lt;</mo><mn>2</mn></mrow></math></span>), we provide a universal asymptotic form of the correlation function for large <span><math><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>, extending previous results limited to specific time difference regimes. We examine two interpretations of renewal processes: shot noise and step noise—, relevant to physical systems such as general Continuous Time Random Walks and Lévy walks with random velocities. While this study focuses on two-times correlations, the simple methodology is generalizable to <span><math><mi>n</mi></math></span>-times correlations, offering a pathway for future research into the statistical mechanics of renewal processes.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"196 ","pages":"Article 116351"},"PeriodicalIF":5.3,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143776567","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
Some applications of canonical metrics to Landau–Ginzburg models
IF 1 2区 数学 Q1 MATHEMATICS Pub Date : 2025-04-05 DOI: 10.1112/jlms.70148
Jacopo Stoppa

It is known that a given smooth del Pezzo surface or Fano threefold X$X$ admits a choice of log Calabi–Yau compactified mirror toric Landau–Ginzburg model (with respect to certain fixed Kähler classes and Gorenstein toric degenerations). Here we consider the problem of constructing a corresponding map Θ$Theta$ from a domain in the complexified Kähler cone of X$X$ to a well-defined, separated moduli space M$mathfrak {M}$ of polarised manifolds endowed with a canonical metric. We prove a complete result for del Pezzos and a partial result for some special Fano threefolds. The construction uses some fundamental results in the theory of constant scalar curvature Kähler metrics. As a consequence M$mathfrak {M}$ parametrises K$K$-stable manifolds and the domain of Θ$Theta$ is endowed with the pullback of a Weil–Petersson form.

{"title":"Some applications of canonical metrics to Landau–Ginzburg models","authors":"Jacopo Stoppa","doi":"10.1112/jlms.70148","DOIUrl":"https://doi.org/10.1112/jlms.70148","url":null,"abstract":"<p>It is known that a given smooth del Pezzo surface or Fano threefold <span></span><math>\u0000 <semantics>\u0000 <mi>X</mi>\u0000 <annotation>$X$</annotation>\u0000 </semantics></math> admits a choice of log Calabi–Yau compactified mirror toric Landau–Ginzburg model (with respect to certain fixed Kähler classes and Gorenstein toric degenerations). Here we consider the problem of constructing a corresponding map <span></span><math>\u0000 <semantics>\u0000 <mi>Θ</mi>\u0000 <annotation>$Theta$</annotation>\u0000 </semantics></math> from a domain in the complexified Kähler cone of <span></span><math>\u0000 <semantics>\u0000 <mi>X</mi>\u0000 <annotation>$X$</annotation>\u0000 </semantics></math> to a well-defined, separated moduli space <span></span><math>\u0000 <semantics>\u0000 <mi>M</mi>\u0000 <annotation>$mathfrak {M}$</annotation>\u0000 </semantics></math> of polarised manifolds endowed with a canonical metric. We prove a complete result for del Pezzos and a partial result for some special Fano threefolds. The construction uses some fundamental results in the theory of constant scalar curvature Kähler metrics. As a consequence <span></span><math>\u0000 <semantics>\u0000 <mi>M</mi>\u0000 <annotation>$mathfrak {M}$</annotation>\u0000 </semantics></math> parametrises <span></span><math>\u0000 <semantics>\u0000 <mi>K</mi>\u0000 <annotation>$K$</annotation>\u0000 </semantics></math>-stable manifolds and the domain of <span></span><math>\u0000 <semantics>\u0000 <mi>Θ</mi>\u0000 <annotation>$Theta$</annotation>\u0000 </semantics></math> is endowed with the pullback of a Weil–Petersson form.</p>","PeriodicalId":49989,"journal":{"name":"Journal of the London Mathematical Society-Second Series","volume":"111 4","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.70148","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143778240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks 带设置和开放式堆垛的一维切割材料问题的数学模型
IF 1 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-04-05 DOI: 10.1007/s10878-025-01276-5
Gabriel Gazzinelli Guimarães, Kelly Cristina Poldi, Mateus Martin

In real-life production, the cutting stock problem is often associated with additional constraints and objectives. Among the auxiliary objectives, two of the most relevant are the minimization of the number of different cutting patterns used and the minimization of the maximum number of simultaneously open stacks. The first auxiliary objective arises in manufacturing environments where the adjustment of the cutting tools when changing the cutting patterns incurs increased costs and time spent in production. The second is crucial to face scenarios where the space near the cutting machine or the number of automatic unloading stations is limited. In this paper, we address the one-dimensional cutting stock problem, considering the additional goals of minimizing the number of different cutting patterns used and the maximum number of simultaneously open stacks. We propose two Integer Linear Programming (ILP) formulations and a Constraint Programming (CP) model for the problem. Moreover, we develop new upper bounds on the frequency of the cutting patterns in a solution and address some special cases in which the problem may be simplified. All three approaches are embedded into an iterative exact framework to find efficient solutions. We perform computational experiments using two sets of instances from the literature. The proposed approaches proved effective in determining the entire Pareto front for small problem instances, and several solutions for medium-sized instances with minimum trim loss, a reduced maximum number of simultaneously open stacks, and a small number of different used cutting patterns.

{"title":"Mathematical models for the one-dimensional cutting stock problem with setups and open stacks","authors":"Gabriel Gazzinelli Guimarães, Kelly Cristina Poldi, Mateus Martin","doi":"10.1007/s10878-025-01276-5","DOIUrl":"https://doi.org/10.1007/s10878-025-01276-5","url":null,"abstract":"<p>In real-life production, the cutting stock problem is often associated with additional constraints and objectives. Among the auxiliary objectives, two of the most relevant are the minimization of the number of different cutting patterns used and the minimization of the maximum number of simultaneously open stacks. The first auxiliary objective arises in manufacturing environments where the adjustment of the cutting tools when changing the cutting patterns incurs increased costs and time spent in production. The second is crucial to face scenarios where the space near the cutting machine or the number of automatic unloading stations is limited. In this paper, we address the one-dimensional cutting stock problem, considering the additional goals of minimizing the number of different cutting patterns used and the maximum number of simultaneously open stacks. We propose two Integer Linear Programming (ILP) formulations and a Constraint Programming (CP) model for the problem. Moreover, we develop new upper bounds on the frequency of the cutting patterns in a solution and address some special cases in which the problem may be simplified. All three approaches are embedded into an iterative exact framework to find efficient solutions. We perform computational experiments using two sets of instances from the literature. The proposed approaches proved effective in determining the entire Pareto front for small problem instances, and several solutions for medium-sized instances with minimum trim loss, a reduced maximum number of simultaneously open stacks, and a small number of different used cutting patterns.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"217 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143782634","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
Superconvergence analysis of the decoupled and linearized mixed finite element methods for unsteady incompressible MHD equations
IF 2.9 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2025-04-05 DOI: 10.1016/j.camwa.2025.03.032
Xiaochen Chu , Xiangyu Shi , Dongyang Shi
The purpose of this article is to explore the superconvergence behavior of the first-order backward-Euler (BE) implicit/explicit fully discrete schemes for the unsteady incompressible MHD equations with low-order mixed finite element method (MFEM) by utilizing the scalar auxiliary variable (SAV) and zero-energy-contribution (ZEC) methods. Through dealing with linear terms in implicit format and nonlinear terms in explicit format, the original problem is decomposed into several subproblems, which effectively reduces the amount of calculation. Particularly, a new high-precision estimation is given, which acts as a requisite role in getting the expected results. Following this, combined with a simple, effective and economic interpolation post-processing approach, the superclose and superconvergence error estimates of the decoupled and linearized fully discrete finite element SAV-BE scheme are rigorously derived. And the derivation process is also applicable to the ZEC-BE scheme. Finally, the corresponding numerical simulations are carried out to confirm the accuracy and reliability of our theoretical findings.
{"title":"Superconvergence analysis of the decoupled and linearized mixed finite element methods for unsteady incompressible MHD equations","authors":"Xiaochen Chu ,&nbsp;Xiangyu Shi ,&nbsp;Dongyang Shi","doi":"10.1016/j.camwa.2025.03.032","DOIUrl":"10.1016/j.camwa.2025.03.032","url":null,"abstract":"<div><div>The purpose of this article is to explore the superconvergence behavior of the first-order backward-Euler (BE) implicit/explicit fully discrete schemes for the unsteady incompressible MHD equations with low-order mixed finite element method (MFEM) by utilizing the scalar auxiliary variable (SAV) and zero-energy-contribution (ZEC) methods. Through dealing with linear terms in implicit format and nonlinear terms in explicit format, the original problem is decomposed into several subproblems, which effectively reduces the amount of calculation. Particularly, a new high-precision estimation is given, which acts as a requisite role in getting the expected results. Following this, combined with a simple, effective and economic interpolation post-processing approach, the superclose and superconvergence error estimates of the decoupled and linearized fully discrete finite element SAV-BE scheme are rigorously derived. And the derivation process is also applicable to the ZEC-BE scheme. Finally, the corresponding numerical simulations are carried out to confirm the accuracy and reliability of our theoretical findings.</div></div>","PeriodicalId":55218,"journal":{"name":"Computers & Mathematics with Applications","volume":"188 ","pages":"Pages 160-182"},"PeriodicalIF":2.9,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143777067","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
Multiplicative Riemann–Liouville fractional integrals and derivatives
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-04-05 DOI: 10.1016/j.chaos.2025.116310
Umut Bas, Abdullah Akkurt, Aykut Has, Huseyin Yildirim
This study explores the connections between fractional calculus, a field that has recently garnered significant research interest, and multiplicative analysis. The introduction provides a comprehensive overview of the historical development and foundational concepts of these areas. The preliminary section outlines key definitions and illustrative examples from multiplicative analysis. The research derives the multiplicative representations of the gamma and beta functions and examines their fundamental properties. Furthermore, generalizations of integrals and derivatives within the framework of multiplicative analysis are formulated, accompanied by explicit formulas for multiplicative integrals and derivatives. Finally, fractional-order multiplicative integral derivatives for selected functions are introduced and visualized through graphical representations, highlighting their practical implications.
{"title":"Multiplicative Riemann–Liouville fractional integrals and derivatives","authors":"Umut Bas,&nbsp;Abdullah Akkurt,&nbsp;Aykut Has,&nbsp;Huseyin Yildirim","doi":"10.1016/j.chaos.2025.116310","DOIUrl":"10.1016/j.chaos.2025.116310","url":null,"abstract":"<div><div>This study explores the connections between fractional calculus, a field that has recently garnered significant research interest, and multiplicative analysis. The introduction provides a comprehensive overview of the historical development and foundational concepts of these areas. The preliminary section outlines key definitions and illustrative examples from multiplicative analysis. The research derives the multiplicative representations of the gamma and beta functions and examines their fundamental properties. Furthermore, generalizations of integrals and derivatives within the framework of multiplicative analysis are formulated, accompanied by explicit formulas for multiplicative integrals and derivatives. Finally, fractional-order multiplicative integral derivatives for selected functions are introduced and visualized through graphical representations, highlighting their practical implications.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"196 ","pages":"Article 116310"},"PeriodicalIF":5.3,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143776566","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
Uniqueness on average of large isoperimetric sets in noncompact manifolds with nonnegative Ricci curvature
IF 3 1区 数学 Q1 MATHEMATICS Pub Date : 2025-04-05 DOI: 10.1002/cpa.22252
Gioacchino Antonelli, Marco Pozzetta, Daniele Semola
Let be a complete Riemannian manifold which is not isometric to , has nonnegative Ricci curvature, Euclidean volume growth, and quadratic Riemann curvature decay. We prove that there exists a set with density 1 at infinity such that for every there is a unique isoperimetric set of volume in ; moreover, its boundary is strictly volume preserving stable. The latter result cannot be improved to uniqueness or strict stability for every large volume. Indeed, we construct a complete Riemannian surface satisfying the previous assumptions and with the following additional property: there exist arbitrarily large and diverging intervals such that isoperimetric sets with volumes exist, but they are neither unique nor do they have strictly volume preserving stable boundaries.
{"title":"Uniqueness on average of large isoperimetric sets in noncompact manifolds with nonnegative Ricci curvature","authors":"Gioacchino Antonelli, Marco Pozzetta, Daniele Semola","doi":"10.1002/cpa.22252","DOIUrl":"https://doi.org/10.1002/cpa.22252","url":null,"abstract":"Let be a complete Riemannian manifold which is not isometric to , has nonnegative Ricci curvature, Euclidean volume growth, and quadratic Riemann curvature decay. We prove that there exists a set with density 1 at infinity such that for every there is a unique isoperimetric set of volume in ; moreover, its boundary is strictly volume preserving stable. The latter result cannot be improved to uniqueness or strict stability for every large volume. Indeed, we construct a complete Riemannian surface satisfying the previous assumptions and with the following additional property: there exist arbitrarily large and diverging intervals such that isoperimetric sets with volumes exist, but they are neither unique nor do they have strictly volume preserving stable boundaries.","PeriodicalId":10601,"journal":{"name":"Communications on Pure and Applied Mathematics","volume":"73 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143782633","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
Bipartite binding number, k-factor and spectral radius of bipartite graphs
IF 0.7 3区 数学 Q2 MATHEMATICS Pub Date : 2025-04-05 DOI: 10.1016/j.disc.2025.114511
Yifang Hao , Shuchao Li , Yuantian Yu
<div><div>The binding number <span><math><mi>b</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of a graph <em>G</em> is the minimum value of <span><math><mo>|</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo><mo>/</mo><mo>|</mo><mi>S</mi><mo>|</mo></math></span> taken over all non-empty subsets <em>S</em> of <span><math><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> such that <span><math><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>≠</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>. The bipartite binding number <span><math><msup><mrow><mi>b</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of a bipartite graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>X</mi><mo>,</mo><mi>Y</mi><mo>)</mo></math></span> is defined to be <span><math><mi>min</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> if <span><math><mi>G</mi><mo>=</mo><msub><mrow><mi>K</mi></mrow><mrow><mo>|</mo><mi>X</mi><mo>|</mo><mo>,</mo><mo>|</mo><mi>Y</mi><mo>|</mo></mrow></msub></math></span> and<span><span><span><math><mi>min</mi><mo>⁡</mo><mrow><mo>{</mo><munder><mi>min</mi><mrow><mtable><mtr><mtd><mo>∅</mo><mo>≠</mo><mi>S</mi><mo>⊆</mo><mi>X</mi></mtd></mtr><mtr><mtd><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>⊊</mo><mi>Y</mi></mtd></mtr></mtable></mrow></munder><mo>⁡</mo><mfrac><mrow><mo>|</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo></mrow><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow></mfrac><mo>,</mo><mspace></mspace><munder><mi>min</mi><mrow><mtable><mtr><mtd><mo>∅</mo><mo>≠</mo><mi>T</mi><mo>⊆</mo><mi>Y</mi></mtd></mtr><mtr><mtd><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>T</mi><mo>)</mo><mo>⊊</mo><mi>X</mi></mtd></mtr></mtable></mrow></munder><mo>⁡</mo><mfrac><mrow><mo>|</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>T</mi><mo>)</mo><mo>|</mo></mrow><mrow><mo>|</mo><mi>T</mi><mo>|</mo></mrow></mfrac><mo>}</mo></mrow></math></span></span></span> otherwise. Fan and Lin <span><span>[9]</span></span> investigated <span><math><mi>b</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> from spectral perspectives, and provided tight sufficient conditions in terms of the spectral radius of a graph <em>G</em> to guarantee <span><math><mi>b</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>⩾</mo><mi>r</mi></math></span>, where <em>r</em> is a positive integer. The study of the existence of <em>k</em>-factors in graphs is a classic problem in graph theory. Fan and Lin <span><span>[9]</span></span> also provided the spectral radius conditions for 1-binding graphs to contain a perfect matching and a 2-factor, respectively. In this paper, we consider the bipartite analogues of those results obtained in <span><span>[9]</sp
{"title":"Bipartite binding number, k-factor and spectral radius of bipartite graphs","authors":"Yifang Hao ,&nbsp;Shuchao Li ,&nbsp;Yuantian Yu","doi":"10.1016/j.disc.2025.114511","DOIUrl":"10.1016/j.disc.2025.114511","url":null,"abstract":"&lt;div&gt;&lt;div&gt;The binding number &lt;span&gt;&lt;math&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; of a graph &lt;em&gt;G&lt;/em&gt; is the minimum value of &lt;span&gt;&lt;math&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;/&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; taken over all non-empty subsets &lt;em&gt;S&lt;/em&gt; of &lt;span&gt;&lt;math&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; such that &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;≠&lt;/mo&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. The bipartite binding number &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; of a bipartite graph &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; is defined to be &lt;span&gt;&lt;math&gt;&lt;mi&gt;min&lt;/mi&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; if &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;K&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; and&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;math&gt;&lt;mi&gt;min&lt;/mi&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mrow&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;munder&gt;&lt;mi&gt;min&lt;/mi&gt;&lt;mrow&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mo&gt;∅&lt;/mo&gt;&lt;mo&gt;≠&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;⊆&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⊊&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;/mrow&gt;&lt;/munder&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;munder&gt;&lt;mi&gt;min&lt;/mi&gt;&lt;mrow&gt;&lt;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mo&gt;∅&lt;/mo&gt;&lt;mo&gt;≠&lt;/mo&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;mo&gt;⊆&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⊊&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;/mrow&gt;&lt;/munder&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; otherwise. Fan and Lin &lt;span&gt;&lt;span&gt;[9]&lt;/span&gt;&lt;/span&gt; investigated &lt;span&gt;&lt;math&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; from spectral perspectives, and provided tight sufficient conditions in terms of the spectral radius of a graph &lt;em&gt;G&lt;/em&gt; to guarantee &lt;span&gt;&lt;math&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⩾&lt;/mo&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;em&gt;r&lt;/em&gt; is a positive integer. The study of the existence of &lt;em&gt;k&lt;/em&gt;-factors in graphs is a classic problem in graph theory. Fan and Lin &lt;span&gt;&lt;span&gt;[9]&lt;/span&gt;&lt;/span&gt; also provided the spectral radius conditions for 1-binding graphs to contain a perfect matching and a 2-factor, respectively. In this paper, we consider the bipartite analogues of those results obtained in &lt;span&gt;&lt;span&gt;[9]&lt;/sp","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 8","pages":"Article 114511"},"PeriodicalIF":0.7,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143777617","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
Quantum-inspired feature extraction model from EEG frequency waves for enhanced schizophrenia detection
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-04-05 DOI: 10.1016/j.chaos.2025.116401
Ateke Goshvarpour

Purpose

Schizophrenia diagnosis remains challenging due to the reliance on subjective clinical assessments and the lack of robust, objective biomarkers. Current neuroimaging methods are often expensive, time-consuming, and may lack specificity, highlighting the need for the development of scalable and accurate diagnostic tools. This study investigates the feasibility of using electroencephalogram (EEG) frequency waves as biomarkers for the detection of schizophrenia, employing a quantum-based feature extraction methodology. The primary objective of this research is to develop an advanced detection methodology that integrates quantum-based feature extraction with sophisticated channel and feature selection techniques. This approach aims to enhance the accuracy and reliability of schizophrenia diagnosis by identifying the most informative EEG channels and features for classification purposes.

Methods

First, EEG frequency bands are extracted using the wavelet packet decomposition technique. Next, three channel selection algorithms prioritize channels based on the highest variance, power, and lowest coefficient of variation. The methodology involves applying discrete quantum analysis for feature extraction, followed by the extraction of statistical measures to create a comprehensive feature set. Feature selection is performed using Minimum Redundancy Maximum Relevance (mRMR) and ReliefF to retain the most relevant and non-redundant features. These features are then analyzed using various classification models, including AdaBoost, Support Vector Machine (SVM), Decision Tree (DT), and K-Nearest Neighbors (KNN).

Results

The findings of the study underscore the superior performance of the mRMR method when combined with variance and coefficient of variation-based channel selection techniques, particularly in the β and θ frequency bands. The KNN classifier achieves 100 % accuracy, sensitivity, and F1 score for the δ, θ, SMR, and β waves under optimal conditions. The mRMR method attains an average accuracy of 92.80 % for δ waves, 95.20 % for θ waves, 92.59 % for SMR waves, and 94.26 % for β waves when used in conjunction with coefficient of variation-based channel selection. In contrast, the ReliefF method demonstrates suboptimal performance in higher frequency bands, such as the γ wave, achieving an average accuracy of only 51.55 % when paired with variance-based channel selection.

Conclusion

The proposed methodology presents a promising approach to improving the accuracy and reliability of schizophrenia diagnosis.
{"title":"Quantum-inspired feature extraction model from EEG frequency waves for enhanced schizophrenia detection","authors":"Ateke Goshvarpour","doi":"10.1016/j.chaos.2025.116401","DOIUrl":"10.1016/j.chaos.2025.116401","url":null,"abstract":"<div><h3>Purpose</h3><div>Schizophrenia diagnosis remains challenging due to the reliance on subjective clinical assessments and the lack of robust, objective biomarkers. Current neuroimaging methods are often expensive, time-consuming, and may lack specificity, highlighting the need for the development of scalable and accurate diagnostic tools. This study investigates the feasibility of using electroencephalogram (EEG) frequency waves as biomarkers for the detection of schizophrenia, employing a quantum-based feature extraction methodology. The primary objective of this research is to develop an advanced detection methodology that integrates quantum-based feature extraction with sophisticated channel and feature selection techniques. This approach aims to enhance the accuracy and reliability of schizophrenia diagnosis by identifying the most informative EEG channels and features for classification purposes.</div></div><div><h3>Methods</h3><div>First, EEG frequency bands are extracted using the wavelet packet decomposition technique. Next, three channel selection algorithms prioritize channels based on the highest variance, power, and lowest coefficient of variation. The methodology involves applying discrete quantum analysis for feature extraction, followed by the extraction of statistical measures to create a comprehensive feature set. Feature selection is performed using Minimum Redundancy Maximum Relevance (mRMR) and ReliefF to retain the most relevant and non-redundant features. These features are then analyzed using various classification models, including AdaBoost, Support Vector Machine (SVM), Decision Tree (DT), and K-Nearest Neighbors (KNN).</div></div><div><h3>Results</h3><div>The findings of the study underscore the superior performance of the mRMR method when combined with variance and coefficient of variation-based channel selection techniques, particularly in the β and θ frequency bands. The KNN classifier achieves 100 % accuracy, sensitivity, and F1 score for the δ, θ, SMR, and β waves under optimal conditions. The mRMR method attains an average accuracy of 92.80 % for δ waves, 95.20 % for θ waves, 92.59 % for SMR waves, and 94.26 % for β waves when used in conjunction with coefficient of variation-based channel selection. In contrast, the ReliefF method demonstrates suboptimal performance in higher frequency bands, such as the γ wave, achieving an average accuracy of only 51.55 % when paired with variance-based channel selection.</div></div><div><h3>Conclusion</h3><div>The proposed methodology presents a promising approach to improving the accuracy and reliability of schizophrenia diagnosis.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"196 ","pages":"Article 116401"},"PeriodicalIF":5.3,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143776574","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
Invariant Sample Measures for Non-autonomous Stochastic Non-local Discrete p-Laplacian Equations with Time Varying Delay and Multiplicative Noises
IF 1.6 2区 数学 Q2 MATHEMATICS, APPLIED Pub Date : 2025-04-05 DOI: 10.1007/s00245-025-10254-6
Wenqiang Zhao, Xia Liu

In this article, a class of non-local stochastic lattice models with fractional powers of the discrete p-Laplacian, incorporating time-varying-distributed delay as well as multiplicative noises at each node, are propounded. First, by utilizing an existence theorem of solutions for infinite ordinary differential equations, we prove the well-posedness of the stochastic equations, whose solution operator admits an NRDS. Besides, the tempered random attractor is constructed for this NRDS. Finally, with the identical conditions, we prove that the solution is jointly continuous in initial time and initial data, and eventually, a family of invariant sample Borel probability measures supported in the random attractors are established in a Banach space (not a Hilbert space) for the corresponding NRDS.

{"title":"Invariant Sample Measures for Non-autonomous Stochastic Non-local Discrete p-Laplacian Equations with Time Varying Delay and Multiplicative Noises","authors":"Wenqiang Zhao,&nbsp;Xia Liu","doi":"10.1007/s00245-025-10254-6","DOIUrl":"10.1007/s00245-025-10254-6","url":null,"abstract":"<div><p>In this article, a class of <i>non-local</i> stochastic lattice models with fractional powers of the discrete <i>p</i>-Laplacian, incorporating time-varying-distributed delay as well as multiplicative noises at each node, are propounded. First, by utilizing an existence theorem of solutions for infinite ordinary differential equations, we prove the well-posedness of the stochastic equations, whose solution operator admits an NRDS. Besides, the tempered random attractor is constructed for this NRDS. Finally, with the identical conditions, we prove that the solution is jointly continuous in initial time and initial data, and eventually, a family of invariant sample Borel probability measures supported in the random attractors are established in a Banach space (not a Hilbert space) for the corresponding NRDS.</p></div>","PeriodicalId":55566,"journal":{"name":"Applied Mathematics and Optimization","volume":"91 3","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143778001","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
期刊
全部 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