π π andK¯K channel coupling

We investigate the origin of the attraction in theK¯K channel around the threshold by introducing an additional channel to theππ andK¯K channels in a separable potential formalism assuming, in general, no direct interaction in theK¯K channel. To reproduce the features of the data, we find that the threshold of the additional channel is much above thef ₀(975) meson position. We show that this three-channel problem can be reduced to an effective two-channel problem where thef ₀(975) behaves as if it were aK¯K molecule bound by the coupling to the exotic channel. This picture is also supported by the fact that a single pole only, in the complexK¯K momentum plane, is associated to thef ₀(975) meson. Various physical observables, like the decay branching ratio and theK¯K scattering length, are then discussed in an effective two-channel framework.     

An invariance of geometric mean with respect to Lagrangian means

The invariance of the geometric mean G with respect to the Lagrangian mean-type mapping (Lf,Lg), i.e. the equation G○(Lf,Lg)=G, is considered. We show that the functions f and g must be of high class regularity. This fact allows to reduce the problem to a differential equation and determine the second derivatives of the generators f and g.     

Monotonic solutions of a quadratic integral equation of fractional order

In the paper we indicate an error made in the proof of the main result of the paper [M.A. Darwish, On quadratic integral equation of fractional orders, J. Math. Anal. Appl. 311 (2005) 112-119]. Moreover, we provide correct proof of a slightly modified version of the mentioned result. The main tool used in our proof is the technique associated with the Hausdorff measure of noncompactness.     

逆序数的应用

本文通过“1 4-1 5”智力玩具和最优戴断切割问题两个实例 ,讨论了逆序数在解决实际问题中的应用     

Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.     

Nonlinear second-order equations with functional implicit impulses and nonlinear functional boundary conditions

In this paper we deal with nonlinear second-order boundary value problems with impulses. The impulsive functions depend implicitly on the different considered variables and the boundary value conditions are nonlinear. In both cases functional dependence on the solution is allowed. The existence results follow from the existence of a pair of well-ordered lower and upper solutions.     

Generalization of a sharp Hölder's inequality and its application

In this paper, we generalize Hu Ke's sharpness of Hölder's inequality. As application, the obtained result is used to improve the well-known Opial-Olech inequality.     

Shadowing with multidimensional time in Banach spaces

We study linear dynamical systems with multidimensional time in Banach spaces. Using Taylor functional calculus we prove that under additional assumptions hyperbolic systems have shadowing property.