LIPSCHITZ ESTIMATES FOR MULTILINEAR SINGULAR INTEGRALS,Ⅱ

In this paper, the authors study two classes of multilinear singular integrals and obtain their boundedness from Lebesgue spaces to Lipschitz spaces and from Herz type spaces to central Campanato spaces. Moreover, the authors also consider the extreme cases.     

Banach空间中具有数列的渐近拟非扩张型映象的不动点及其具有误差的Ishikawa迭代逼近

1引言及相关定义 引文[1～5]讨论了渐近非扩张映象和渐近非扩张型映象不动点的迭代逼近问题.文[6]改进了文[1]中条件,将T由渐近非扩张型映象推广到T是渐近拟非扩张型映象.     

2-噻吩甲胺的合成研究

以2-噻吩甲醛为原料,通过与盐酸羟胺的肟化反应制得2-噻吩甲醛肟,然后将其在氢氧化钠水溶液中用锌粉还原生成了2-噻吩甲胺。提供了一条合成2-噻吩甲胺的新路线,2步反应的总收率为64%。文中对上述2步反应的条件分别进行了优化。考察了溶液酸碱度,温度和时间对肟化反应的影响,并     

Steiner tree packing number and tree connectivity

Let $S$ be a set of at least two vertices in a graph $G$. A subtree $T$ of $G$ is a $S$-Steiner tree if $S?V\left(T\right)$. Two $S$-Steiner trees $T_1$ and $T_2$ are edge-disjoint (resp. internally vertex-disjoint) if $E\left(T_1\right)\cap E\left(T_2\right)=?$ (resp. $E\left(T_1\right)\cap E\left(T_2\right)=?$ and $V\left(T_1\right)\cap V\left(T_2\right)=S$). Let ${\lambda }_G\left(S\right)$ (resp. ${\kappa }_G\left(S\right)$) be the maximum number of edge-disjoint (resp. internally vertex-disjoint) $S$-Steiner trees in $G$, and let ${\lambda }_k\left(G\right)$ (resp. ${\kappa }_k\left(G\right)$) be the minimum ${\lambda }_G\left(S\right)$ (resp. ${\kappa }_G\left(S\right)$) for $S$ ranges over all $k$-subset of $V\left(G\right)$. Kriesell conjectured that if ${\lambda }_G\left(\{x,y\}\right)\ge 2k$ for any $x,y\in S$, then ${\lambda }_G\left(S\right)\ge k$. He proved that the conjecture holds for $\left|S\right|=3,4$. In this paper, we give a short proof of Kriesell’s Conjecture for $\left|S\right|=3,4$, and also show that ${\lambda }_k\left(G\right)\ge ?\frac{1}{k?1}?\frac{k?}{2}??$ (resp. ${\kappa }_k\left(G\right)\ge ?\frac{1}{k?1}?\frac{k?}{2}??$ ) if $\lambda \left(G\right)\ge ?$ (resp. $\kappa \left(G\right)\ge ?$) in $G$, where $k=3,4$. Moreover, we also study the relation between ${\kappa }_k\left(L\left(G\right)\right)$ and ${\lambda }_k\left(G\right)$, where $L\left(G\right)$ is the line graph of $G$.     

New algebraic structures from Hermitian one-matrix model

Virasoro constraint is the operator algebra version of one-loop equation for a Hermitian one-matrix model, and it plays an important role in solving the model. We construct the realization of the Virasoro constraint from the Conformal Field Theory (CFT) method. From multi-loop equations of the one-matrix model, we get a more general constraint. It can be expressed in terms of the operator algebras, which is the Virasoro subalgebra with extra parameters. In this sense, we named as generalized Virasoro constraint. We enlarge this algebra with central extension, this is a new kind of algebra, and the usual Virasoro algebra is its subalgebra. And we give a bosonic realization of its subalgebra.     

Almost Automorphic Dynamics of Generalized Li\'enard Equation

In this study, we focus on the solutions of the Li\''enard equation being bounded in the future and characterize the almost automorphic, asymptotically almost automorphic, and weighted pseudo almost automorphic dynamics. An example is presented to illustrate the main findings.     

Explicit exact periodic wave solutions and their limit forms for a long waves-short waves model

A long waves-short waves model is studied by using the approach of dynamical systems. The sufficient conditions to guarantee the existence of solitary wave, kink and anti-kink waves, and periodic wave in different regions of the parametric space are given. All possible explicit exact parametric representations of above traveling waves are presented. When the energy of Hamiltonian system corresponding to this model varies, we also show the convergence of the periodic wave solutions, such as the periodic wave solutions converge to the solitary wave solutions, kink and anti-kink wave solutions, and periodic wave solutions, respectively.     

Algorithm of Barrier Objective Penalty Function

In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm.