Results 31 to 40 of about 646,901 (273)
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
Number of Spinal-Convex Polyominoes
Journal of Kufa for Mathematics and Computer, 2020 In his paper we describe a restricted class of polyominoes called spinal-convex polyominoes. Spinal-convex polyominoes created by two columns such that column 1 (respectively, column2) with at most two set columns sequence of adjacent ominoes and column ...
Mustafa A. Sabri, Eman F. Mohomme
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
On Infinitesimal Approximation of a Continuous Function [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 If and are convex subsets in , and in for all . If the approximation family is the set An Infinitesimal approximation of an element in established in [4],[5].
Tahir Ismail
doaj +1 more source
Ceylon Journal of Science, 2021 The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n).
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Minimum L1-distance projection onto the boundary of a convex set: Simple characterization
, 2006 We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection.
H. J. H. Tuenter +2 more
core +1 more source
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
The External Estimate of the Compact Set by Lebesgue Set of the Convex Function [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020 The finite-dimensional problem of embedding a given compact D ⊂ R p into the lower Lebesgue set G(α) = {y ∈ R p : f(y) 6 α} of the convex function f(·) with the smallest value of α due to the offset of D is considered.
Abramova, Veronika V. +2 more
doaj +1 more source
, 2014 We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional noise.
Brunel, Victor-Emmanuel
core +1 more source
On lattices of convex sets in R^n
, 2004 Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets of R^n and the ...
Bergman, George M.
core +1 more source