Results 161 to 170 of about 3,606 (203)
Some of the next articles are maybe not open access.
Observability in the Univalent Universe
Mediterranean Journal of Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernando Tohmé +2 more
openaire +2 more sources
Mathematics of Operations Research, 1983
When a mapping is univalent (one-to-one) on a set is a question which has received considerable study. Much of the recent research has focused on the shape of the set on which the mapping is defined. It has been suggested, in fact, that the set must be convex for univalence to hold. This paper presents conditions under which the set need not be convex.
openaire +1 more source
When a mapping is univalent (one-to-one) on a set is a question which has received considerable study. Much of the recent research has focused on the shape of the set on which the mapping is defined. It has been suggested, in fact, that the set must be convex for univalence to hold. This paper presents conditions under which the set need not be convex.
openaire +1 more source
On the zeros of univalent functions with univalent derivatives
Annali di Matematica Pura ed Applicata, 1979A family, E, consisting of normalised univalent functions with univalent derivatives is studied with regard to the zeros of these functions.
Shah, Swarupchand M., Trimble, Selden Y.
openaire +1 more source
Canadian Journal of Mathematics, 1970
In what follows, we suppose that ƒ(z) = Σ0∞anzn is regular for |z| < 1. LetandThen (see, for example, [6, pp. 235-236]), for 0 ≦ r < ρ < 1, we have:The following results are well known.
Başgöze, T. +2 more
openaire +2 more sources
In what follows, we suppose that ƒ(z) = Σ0∞anzn is regular for |z| < 1. LetandThen (see, for example, [6, pp. 235-236]), for 0 ≦ r < ρ < 1, we have:The following results are well known.
Başgöze, T. +2 more
openaire +2 more sources
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
We present a simple inner model construction for dependent type theory, which preserves univalence.
openaire +1 more source
We present a simple inner model construction for dependent type theory, which preserves univalence.
openaire +1 more source
On the Epstein Univalence Criterion
Results in Mathematics, 1986A short proof, using Löwner's method, is given to \textit{C. L. Epstein}'s recent univalence criterion [J. Reine Angew. Math. 372, 96-135 (1986; Zbl 0591.30018)] which contains the well known criteria of Nehari and Becker as special cases.
openaire +2 more sources
A univalence criterion and the structure of some subclasses of univalent functions
1987A sufficient condition for univalence of Ahlfors-Becker-Lewandowski type is obtained. Theorem. Let f be holomorphic in \(| z|
Miazga, Józef +1 more
openaire +1 more source
On the univalence of Taylor sums for a class of univalent functions
1965Artykuł z: Annales Universitatis Mariae Curiae-Skłodowska. Sectio A, Mathematica. Vol. 17 (1963), s. 65-67, streszcz. pol., ros. ; Artykuł z: Annales Universitatis Mariae Curiae-Skłodowska. Sectio A, Mathematica. Vol. 17 (1963), s. 65-67, streszcz. pol., ros.
openaire +1 more source