- log-convexity
- мат. логарифмическая выпуклость
Большой англо-русский и русско-английский словарь. 2001.
log-convexity
Смотреть что такое "log-convexity" в других словарях:
Characterization (mathematics) — In mathematics, the statement that Property P characterizes object X means, not simply that X has property P, but that X is the only thing that has property P. It is also common to find statements such as Property Q characterises Y up to… … Wikipedia
Jensen's inequality — In mathematics, Jensen s inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906 [Jensen, J. Sur les fonctions… … Wikipedia
Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… … Wikipedia
Convex function — on an interval. A function (in black) is convex if and only i … Wikipedia
Orthogonal convex hull — The orthogonal convex hull of a point set In Euclidean geometry, a set is defined to be orthogonally convex if, for every line L that is parallel to one of the axes of the Cartesian coordinate system, the intersection of K with L is empty, a… … Wikipedia
Gamma function — For the gamma function of ordinals, see Veblen function. The gamma function along part of the real axis In mathematics, the gamma function (represented by the capital Greek letter Γ) is an extension of the factorial function, with its… … Wikipedia
Hardy space — In complex analysis, the Hardy spaces (or Hardy classes) Hp are certain spaces of holomorphic functions on the unit disk or upper half plane. They were introduced by Frigyes Riesz (Riesz 1923), who named them after G. H. Hardy, because of the… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Chernoff bound — In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… … Wikipedia
Riesz–Thorin theorem — In mathematics, the Riesz–Thorin theorem, often referred to as the Riesz–Thorin interpolation theorem or the Riesz–Thorin convexity theorem is a result about interpolation of operators. It is named after Marcel Riesz and his student G. Olof… … Wikipedia
Expected utility hypothesis — In economics, game theory, and decision theory the expected utility hypothesis is a theory of utility in which betting preferences of people with regard to uncertain outcomes (gambles) are represented by a function of the payouts (whether in… … Wikipedia
