نتایج جستجو برای: convexity

تعداد نتایج: 8619  

Journal: :Transactions of the American Mathematical Society 1956

Journal: :Mathematical Programming 2022

Abstract We present a generalization of the notion neighborliness to non-polyhedral convex cones. Although definition is available in case literature, it fairly restrictive as requires all low-dimensional faces be polyhedral. Our approach more flexible and includes, for example, cone positive-semidefinite matrices special (this not neighborly general). term our Terracini convexity due its conce...

2007
A. FIGALLI C. VILLANI

Ricci curvature bounds in Riemannian geometry are known to be equivalent to the weak convexity (convexity along at least one geodesic between any two points) of certain functionals in the space of probability measures. We prove that the weak convexity can be reinforced into strong (usual) convexity, thus solving a question left open in [4].

Journal: :Bulletin of the American Mathematical Society 1949

Journal: :Mathematische Annalen 2021

We introduce a notion of fractional convexity that extends naturally the usual in Euclidean space to setting. With this convexity, we study convex envelope inside domain an exterior datum (the largest possible function is below outside) and show characterized as viscosity solution non-local equation given by infimum among all directions 1-dimensional laplacian. For prove existence, uniqueness c...

2010
Mark Mandelkern

Constructive properties of uniform convexity, strict convexity, near convexity, and metric convexity in real normed linear spaces are considered. Examples show that certain classical theorems, such as the existence of points of osculation, are constructively invalid. The methods used are in accord with principles introduced by Errett Bishop.

2015
Ricardo G. Sanfelice Laurent Praly

We study how convergence of an observer whose state lives in a copy of the given system’s space can be established using a Riemannian metric. We show that the existence of an observer guaranteeing the property that a Riemannian distance between system and observer solutions is nonincreasing implies that the Lie derivative of the Riemannian metric along the system vector field is conditionally n...

2016
Arthur Van Camp Enrique Miranda Gert de Cooman

We investigate the connection between choice functions and lexicographic probabilities, by means of the convexity axiom considered by [7] but without imposing any Archimedean condition. We show that lexicographic probabilities are related to a particular type of sets of desirable gambles, and investigate the properties of the coherent choice function this induces via maximality. Finally, we sho...

Journal: :bulletin of the iranian mathematical society 2012
qiuhong luo xiantao wang

the main aim of this paper is to introduce three classes $h^0_{p,q}$, $h^1_{p,q}$ and $th^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. first, we discuss the starlikeness and convexity of mappings in $h^0_{p,q}$ and $h^1_{p,q}$. then establish the covering theorem for mappings in $h^1_{p,q}$. finally, we determine the extreme points of the class $th^*_{p}$.

Journal: :bulletin of the iranian mathematical society 0
m. soleimani-damaneh {school of mathematics‎, ‎statistics and computer science‎, ‎college of science‎, ‎university of‎ ‎tehran‎, ‎enghelab avenue‎, ‎tehran‎, ‎iran. m. movahedi department of mathematics‎, ‎faculty of sciences‎, ‎alzahra university‎, ‎tehran‎, ‎iran. d. behmardi department of mathematics‎, ‎faculty of sciences‎, ‎alzahra university‎, ‎tehran‎, ‎iran.

in this paper, we deal with the subdi erential concept onhadamard spaces. flat hadamard spaces are characterized, and nec-essary and sucient conditions are presented to prove that the subdif-ferential set in hadamard spaces is nonempty. proximal subdi erentialin hadamard spaces is addressed and some basic properties are high-lighted. finally, a density theorem for subdi erential set is establi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید