The problem addressed is the exact determination of the operator norm and lower bound of four-dimensional generalized Hausdorff matrices on the double sequence spaces L_(p).A Hardy type formulae is found as an exact v...
supported by the National Natural Science Foundation of China(11301546).supported by the National Natural Science Foundation of China(11271147,11471136)
The objective of this paper is to study the issue of uniformity on asymmetrical designs with two and three mixed levels in terms of Lee discrepancy. Based on the known formulation, we present a new lower bound of Lee ...
Li et al. in [3] obtained blow-up results for a system of Petrovskey equations in some different cases. In this article we obtain lower bounds for the blow up time under some considerations on initial data.
Project supported by the Academic Human Resources Development in Institutions of Higher Learning under the Jurisdiction of Beijing Municipality (IHLB201008257);Scientific Research Common Program of Beijing Municipal Commission of Education (KM200810011005);PHR (IHLB 201102);research grant of University of Macao MYRG142(Y1-L2)-FST111-KKI
The main objective is to derive a lower bound from an upper one for harmonic functions in the half space, which extends a result of B. Y. Levin from dimension 2 to dimension n 〉 2. To this end, we first generalize th...
supported by the NSFC(10801105;30871444);the Key Project of Natural Science of Anhui Provincial Department of Education(KJ2009A44);the Doctoral Special Fund of Hefei University of Technology(GDBJ2010-012);the Key Project of Science and Technology of Anhui Province(08010302070)
In this paper, we give a lower bound exp(2.2 × 10~8 ) for those discriminants of real quadratic fields Q(√ d) with d= N^2-4 and h(d)=1.
This work is partially supported by D.G.Y.C.T.PB 96-1338-CO 2-01 and the Junta de Andalucía.
It is proven that an autonomous system verifying some conditions has at least one stable stationary trajectory and it is also given a lower bound to the number of unstable stationary trajectorlies.
The authors gratefully acknowledge the partial support of national natural Founda-tion (Grant 70071011)
The computational complexity of inverse mimimum capacity path problem with lower bound on capacity of maximum capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomi...
Irreducible graphs are those graphs which can hot be embedded on some surface but deleting ally edge of this graph, the resultant graph can be embedded on the surface. This paper characterizes one kind of irreducible ...