Results 51 to 60 of about 365,170 (335)
Bounded Doubly Close-to-Convex Functions [PDF]
We consider a new classCC(α,β)of bounded doubly close-to-convex functions. Coefficient bounds, distortion theorems, and radius of convexity for the classCC(α,β)are investigated. A corresponding class of doubly close-to-starlike functionsS*S(α,β)is also considered.
openaire +4 more sources
F-signature of pairs: Continuity, p-fractals and minimal log discrepancies [PDF]
This paper contains a number of observations on the {$F$-signature} of triples $(R,\Delta,\ba^t)$ introduced in our previous joint work. We first show that the $F$-signature $s(R,\Delta,\ba^t)$ is continuous as a function of $t$, and for principal ideals
Blickle, Manuel +2 more
core +1 more source
Close‐to‐convexity of normalized Dini functions [PDF]
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 ...
Baricz, Árpád +2 more
openaire +2 more sources
Coefficient Problems for Certain Close-to-Convex Functions
In this paper, sharp bounds are established for the second Hankel determinant of logarithmic coefficients for normalised analytic functions satisfying certain differential inequality.
Mundalia, Mridula +1 more
openaire +3 more sources
Optimal inference in a class of regression models [PDF]
We consider the problem of constructing confidence intervals (CIs) for a linear functional of a regression function, such as its value at a point, the regression discontinuity parameter, or a regression coefficient in a linear or partly linear regression.
Armstrong, Timothy B., Kolesár, Michal
core +5 more sources
Distributed Maximum Likelihood Sensor Network Localization [PDF]
We propose a class of convex relaxations to solve the sensor network localization problem, based on a maximum likelihood (ML) formulation. This class, as well as the tightness of the relaxations, depends on the noise probability density function (PDF) of
Leus, Geert, Simonetto, Andrea
core +2 more sources
Analytic Univalent fucntions defined by Gegenbauer polynomials [PDF]
The numerical tools that have outshinning many others in the history of Geometric Function Theory (GFT) are the Chebyshev and Gegenbauer polynomials in the present time.
Sunday Olatunji
doaj +1 more source
Convex combination of analytic functions
Radii of convexity, starlikeness, lemniscate starlikeness and close-to-convexity are determined for the convex combination of the identity map and a normalized convex function F given by f(z) = α z+(1−α)F(z).
Cho Nak Eun +2 more
doaj +1 more source
Given α∈[0,1], let gα(z):=z/(1−αz)2, z∈D:={z∈C:|z|0,z∈D. For the class C(gα) of all close-to-convex functions with respect to gα, the Fekete-Szegö problem is studied.MSC:30C45.
B. Kowalczyk, A. Lecko
semanticscholar +1 more source
In this paper, our aim is to define a new subclass of close-to-convex functions in the open unit disk U that are related with the right half of the lemniscate of Bernoulli.
H. Srivastava +6 more
semanticscholar +1 more source

