Results 31 to 40 of about 459,426 (297)

Studies on a new K-symbol analytic functions generated by a modified K-symbol Riemann-Liouville fractional calculus

open access: yesMethodsX, 2023
Analytic functions are very helpful in many mathematical and scientific uses, such as complex integration, potential theory, and fluid dynamics, due to their geometric features.
Ibtisam Aldawish, Rabha W. Ibrahim
doaj   +1 more source

Coefficients and Fekete–Szegö Functional Estimations of Bi-Univalent Subclasses Based on Gegenbauer Polynomials

open access: yesMathematics, 2023
Subclasses of analytic and bi-univalent functions have been extensively improved and utilized for estimating the Taylor–Maclaurin coefficients and the Fekete–Szegö functional.
Abdulmtalb Hussen, Abdelbaset Zeyani
doaj   +1 more source

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs [PDF]

open access: yesJournal of the ACM, 2021
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for MAXIMUM CLIQUE on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics ’90]. Since
Marthe Bonamy   +8 more
semanticscholar   +1 more source

New Class of Close-to-Convex Harmonic Functions Defined by a Fourth-Order Differential Inequality

open access: yesJournal of Mathematics, 2022
In the recent past, various new subclasses of normalized harmonic functions have been defined in open unit disk U which satisfy second-order and third-order differential inequalities.
Mohammad Faisal Khan   +4 more
doaj   +1 more source

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs [PDF]

open access: yes, 2018
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since
Bonnet, E.   +4 more
core   +6 more sources

Estimate for Initial MacLaurin Coefficients of Certain Subclasses of Bi-univalent Functions [PDF]

open access: yes, 2015
In this paper, estimates for second and third MacLaurin coefficients of certain subclasses of bi-univalent functions in the open unit disk defined by convolution are determined, and certain special cases are also indicated.
Alkahtani, Badr   +2 more
core   +2 more sources

On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk [PDF]

open access: yesMathematics of Computation, 2019
We study $\{0, 1\}$ and $\{-1, 1\}$ polynomials $f(z)$, called Newman and Littlewood polynomials, that have a prescribed number $N(f)$ of zeros in the open unit disk $\mathcal{D} = \{z \in \mathbb{C}: |z| 2$ on the unit circle $\partial \mathcal{D ...
K. Hare, Jonas Jankauskas
semanticscholar   +1 more source

On a version of Trudinger-Moser inequality with M\"obius shift invariance [PDF]

open access: yes, 2009
The paper raises a question about the optimal critical nonlinearity for the Sobolev space in two dimensions, connected to loss of compactness, and discusses the pertinent concentration compactness framework. We study properties of the improved version of
Adimurthi, Tintarev, K.
core   +2 more sources

Construction of Planar Harmonic Functions

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2007
Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk can be written in the form f=h+g¯, where h and g are analytic in the open unit disk.
Jay M. Jahangiri   +2 more
doaj   +1 more source

Finding a Maximum Clique in a Disk Graph [PDF]

open access: yesInternational Symposium on Computational Geometry, 2023
A disk graph is an intersection graph of disks in the Euclidean plane, where the disks correspond to the vertices of the graph and a pair of vertices are adjacent if and only if their corresponding disks intersect.
Jared Espenant   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy