三物种竞争-扩散系统双稳行波解的波速符号

在双稳竞争-扩散模型中,由于行波解的波速符号可以预测哪些物种更具有优势并最终占据整个栖息地,因此研究行波解的波速符号具有重要的生物学意义.首先将三物种种群Lotka-Volterra竞争-扩散系统转化为合作系统.然后运用比较原理得到双稳波速与波廓方程特定上下解波速的比较原理.最后根据比较原理以及构造合适的上下解,得到一些判断双稳行波解波速符号的充分条件.这些结果能够更好地预测和控制生物种群的竞争结果.     

轴突输运中的行波解

本文对于起源于神经科学的一类轴突输运方程研究了行波解的性质,从数学上解析了神经信号是如何通过行波解传递的.     

强非线性广义 Boussinesq 方程孤波解的波形分析及求解

上海理工大学理学院\quad 上海 200093该文建立了强非线性广义 Boussinesq 方程的耗散项、波速、渐进值与波形函数的导数之间的关系.利用适当变换和待定假设方法,作者求出了上述广义 Boussinesq 方程的扭状或钟状孤波解,还求出了以前文献中未曾提到过的余弦函数的周期波解.进一步给出了波速对波形影响的结论,即:``好'广义 Boussinesq 方程的行波当波速由小变大时,波形由钟状孤波变成余弦函数周期波解;``坏'广义 Boussinesq 方程的行波当波速由小变大时,波形由余弦函数周期波解变成钟状孤波.     

一维反应扩散方程中的行波波速及行波解

通过Painlev啨分析,详细研究了一类一维化学反应扩散方程中的行波解及波速。分别给出了当歼灭项的指数大于创造项的指数及创造项的指数大于歼灭项的指数时,这两种情形下的波速及行波解的显式表示。此外,还给出了一类常见激励介质中的波速及平面波解在薄的边界层内的公式。     

竞争扩散方程一类行波解的存在性与波速估计

本文研究了反应扩散系统．我们用打靶法及关于ＫＰＰ方程的有关结果，得到了行波解的存在性并给出了波速估计．     

一类经典趋化性模型行波解的存在性

该文研究了一类经典趋化性模型Keller-Segel模型行波解的存在性.对Keller-Segel模型中的抛物-抛物型偏微分方程组和抛物型方程,该文研究了它们正行波解的存在性和波速.     

一类广义四阶非线性Camassa-Holm方程的行波解

用动力系统的分支理论研究了一类广义四阶非线性Camassa-Holm方程的动力学行为和行波解,发现方程存在一些孤立波解,周期波解和一些诸如Compacton类型的非光滑行波解.在不同的参数条件下,给出了这些解存在的条件和一些特殊条件下的精确解.     

某些发展方程的渐近波速和行波解研究简介

非线性发展方程渐近波速和行波解的存在性是发展方程理论研究中两个重要课题,因其具有强烈的实际背景和对数学理论提出的许多挑战性问题,正引起愈来愈多数学家的广泛关注,近30多年来,特别是近10年,对一些典型类型发展方程行波解及其相关的最小波速、渐近波速的理论研究得到了迅速发展,涌现出很多代表性的成果,本文力求总结这一领域的最新进展,向读者展示相关问题发展的背景、线索、脉络和重要的研究方法,以期待研究的进一步深入。     

一类广义Zakharov方程的精确行波解

本文研究了一类广义Zakharov方程的精确解行波解的问题.利用改进的G/G展开方法,借助于计算机代数系统Mathematica,获得了具有重要物理背景的广义Zakharov方程一系列新的含有多个参数的精确行波解,这些解包括孤立波解,双曲函数解,三角函数解,以及有理函数解.     

一类具有非线性发生率与时滞的非局部扩散SIR模型的临界波的存在性

研究了一类具有时滞的非局部扩散SIR传染病模型的行波解。首先, 利用反证法证明了I是有界的, 并根据I的有界性研究了波速c>c*时行波解(波速大于最小波速的行波)的存在性。其次，利用c>c*的行波的存在性结果证明了临界波(波速等于最小波速的行波)的存在性。最后, 讨论了R0对临界波存在性的影响.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².