Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userClose-to-convexity of normalized Dini functions
102
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper necessary and sufficient conditions are deduced for the close-to-convexity of some special combinations of Bessel functions of the first kind and their derivatives by using a result of Shah and Trimble about transcendental entire functions with univalent derivatives and some newly discovered Mittag-Leffler expansions for Bessel functions of the first kind.
rate research
Read More
In the present investigation our main aim is to give lower bounds for the ratio of some normalized $q$-Bessel functions and their sequences of partial sums. Especially, we consider Jacksons second and third $q$-Bessel functions and we apply one normalization for each of them.
Let $phi$ be a normalized convex function defined on open unit disk $mathbb{D}$. For a unified class of normalized analytic functions which satisfy the second order differential subordination $f(z)+ alpha z f(z) prec phi(z)$ for all $zin mathbb{D}$, we investigate the distortion theorem and growth theorem. Further, the bounds on initial logarithmic coefficients, inverse coefficient and the second Hankel determinant involving the inverse coefficients are examined.
We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the upper bound $O(frac{log(epsilon n)}{epsilon})$ in the usual uniform model, and prove an $O(frac{log n}{epsilon})$ upper bound in the distribution-free setting. 2. We show a tight lower bound of $Omega(frac{log(epsilon n)}{epsilon})$ queries for testing convexity of functions $f: [n] rightarrow mathbb{R}$ on the line. This lower bound applies to both adaptive and non-adaptive algorithms, and matches the upper bound from item 1, showing that adaptivity does not help in this setting. 3. Moving to higher dimensions, we consider the case of a stripe $[3] times [n]$. We construct an emph{adaptive} tester for convexity of functions $fcolon [3] times [n] to mathbb R$ with query complexity $O(log^2 n)$. We also show that any emph{non-adaptive} tester must use $Omega(sqrt{n})$ queries in this setting. Thus, adaptivity yields an exponential improvement for this problem. 4. For functions $fcolon [n]^d to mathbb R$ over domains of dimension $d geq 2$, we show a non-adaptive query lower bound $Omega((frac{n}{d})^{frac{d}{2}})$.
A motivation comes from {em M. Ismail and et al.: A generalization of starlike functions, Complex Variables Theory Appl., 14 (1990), 77--84} to study a generalization of close-to-convex functions by means of a $q$-analog of a difference operator acting on analytic functions in the unit disk $mathbb{D}={zin mathbb{C}:,|z|<1}$. We use the terminology {em $q$-close-to-convex functions} for the $q$-analog of close-to-convex functions. The $q$-theory has wide applications in special functions and quantum physics which makes the study interesting and pertinent in this field. In this paper, we obtain some interesting results concerning conditions on the coefficients of power series of functions analytic in the unit disk which ensure that they generate functions in the $q$-close-to-convex family. As a result we find certain dilogarithm functions that are contained in this family. Secondly, we also study the famous Bieberbach conjecture problem on coefficients of analytic $q$-close-to-convex functions. This produces several power series of analytic functions convergent to basic hypergeometric functions.
Many different types of fractional calculus have been defined, which may be categorised into broad classes according to their properties and behaviours. Two types that have been much studied in the literature are the Hadamard-type fractional calculus and tempered fractional calculus. This paper establishes a connection between these two definitions, writing one in terms of the other by making use of the theory of fractional calculus with respect to functions. By extending this connection in a natural way, a generalisation is developed which unifies several existing fractional operators: Riemann--Liouville, Caputo, classical Hadamard, Hadamard-type, tempered, and all of these taken with respect to functions. The fundamental calculus of these generalised operators is established, including semigroup and reciprocal properties as well as application to some example functions. Function spaces are constructed in which the new operators are defined and bounded. Finally, some formulae are derived for fractional integration by parts with these operators.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
