In this paper‎, ‎we introduce a new class$T_{k}^{s,a}[A,B,alpha‎ ,‎beta ]$ of analytic functions by using a‎ ‎newly defined convolution operator‎. ‎This class contains many known classes of‎ ‎analytic and univalent functions as special cases‎. ‎We derived some‎ ‎interesting results including inclusion relationships‎, ‎a radius problem and‎ ‎sharp coefficient bound for this class‎.

in this paper‎, ‎we introduce a new class$t_{k}^{s,a}[a,b,alpha‎ ,‎beta ]$ of analytic functions by using a‎ ‎newly defined convolution operator‎. ‎this class contains many known classes of‎ ‎analytic and univalent functions as special cases‎. ‎we derived some‎ ‎interesting results including inclusion relationships‎, ‎a radius problem and‎ ‎sharp coefficient bound for this class‎.

A sufficient coefficient of this class is determined. It is shown that this coefficient bound is also necessary for the classM –– H n, λ, α if fn z h –– gn∈ MH n, λ, α , where h z z− ∑∞ k 2|ak|z, gn z −1 n ∑∞ k 1|bk|z and n ∈ N0. Coefficient conditions, such as distortion bounds, convolution conditions, convex combination, extreme points, and neighborhood for the class M –– H n, λ, α , are obta...

In this paper, we introduced and investigated starlike and convex functions of order α with respect to 2(j,k)-symmetric conjugate points and coefficient inequality for function belonging to these classes are provided . Also we obtain some convolution condition for functions belonging to this class.

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

Abstract: The aim of this paper is to introduce and study a new class [ ] * C A,B, δ α of Janowski QuasiConvex univalent functions of order alpha associated with Ruscheweyh derivative. Sharp coefficient bound, distortion result and some inclusion results are discussed. Invariance of [ ] * C A,B, δ α under convolution with convex functions has also been examined and some of its applications are ...

We show that the controversies on the gauge dependence and the infrared singularity emerged in the generalized factorization approach for nonleptonic heavy meson decays within the framework of the operator product expansion can be resolved by perturbative QCD factorization theorem. Gauge invariance of the decay amplitude is maintained under radiative corrections by assuming onshell external qua...

We prove lower bounds of order n logn for both the problem of multiplying polynomials of degree n, and of dividing polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower bounds are optimal up to order of magnitude. The proof uses a recent idea of R. Raz [Proc. 34th STOC 2002] proposed for matrix multiplication. It reduces the li...

DCT-domain processing, filtering, convolution, image enhancement, quantization tables We develop a method for designing DCT coefficient multipliers in order to approximate the operation of 2D convolution of an image with a given kernel. The method is easy to implement on compressed formats of DCT-based compression methods (JPEG, MPEG, H.261) by applying decoding quantization tables that are inc...