All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 10 of 10

Showing per page

An application of multivariate total positivity to peacocks

Antoine Marie Bogso (2014)

ESAIM: Probability and Statistics

We use multivariate total positivity theory to exhibit new families of peacocks. As the authors of [F. Hirsch, C. Profeta, B. Roynette and M. Yor, Peacocks and associated martingales vol. 3. Bocconi-Springer (2011)], our guiding example is the result of Carr−Ewald−Xiao [P. Carr, C.-O. Ewald and Y. Xiao, Finance Res. Lett. 5 (2008) 162–171]. We shall introduce the notion of strong conditional monotonicity. This concept is strictly more restrictive than the conditional monotonicity as defined in [F....

Concave domains with trivial biholomorphic invariants

Witold Jarnicki, Nikolai Nikolov (2002)

Annales Polonici Mathematici

It is proved that if F is a convex closed set in ℂⁿ, n ≥2, containing at most one (n-1)-dimensional complex hyperplane, then the Kobayashi metric and the Lempert function of ℂⁿ∖ F identically vanish.

Grauert's line bundle convexity, reduction and Riemann domains

Viorel Vâjâitu (2016)

Czechoslovak Mathematical Journal

We consider a convexity notion for complex spaces X with respect to a holomorphic line bundle L over X . This definition has been introduced by Grauert and, when L is analytically trivial, we recover the standard holomorphic convexity. In this circle of ideas, we prove the counterpart of the classical Remmert’s reduction result for holomorphically convex spaces. In the same vein, we show that if H 0 ( X , L ) separates each point of X , then X can be realized as a Riemann domain over the complex projective space...

k-convexity in several complex variables

Hidetaka Hamada, Gabriela Kohr (2002)

Annales Polonici Mathematici

We define and investigate the notion of k-convexity in the sense of Mejia-Minda for domains in ℂⁿ and also that of k-convex mappings on the Euclidean unit ball.

Lempert theorem for strongly linearly convex domains

Łukasz Kosiński, Tomasz Warszawski (2013)

Annales Polonici Mathematici

In 1984 L. Lempert showed that the Lempert function and the Carathéodory distance coincide on non-planar bounded strongly linearly convex domains with real-analytic boundaries. Following his paper, we present a slightly modified and more detailed version of the proof. Moreover, the Lempert Theorem is proved for non-planar bounded strongly linearly convex domains.

Weak lineal convexity

Christer O. Kiselman (2015)

Banach Center Publications

A bounded open set with boundary of class C¹ which is locally weakly lineally convex is weakly lineally convex, but, as shown by Yuriĭ Zelinskiĭ, this is not true for unbounded domains. The purpose here is to construct explicit examples, Hartogs domains, showing this. Their boundary can have regularity C 1 , 1 or C ∞ . Obstructions to constructing smoothly bounded domains with certain homogeneity properties will be discussed.

Currently displaying 1 – 10 of 10

Page 1