The Boundedness of Composition Operators on Triebel–Lizorkin and Besov Spaces with Different Homogeneities

In this paper, we introduce new Triebel–Lizorkin and Besov Spaces associated with the different homogeneities of two singular integral operators. We then establish the boundedness of composition of two Calder′on–Zygmund singular integral operators with different homogeneities on these Triebel–Lizorkin and Besov spaces.     

Positive solutions for Neumann problems with indefinite and unbounded potential

We consider semilinear Neumann equations with an indefinite and unbounded potential. We establish the existence and uniqueness of positive solutions. We show that our setting incorporates as special cases several parametric equations of interest (such as the equidiffusive logistic equation).     

关于无单位间隔组合数求法的注记

本文指出了文［１］中的错误，给出了其正确结果。     

Where Forward-Looking and Backward-Looking Models Meet

The present paper begins by deriving an instantaneous formulation for the backward-looking (reinforcement based learning) satisfaction balance model of Gray and Tallman (1984). This model is then used to generate interactional data from four simulated agents in a network interaction experiment. Because this initial model does not generate stable interaction structures in the network experiment, it is altered step by step in the direction of a forward-looking (agent with goals) model that has been shown to generate such stable interaction structures. The purpose of the modifications are to learn what aspects of the forward-looking model are needed to evolve a stable interaction structure, and to learn how these aspects may be incorporated into a model that remains essentially reinforcement based.     

STURM COMPARISON THEOREM OF SOLUTION FOR SECOND ORDER NONLINEAR DIFFERENTIAL EQUATIONS

In this paper, we establish some differential identities and obtain some Sturm comparison theorems for the second order nonlinear differential equation by using them.and generalize some classicial Sturm comparison theorems.     

Partition numbers

We continue [21] and study partition numbers of partial orderings which are related to (ω)/fin. In particular, we investigate P_f, be the suborder of ((ω)/fin)^ω containing only filtered elements, the Mathias partial order M, and (ω), (ω)^ω the lattice of (infinite) partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for P_f. We show that the partition number of (ω) is C. We also show that consistently the distributivity number of (ω)^ω is smaller than the distributivity number of (ω)/fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size ₁ does not imply that a Polish space can be partitioned into ₁ many closed sets.