首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Dedicated to Professor Yuzan He on the Occasion of his 80th Birthday In this paper, we employ the complex method to obtain all meromorphic solutions of an auxiliary ordinary differential equation at first and then find out all meromorphic exact solutions of the combined KdV–mKdV equation and variant Boussinesq equations. Our result shows that all rational and simply periodic exact solutions of the combined KdV–mKdV equation and variant Boussinesq equations are solitary wave solutions, the method is more simple than other methods, and there exist some rational solutions wr,2(z) and simply periodic solutions ws,2(z) that are not only new but also not degenerated successively by the elliptic function solutions. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

2.
Timonov proposes an algorithm for global maximization of univariate Lipschitz functions in which successive evaluation points are chosen in order to ensure at each iteration a maximal expected reduction of the region of indeterminacy, which contains all globally optimal points. It is shown that such an algorithm does not necessarily converge to a global optimum.  相似文献   

3.
Coulter–Matthews (CM) bent functions are from to defined by , where and (α,2n)=1. It is not known if these bent functions are weakly regular in general. In this paper, we show that when n is even and α=n+1 (or n−1), the CM bent function is weakly regular. Moreover, we explicitly determine the dual of the CM bent function in this case. The dual is a bent function not reported previously.  相似文献   

4.
For semi-continuous real functions we study different computability concepts defined via computability of epigraphs and hypographs. We call a real function f lower semi-computable of type one, if its open hypograph hypo(f) is recursively enumerably open in dom(f) × ?; we call f lower semi-computable of type two, if its closed epigraph Epi(f) is recursively enumerably closed in dom(f) × ?; we call f lower semi-computable of type three, if Epi(f) is recursively closed in dom(f) × ?. We show that type one and type two semi-computability are independent and that type three semi-computability plus effectively uniform continuity implies computability, which is false for type one and type two instead of type three. We show also that the integral of a type three semi-computable real function on a computable interval is not necessarily computable.  相似文献   

5.
This paper deals with estimation of production technology where endogeneous choice of input and output variables is explicitly recognized. To address this endogeneity issue, we assume that producers maximize return to the outlay. We start from a flexible (translog) transformation function with a single output and multiple inputs and show how the first-order conditions of maximizing return to the outlay can be used to come up with an ‘estimating equation’ that does not suffer from the econometric endogeneity problem although the output and input variables are chosen endogenously. This is because the regressors in this estimating equation are in ratio forms which are uncorrelated with the error term under the assumption that producers maximize return to the outlay. The analysis is then extended to the multiple outputs and multiple inputs case with technical inefficiency. Although the estimating equations in both single and multiple output cases are neither production nor distance functions, they can be estimated in a straightforward manner using the standard stochastic frontier technique without worrying about endogeneity of the regressors. Thus, we provide a rationale for estimating the technology parameters consistently using an econometric model which requires data on only input and output quantities.  相似文献   

6.
A Wronskian form expansion method is proposed to construct novel composite function solutions to the modified Korteweg-de Vries (mKdV) equation. The method takes advantage of the forms and structures of Wronskian solutions to the mKdV equation, and Wronskian entries do not satisfy linear partial differential equations. The method can be automatically carried out in computer algebra (for example, Maple).  相似文献   

7.
In this paper, we have exhibited, by utilizing value distribution theory, some new properties of the Gamma function Γ(z) and the Riemann zeta function ζ(z). Specifically, we have proved that both of the two functions are prime and the Riemann zeta function, like Γ(z), does not satisfy any algebraic differential equation with coefficients in ??0. Moreover, the two functions do not satisfy any functional equation of the form P(Γ, ζ, z) ≡ 0, where P(x, y, z) is a nonconstant polynomial in x, y and z.  相似文献   

8.
Associated to a lower semicontinuous function, one can define its proximal mapping and farthest mapping. The function is called Chebyshev (Klee) if its proximal mapping (farthest mapping) is single-valued everywhere. We show that the function f is 1/λ-hypoconvex if its proximal mapping Pλf is single-valued. When the function f is bounded below, and Pλf is single-valued for every λ>0, the function must be convex. Similarly, we show that the function f is 1/μ-strongly convex if the farthest mapping Qμf is single-valued. When the function is the indicator function of a set, this recovers the well-known Chebyshev problem and Klee problem in Rn. We also give an example illustrating that a continuous proximal mapping (farthest mapping) needs not be locally Lipschitz, which answers one open question by Hare and Poliquin.  相似文献   

9.
We construct a selfadjoint Akhiezer integral operator S on L 2(?1, 1) with the spectrum {?1; 0; 1} and the property that every function φ(S) that is not a multiple of S fails to be an Akhiezer integral operator.  相似文献   

10.
This paper improves on the results of Noda, Y., Li Baoqing and Song Quodong, and proves the following theorem: Letf(z) be a transcendental meromorphic function. Then the set {aC;(za)f(z) is not prime} is at most a countable set.  相似文献   

11.
This article considers universal optimality of digital nets and lattice designs in a regression model. Based on the equivalence theorem for matrix means and majorization theory,the necessary and sufficient conditions for lattice designs being φp-and universally optimal in trigonometric function and Chebyshev polynomial regression models are obtained. It is shown that digital nets are universally optimal for both complete and incomplete Walsh function regression models under some specified conditions,and are...  相似文献   

12.
A method is introduced for the simultaneous study of the square function and the maximal function of a martingale that can yield sharp norm inequalities between the two. One application is that the expectation of the square function of a martingale is not greater than times the expectation of the maximal function. This gives the best constant for one side of the Davis two-sided inequality. The martingale may take its values in any real or complex Hilbert space. The elementary discrete-time case leads quickly to the analogous results for local martingales indexed by . Some earlier inequalities are also improved and, closely related, the Lévy martingale is embedded in a large family of submartingales.

  相似文献   


13.
I present an inverse function theorem for differentiable maps between Fréchet spaces which contains the classical theorem of Nash and Moser as a particular case. In contrast to the latter, the proof does not rely on the Newton iteration procedure, but on Lebesgue's dominated convergence theorem and Ekeland's variational principle. As a consequence, the assumptions are substantially weakened: the map F to be inverted is not required to be C2, or even C1, or even Fréchet-differentiable.  相似文献   

14.
It has long been known that in order for a subsemigroup of Q +, properly containing {0}, to be perfect, it is necessary that it be non-C-finite. We define quasi-C-finite semigroups in such a way that it is necessary that the semigroup be non-quasi-C-finite. Every C-finite subsemigroup of Q + is quasi-C- finite, but there is a quasi-C-finite subsemigroup of Q + which is not C-finite. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

15.
The standard saddle point method of asymptotic expansions of integrals requires to show the existence of the steepest descent paths of the phase function and the computation of the coefficients of the expansion from a function implicitly defined by solving an inversion problem. This means that the method is not systematic because the steepest descent paths depend on the phase function on hand and there is not a general and explicit formula for the coefficients of the expansion (like in Watson's Lemma for example). We propose a more systematic variant of the method in which the computation of the steepest descent paths is trivial and almost universal: it only depends on the location and the order of the saddle points of the phase function. Moreover, this variant of the method generates an asymptotic expansion given in terms of a generalized (and universal) asymptotic sequence that avoids the computation of the standard coefficients, giving an explicit and systematic formula for the expansion that may be easily implemented on a symbolic manipulation program. As an illustrative example, the well-known asymptotic expansion of the Airy function is rederived almost trivially using this method. New asymptotic expansions of the Hankel function Hn(z) for large n and z are given as non-trivial examples.  相似文献   

16.
We give an iterated function system (IFS) on the plane with the circle as attractor. In doing this, we also give a sufficient condition for radially contracting functions on the plane (or on Rn) to be a contraction. A counterexample shows that radial contractiveness is not enough to be a contraction.  相似文献   

17.
It is not the purpose of this paper to construct approximations but to establish a class of almost periodic functions which can be approximated, with an arbitrarily prescribed accuracy, by continuous periodic functions uniformly on =(+).  相似文献   

18.
We discovered a certain class of linear Hamiltonian maps which are defined by explicit time dependent Hamiltonian functions. Our method is the analogy of Moser's construction in 1986, although it is not so difficult, but we think the results are new.

  相似文献   


19.
On Montel's theorem and Yang's problem   总被引:1,自引:0,他引:1  
Let F be a family of meromorphic functions defined in a domain D, and let ψ be a function meromorphic in D. For every function fF, if (1)f has only multiple zeros; (2) the poles of f have multiplicity at least 3; (3) at the common poles of f and ψ, the multiplicity of f does not equal the multiplicity of ψ; (4)f(z)≠ψ(z), then F is normal in D. This gives a partial answer to a problem of L. Yang, and generalizes Montel's theorem. Some examples are given to show the sharpness of our result.  相似文献   

20.
We prove in this paper that if G is a domain in the complex plane satisfying appropriate topological or geometrical conditions, then there exists a large (dense or closed infinite-dimensional) linear submanifold of boundary-regular holomorphic functions on G all of whose nonzero members are not continuable across any boundary point of G.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号