广义神经传播方程的整体吸引子

使用Galerkin方法,结合Sobolev空间理论和不等式技巧,给出了广义神经传播方程解的存在唯一性定理,然后利用吸引子存在性定理,采用半群方法证明了方程整体吸引子的存在性.     

A note on the finite fractal dimension of the global attractors for dissipative nonlinear Schrödinger‐type equations

In this article, we present, throughout two basic models of damped nonlinear Schrödinger (NLS)–type equations, a new idea to bound from above the fractal dimension of the global attractors for NLS‐type equations. This could answer the following open issue: consider, for instance, the classical one‐dimensional cubic nonlinear Schrödinger equation $$u_t+i{u}_{xx}+i|u{|}^{2}u+\gamma u=f,f\in {\mathrm{??}}^2(?).$$ “How can we bound the fractal dimension of the associate global attractor without the need to assume that the external forcing term f has some decay at infinity (that is belonging to some weighted Lebesgue space)?”     

Weighted estimates for the multilinear maximal function on the upper half‐spaces

For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.     

On the global attractor of 2D incompressible turbulence with random forcing

This study revisits bounds on the projection of the global attractor in the energy–enstrophy plane for 2D incompressible turbulence [Dascaliuc, Foias, and Jolly, 2005, 2010]. In addition to providing more elegant proofs of some of the required nonlinear identities, the treatment is extended from the case of constant forcing to the more realistic case of random forcing. Numerical simulations in particular often use a stochastic white-noise forcing to achieve a prescribed mean energy injection rate. The analytical bounds are demonstrated numerically for the case of white-noise forcing.     

Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

关于循环环的理想、素理想和极大理想

研究了循环环R=的理想、素理想和极大理想的个数和结构,得到了如下结论:1)理想:(1)若|R|=∞,则R共有无穷多个理想:;(2)若|R|=n,设n的正因数个数为T(n),则R共有T(n)个理想:.2)素理想:(1)若|R|=∞,设a^2=ka(k≥0),①当k=0时,R的素理想只有R;②当k>0时,R的素理想共有无穷多个,它们是:{0}、R及;(2)若|R|=n>1,设a^2=ka,0≤k.3)极大理想:(1)若|R|=∞,则R有无限多个极大理想,它们是;(2)若|R|=n>1,设n的互不相同的素因数个数为ψ(n),则R共有ψ(n)个极大理想:(pa|p是n的素因数).     

具有复合幂函数和共存吸引子的新混沌系统的动力学分析与电路仿真

构造一个具有复合幂函数的三维连续自治混沌系统。系统的状态方程仅有5项，其中一项是指数小于1的复合幂函数。该系统具有结构简单、非双曲平衡点、吸引子共存的性质，展现出了复杂的动力学行为。首先，对系统的动力学行为进行分析，包括李雅普诺夫（Lyapunov）指数谱、分岔图以及庞加莱映射等，结果表明此系统具有混沌特性。然后进行混沌系统的电路设计，电路仿真结果验证了理论分析的正确性。     

On the Number of k‐Dominating Independent Sets

We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes.