Results 41 to 50 of about 6,795,119 (352)
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
Compositions and Averages of Two Resolvents: Relative Geometry of Fixed Points Sets and a Partial Answer to a Question by C. Byrne [PDF]
, 2010 We show that the set of fixed points of the average of two resolvents can be found from the set of fixed points for compositions of two resolvents associated with scaled monotone operators.
Bauschke, Heinz H., Wang, Xianfu
core +1 more source
Central limit theorems for random polygons in an arbitrary convex set [PDF]
, 2010 We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets $K\subset\mathbb{R}^2 ...
J. Pardon
semanticscholar +1 more source
On the geodetic and the hull numbers in strong product graphs [PDF]
, 2010 A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G containing S.
Caceres, Jose +4 more
core +2 more sources
Discrete Applied Mathematics, 1994 AbstractA line L separates a set A from a collection S of plane sets if A is contained in one of the closed half-planes defined by L, while every set in S is contained in the complementary closed half-plane. Let ƒ(n) be the largest integer such that for any collection F of n closed disks in the plane with pairwise disjoint interiors, there is a line ...
Jorge Urrutia +2 more
openaire +2 more sources
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
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
The stochastic reflection problem on an infinite dimensional convex set and BV functions in a Gelfand triple [PDF]
, 2010 In this paper, we introduce a definition of BV functions in a Gelfand triple which is an extension of the definition of BV functions in [Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei (9) Mat. Appl.
M. Rockner, Rongchan Zhu, Xiangchan Zhu
semanticscholar +1 more source
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
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