Results 1 to 10 of about 21,866 (165)
CR Iteration in Generation of Antifractals With s-Convexity [PDF]
IEEE Access, 2020 Complex graphics of nonlinear dynamical systems perform vital role in many fields, e.g., image compression or encryption, art, science, and so on. Antifractals are generated by applying a map recursively to an initial point in complex plane that have ...
Dong Li +5 more
doaj +2 more sources
Tricorns and Multicorns in Noor Orbit With s-Convexity [PDF]
IEEE Access, 2019 In today’s world, complex patterns of the dynamical framework have astounding highlights of fractals and become a huge field of research because of their beauty and unpredictability of their structure.
Young Chel Kwun +5 more
doaj +3 more sources
Inequalities via s−convexity and log −convexity
Topological Algebra and its Applications, 2017 In this paper, we obtain some new inequalities for functions whose second derivatives’ absolute value is s−convex and log −convex. Also, we give some applications for numerical integration.
Akdemir Ahmet Ocak +2 more
doaj +5 more sources
Simpson’s quadrature formula for third differentiable and s-convex functions
Boundary Value ProblemsThis study establishes Newton-type inequalities for third differentiable and s-convex functions that use the Riemann integral. New Newton-type inequalities are also introduced using a summation parameter p ≥ 1 $p\geq 1$ for various convexity cases.
Bouharket Benaissa +2 more
doaj +3 more sources
Journal of Mathematics, 2023 This paper aims to present a generalized and extended notation of convexity by unifying reciprocally strong convexity with h,s−convexity. We introduce the concept of reciprocally strongly h,s−convex functions and establish some of their fundamental ...
Yujun Wang +3 more
doaj +1 more source
A note on the convexity number for complementary prisms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In the geodetic convexity, a set of vertices $S$ of a graph $G$ is $\textit{convex}$ if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. The cardinality $con(G)$ of a maximum proper convex set $S$ of $G$ is the $\textit{
Diane Castonguay +3 more
doaj +1 more source
Correction to “CR Iteration in Generation of Antifractals With s-Convexity” [PDF]
IEEE Access, 2020 Dans l'article ci-dessus [1], le financement mentionné était correct, mais il manquait dans l'article une section de reconnaissance, requise pour le financement. L'accusé de réception correct est répertorié ci-dessous.
Dong Li +5 more
openaire +1 more source
On the symmetrized S-divergence [PDF]
ITM Web of Conferences, 2019 In this paper we worked with the relative divergence of type s, s ∈ ℝ, which include Kullback-Leibler divergence and the Hellinger and χ2 distances as particular cases.
Simić Slavko
doaj +1 more source
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
Fractal and Fractional, 2022 In this paper, a new type of convexity is defined, namely, the left–right-(k,h-m)-p IVM (set-valued function) convexity. Utilizing the definition of this new convexity, we prove the Hadamard inequalities for noninteger Katugampola integrals.
Vuk Stojiljković +3 more
doaj +1 more source