Univalent harmonic mappings and linearly connected domains

We investigate the relationship between the univalence of f and of h in the decomposition of a sense-preserving harmonic mapping defined in the unit disk D⊂C. Among other results, we determine the holomorphic univalent maps h for which there exists c>0 such that every harmonic mapping of the form with |g^′|<c|h^′| is univalent. The notion of a linearly connected domain appears in our study in a relevant way.     

Distortion theorems of plane quasiconformal mappings

The authors prove a conjecture on elliptic integrals and obtain sharp bounds for φK(r) and λ(K). By using Teichmüller's module theorem, the authors obtain a distortion theorem of K-quasiconformal mappings on the plane.     

REMARKS ON JOHN DISKS

Let D■R2 be a Jordan domain,D*=R2\D,the exterior of D.In this article,the authors obtained the following results:(1)If D is a John disk,then D is an outer linearly locally connected domain;(2)If D* is a John disk,then D is an inner linearly locally connected domain;(3)A homeomorphism f:R 2 →R 2 is a quasiconformal mapping if and only if f(D)is a John disk for any John disk D■R 2 ;and(4)If D is a bounded quasidisk,then D is a John disk,and there exists an unbounded quasidisk which is not a John disk.     

A Schwarz-Pick inequality for harmonic quasiconformal mappings and its applications

The main result of this paper is the sharp generalized Schwarz-Pick inequality for euclidean harmonic quasiconformal mappings with convex ranges, which generalizes a result given by Mateljevi?. As its applications, we obtain the property of quasi-isometry with respect to the Poincaré distance and an analogue of the Koebe theorem for this class of mappings.     

On the quasi-isometries of harmonic quasiconformal mappings

We prove versions of the Ahlfors-Schwarz lemma for quasiconformal euclidean harmonic functions and harmonic mappings with respect to the Poincaré metric.     

An example of a nonarcwise connected rim-countable locally connected continuum

An example of a rim-countable, locally connected, but nonarcwise connected continuum is constructed, which is important for the classification of locally connected continua. The point of interest in this result is that there are no metrizable locally connected continua with the above properties. Translated fromMatematicheskie Zametki, Vol. 65, No. 5, pp. 659–666, May, 1999.     

Truncations of extremal quasiconformal mappings and their applications

In this paper we give a necessary and sufficient condition to decide whether the Teichmüller equivalency class [α] of a truncation α induced by a uniquely extremal Beltrami differential is a Strebel point in T. We also obtain a necessary and sufficient condition of the unique extremality of α. Using the properties of truncations we provide a method to construct Hamilton sequences. We also get a sufficient condition for the extremality of f(z,t) to be equivalent to that of F(w,t). The corresponding results in the infinitesimal case are obtained, too.     

On the dilatation of extremal quasiconformal mappings of polygons

A polygon P _N is the unit disk with distinguished boundary points, . An extremal quasiconformal mapping maps each polygon inscribed in onto a polygon inscribed in . Let f _N be the extremal quasiconformal mapping of P _N onto P' _N. Let K _N be its dilatation and let K ₀ be the maximal dilatation of f ₀. Then, evidently . The problem is, when equality holds. This is completely answered, if f ₀ does not have any essential boundary points. For quadrilaterals Q and Q' = f ₀ (Q) the problem is sup(M'/M) = K ₀, with M and M' the moduli of Q and Q' respectively. Received: December 23, 1997     

Boundedly connected sets and the distance to the intersection of two sets

We prove that if (X,d) is a metric space, C is a closed subset of X and x∈X, then the distance of x to R∩S agrees with the maximum of the distances of x to R and S, for every closed subsets R,S⊂C such that C=R∪S, if and only if C is x-boundedly connected.     

弱条件下同胚的ACL性质

假设Ｄ是Ｒｎ（ｎ２）中的区域，ｙ＝ｆ（ｘ）：ＤＲｎ是一个同胚．如果ｆ（ｘ）的模伸张Ｋ（ｘ，ｆ）适合条件Ａ，则ｆ（ｘ）是ＡＣＬ的．     

The ACL property of homeomorphisms under weak conditions

Suppose thatD is a domain in andy=f(x)∶D→R ⁿ is a homeomorphism. We prove that if the modulus dilatationK(x, f) satisfies the condition A thenf(x) is ACL. Project supported by the National Natural Science Foundation of China and JTU     

Uniformly locally univalent harmonic mappings associated with the pre-Schwarzian norm

In this paper, we consider the class of uniformly locally univalent harmonic mappings in the unit disk and build a relationship between its pre-Schwarzian norm and uniformly hyperbolic radius. Also, we establish eight ways of characterizing uniformly locally univalent sense-preserving harmonic mappings. We also present some sharp distortions and growth estimates and investigate their connections with Hardy spaces. Finally, we study subordination principles of norm estimates.     

An efficient and novel numerical method for quasiconformal mappings of doubly connected domains

A numerical method for quasiconformal mapping of doubly connected domains onto annuli is presented. The ratio R of the radii of the annulus is not known a priori and is determined as part of the solution procedure. The numerical method presented in this paper requires solving iteratively a sequence of inhomogeneous Beltrami equations, each for a different R. R is updated using a procedure based on the bisection method. The new method is an extension of Daripas method for the quasiconformal mapping of the exterior of simply connected domains onto the interior of unit disks [15]. It uses fast and accurate algorithms for evaluating certain singular integrals and is, thus, very efficient and accurate. Its performance is demonstrated for several doubly connected domains.     

The maximum number of maximal independent sets in unicyclic connected graphs

In this paper, we determine the maximum number of maximal independent sets in a unicyclic connected graph. We also find a class of graphs achieving this maximum value.     

On the stability of closed-convex-valued mappings and the associated boundaries

This paper deals with the stability properties of those set-valued mappings from locally metrizable spaces to Euclidean spaces for which the images are the convex hull of their boundaries (i.e., they are closed convex sets not containing a halfspace). Examples of this class of mappings are the feasible set and the optimal set of convex optimization problems, and the solution set of convex systems, when the data are subject to perturbations. More in detail, we associate with the given set-valued mapping its corresponding boundary mapping and we analyze the transmission of the stability properties (lower and upper semicontinuity, continuity and closedness) from the given mapping to its boundary and vice versa.     

The upper connected geodetic number and forcing connected geodetic number of a graph

For a connected graph G of order p≥2, a set S⊆V(G) is a geodetic set of G if each vertex v∈V(G) lies on an x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, denoted by g(G). A geodetic set of cardinality g(G) is called a g-set of G. A connected geodetic set of G is a geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected geodetic set of G is the connected geodetic number of G and is denoted by g_c(G). A connected geodetic set of cardinality g_c(G) is called a g_c-set of G. A connected geodetic set S in a connected graph G is called a minimal connected geodetic set if no proper subset of S is a connected geodetic set of G. The upper connected geodetic number is the maximum cardinality of a minimal connected geodetic set of G. We determine bounds for and determine the same for some special classes of graphs. For positive integers r,d and n≥d+1 with r≤d≤2r, there exists a connected graph G with , and . Also, for any positive integers 2≤a<b≤c, there exists a connected graph G such that g(G)=a, g_c(G)=b and . A subset T of a g_c-set S is called a forcing subset for S if S is the unique g_c-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing connected geodetic number of S, denoted by f_c(S), is the cardinality of a minimum forcing subset of S. The forcing connected geodetic number of G, denoted by f_c(G), is f_c(G)=min{f_c(S)}, where the minimum is taken over all g_c-sets S in G. It is shown that for every pair a,b of integers with 0≤a≤b−4, there exists a connected graph G such that f_c(G)=a and g_c(G)=b.     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.