In this study, we will employ a different methodology compared to the prevailing techniques in the literature. The literature mainly concentrates on the partitioning of convex sets using hyperplanes. The focus of our inquiry is the behaviour of a convex set that encompasses the domain of convex and coconvex polynomials, which we will refer to as (co) convex polynomials. The primary aim of this study is to investigate the following questions: Given that D is the domain of (co) convex polynomials of ^ (2) (Yₛ) for s 0 and x D, the question is whether x qualifies as an inflection point within D.
Building similarity graph...
Analyzing shared references across papers
Loading...
Malik Saad Al-Muhja
Northern University of Malaysia
Amer Himza Almyaly
Al-Muthanna University
A.N. Dheyab
South Ural State University
Filomat
Northern University of Malaysia
South Ural State University
Al-Muthanna University
Building similarity graph...
Analyzing shared references across papers
Loading...
Al-Muhja et al. (Wed,) studied this question.
synapsesocial.com/papers/69b6069b83145bc643d1cbfd — DOI: https://doi.org/10.2298/fil2521531a