Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

On a subclass of meromorphic close-to-convex functions.

ABSTRACT: The main purpose of this paper is to introduce and investigate a certain subclass of meromorphic close-to-convex functions. Such results as coefficient inequalities, convolution property, inclusion relationship, distortion property, and radius of meromorphic convexity are derived.

SUBMITTER: Li ML

PROVIDER: S-EPMC4163370 | biostudies-other | 2014

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

On certain subclass of meromorphic spirallike functions involving the hypergeometric function.

Project description:We introduce and investigate a new subclass M(m)(1)(θ, λ, η) of meromorphic spirallike functions. Such results as integral representations, convolution properties, and coefficient estimates are proved. The results presented here would provide extensions of those given in earlier works. Several other results are also obtained.

| S-EPMC4058173 | biostudies-other

Quasi-Herglotz functions and convex optimization.

Project description:We introduce the set of quasi-Herglotz functions and demonstrate that it has properties useful in the modelling of non-passive systems. The linear space of quasi-Herglotz functions constitutes a natural extension of the convex cone of Herglotz functions. It consists of differences of Herglotz functions and we show that several of the important properties and modelling perspectives are inherited by the new set of quasi-Herglotz functions. In particular, this applies to their integral representations, the associated integral identities or sum rules (with adequate additional assumptions), their boundary values on the real axis and the associated approximation theory. Numerical examples are included to demonstrate the modelling of a non-passive gain medium formulated as a convex optimization problem, where the generating measure is modelled by using a finite expansion of B-splines and point masses.

| S-EPMC7029951 | biostudies-literature

The unique range set of meromorphic functions in an angular domain.

Project description:By using Tsuji's characteristic, we investigate uniqueness of meromorphic functions in an angular domain dealing with the shared set, which is different from the set of the paper (Lin et al., 2006) and obtain a series of results about the unique range set of meromorphic functions in angular domain.

| S-EPMC4052614 | biostudies-other

Coefficient inequalities for a subclass of p-valent analytic functions.

Project description:The aim of this paper is to study the problem of coefficient bounds for a newly defined subclass of p-valent analytic functions. Many known results appear as special consequences of our work.

| S-EPMC3932209 | biostudies-other

On a New Class of p-Valent Meromorphic Functions Defined in Conic Domains.

Project description:We define a new class of multivalent meromorphic functions using the generalised hypergeometric function. We derived this class related to conic domain. It is also shown that this new class of functions, under certain conditions, becomes a class of starlike functions. Some results on inclusion and closure properties are also derived.

| S-EPMC4977416 | biostudies-other

On some Hermite-Hadamard type inequalities for (s, QC)-convex functions.

Project description:In the paper, the authors introduce a new notion "[Formula: see text]-convex function on the co-ordinates" and establish some Hermite-Hadamard type integral inequalities for [Formula: see text]-convex functions on the co-ordinates.

| S-EPMC4718919 | biostudies-other

Algebraic signatures of convex and non-convex codes.

Project description:A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we use algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley-Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions.

| S-EPMC6750060 | biostudies-literature

Coefficient bounds for some families of starlike and convex functions of reciprocal order.

Project description:The aim of the present paper is to investigate coefficient estimates, Fekete-Szegő inequality, and upper bound of third Hankel determinant for some families of starlike and convex functions of reciprocal order.

| S-EPMC4260375 | biostudies-other

Carrier Subclass

Project description:Carrier Subclass

| PRJNA1031099 | ENA

Carrier Subclass

Project description:To evaluate performance of immunomagnetic separation, differential ultracentrifugation and size exculsion chromatography in the isolation of different extracellular RNA carriers from biofluids.

2024-10-31 | GSE246010 | GEO

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data