scispace - formally typeset
E

Ebrahim Analouei Adegani

Researcher at University of Shahrood

Publications -  36
Citations -  225

Ebrahim Analouei Adegani is an academic researcher from University of Shahrood. The author has contributed to research in topics: Analytic function & Subordination (linguistics). The author has an hindex of 6, co-authored 28 publications receiving 121 citations. Previous affiliations of Ebrahim Analouei Adegani include Urmia University.

Papers
More filters
Journal ArticleDOI

Faber Polynomial Coefficient Estimates for Bi-Univalent Functions Defined by Using Differential Subordination and a Certain Fractional Derivative Operator

TL;DR: In this paper, a general family of analytic and bi-univalent functions in the open unit disk is defined by applying the principle of differential subordination between analytic functions and the Tremblay fractional derivative operator.
Journal ArticleDOI

Coefficient bounds and differential subordinations for analytic functions associated with starlike functions

TL;DR: In this paper, the authors studied some coefficient problems for certain classes associated with starlike functions such as sharp bounds for initial coefficients, logarithmic coefficients, Hankel determinants and Fekete-Szego problems.
Journal ArticleDOI

Logarithmic Coefficients for Univalent Functions Defined by Subordination

TL;DR: In this article, the bounds for the logarithmic coefficients γ n of the general classes S * ( φ ) and K (φ ) were estimated, and some consequences of the main results are also presented, noting that their method is more general than those used by others.
Journal ArticleDOI

Faber polynomial coefficient estimates for subclass of bi-univalent functions defined by quasi-subordinate

TL;DR: In this paper, the Faber polynomial expansion was used to find upper bounds for coefficients of functions belonging to classes HqΣ(λ,h),STq Σ(α,h) and MQΣ (α, h) which are defined by quasi-subordinations.
Journal ArticleDOI

Logarithmic Coefficient Bounds and Coefficient Conjectures for Classes Associated with Convex Functions

TL;DR: In this article, the authors proposed a method to solve the problem of the computational complexity of the problem in the context of mathematics and computer science at Iran's Shahrood University of Technology.