Results 21 to 30 of about 545,686 (65)
Meromorphic functions with missing coefficients defined by $q$-derivative [PDF]
Journal of Mahani Mathematical Research, 2023 By considering a fixed point in the punctured unit disk and using the $q$--derivative, a new subfamily of meromorphic and univalent functions is defined.
Shahram Najafzadeh +3 more
doaj +1 more source
On the convex layers of a planer dynamic set of points
Ceylon Journal of Science, 2018 The convex hull of a planer set of points can be defined as the set of vertices of the smallest convex polygon containing all the points. If S is a planer set of points then convex layers of S can be derived by iteratively computing the convex hull of S ...
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Weakly convex sets and modulus of nonconvexity [PDF]
, 2010 We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach spaces with ...
Aubin +20 more
core +2 more sources
Extremal Approximately Convex Functions and Estimating the Size of Convex Hulls [PDF]
, 1998 A real valued function $f$ defined on a convex $K$ is anemconvex function iff it satisfies $$ f((x+y)/2) \le (f(x)+f(y))/2 + 1. $$ A thorough study of approximately convex functions is made.
Dilworth, S. J. +2 more
core +3 more sources
NP-completeness of weakly convex and convex dominating set decision problems [PDF]
Opuscula Mathematica, 2004 The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \(NP\)-complete for bipartite and split graphs.
Joanna Raczek
doaj
Set-Theoretic Inequalities Based on Convex Multi-Argument Approximate Functions via Set Inclusion
Journal of Function Spaces, 2022 Hypersoft set is a novel area of study which is established as an extension of soft set to handle its limitations. It employs a new approximate mapping called multi-argument approximate function which considers the Cartesian product of attribute-valued ...
Atiqe Ur Rahman +3 more
doaj +1 more source
On Bishop–Phelps and Krein–Milman Properties
Mathematics, 2023 A real topological vector space is said to have the Krein–Milman property if every bounded, closed, convex subset has an extreme point. In the case of every bounded, closed, convex subset is the closed convex hull of its extreme points, then we say that ...
Francisco Javier García-Pacheco
doaj +1 more source
About Directed d-Convex Simple Graphs [PDF]
Computer Science Journal of Moldova, 2008 In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple.
Nadejda Sur, Sergiu Cataranciuc
doaj
Known Results and Open Problems in Hypercomplex Convexity
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 A subject, which is treated in this review, combines in one bundle some questions of convex, hypercomplex analysis, probability theory and geometry.
Zelinskii Yuri
doaj +1 more source
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs [PDF]
, 2011 In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise-convex polygons, i.e., polygons that are locally convex, except possibly
Avis +20 more
core +1 more source