Univalence Criteria Starting from the Method of Loewner Chains

The paper continues the work of Royster (Duke Math J 19:447–457, 1952), Mocanu [Mathematica (Cluj) 22(1):77–83, 1980; Mathematica (Cluj) 29:49–55, 1987], Cristea [Mathematica (Cluj) 36(2):137–144, 1994; Complex Var 42:333–345, 2000; Mathematica (Cluj) 43(1):23–34, 2001; Mathematica (Cluj), 2010, to appear; Teoria Topologica a Functiilor Analitice, Editura Universitatii Bucuresti, Romania, 1999] of extending univalence criteria for complex mappings to C ¹ mappings. We improve now the method of Loewner chains which is usually used in complex univalence theory for proving univalence criteria or for proving quasiconformal extensions of holomorphic mappings f : B → C ⁿ to C ⁿ . The results are surprisingly strong. We show that the usual results from the theory, like Becker’s univalence criteria remain true for C ¹ mappings and since we use a stronger form of Loewner’s theory, we obtain results which are stronger even for holomorphic mappings f : B → C ⁿ . In our main result (Theorem 4.1) we end the researches dedicated to quasiconformal extensions of K-quasiregular and holomorphic mappings f : B → C ⁿ to C ⁿ . We show that a C ¹ quasiconformal map f : B → C ⁿ can be extended to a quasiconformal map F : C ⁿ → C ⁿ , without any metric condition imposed to the map f.     

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999     

The Clique Numbers of Regular Graphs

 Let ω(G) be the clique number of a graph G. We prove that if G runs over the set of graphs with a fixed degree sequence d, then the values ω(G) completely cover a line segment [a,b] of positive integers. For an arbitrary graphic degree sequence d, we define min(ω,d) and max(ω,d) as follows:

Adjoining an Identity to a Reduced Archimedean f-Ring

Let frA denote the category of f-rings which are reduced and Archimedean, and let Φ be the (nonfull) subcategory of such rings with identity (each with the natural morphisms). Some time ago, the second author showed, using his representation theory, that for each A ∈ | frA| there is a certain minimal embedding u _A :A→ uA ∈ | Φ|. More recently, he has revisited the representation theory, expanding it to include the representation of morphisms. Based upon this, the present article analyzes the operator u:| frA| → Φ: the construction of uA is tidied, several characterizations of the pair (u _A , uA) are given, and the relation between the maximal ideal structures of A and uA is described. Membership in the class U of frA-morphisms that are “u-extendable” is characterized and it is shown that U = (| frA|,U) is a category in which Φ is a full essentially-reflective subcategory. The frA-objects are characterized for which, respectively, ? B(frA(A, B) = U (A, B)), and, ? B ≠ 0(frA(B, A) = U(B, A)).     

Change of generalized indices of stationary solutions. to multiparametric optimization

We study the local change of the generalized index, which is a modification of the Morse index and the stationary index, for the multiparametric optimization. Under the Regular Value Condition, the change of the generalized index around a triplet (x,v,t) is locally bounded by the dimension of the parameter vector t, where x is a variable vector and v a vector of the Lagrange multiplier space. We also discuss the local change of the generalized index around a pair (x,t). Received: March 27, 1998 / Accepted: January 29, 2000?Published online April 20, 2000     

Mapping Zr into Zs with Maximal Contraction

Given any bijection f: Z ^r →f: Z ^s with s≥ r , easy volume comparisons show that there must be a universal constant K>0 (depending only on r and s ) and infinitely many pairs of points x,y∈ Z ^r such that || f(x)-f(y)|| > K|| x-y|| ^r/s . This puts a bound on how much contraction can be achieved for any such bijection. We show that, conversely, for any s≥ r there is a bijection f: Z ^r →Z ^s and a constant C>0 such that for all x,y∈ Z ^r we have || f(x)-f(y)|| <C|| x-y|| ^r/s . Phrased differently there is a bijection f: Z ^r →Z ^s which shrinks the distance between the images of any two points as much as possible, up to a constant factor. This generalizes a construction in fractal image processing and answers in the affirmative a question of Michael Freedman. Received May 15, 1996.     

Hyperflock determining line sets and totally regular parallelisms of PG (3, \mathbbR){(3,\,{\mathbb{R}})}

By a totally regular parallelism of the real projective 3-space P₃:=PG(3, \mathbb R){\Pi_3:={{\rm PG}}(3, \mathbb {R})} we mean a family T of regular spreads such that each line of Π ₃ is contained in exactly one spread of T. For the investigation of totally regular parallelisms the authors mainly employ Klein’s correspondence λ of line geometry and the polarity π ₅ associated with the Klein quadric H ₅ (for details see Chaps. 1 and 3). The λ-image of a totally regular parallelism T is a hyperflock of H ₅, i.e., a family H of elliptic subquadrics of H ₅ such that each point of H ₅ is on exactly one subquadric of H. Moreover, {p₅(span  l(X))|X ? T}=:H_T{\{\pi_5({{\rm span}} \,\lambda(\mathcal {X}))\vert\mathcal {X}\in\bf{T}\}=:\mathcal {H}_{\bf{T}}} is a hyperflock determining line set, i.e., a set Z{\mathcal {Z}} of 0-secants of H ₅ such that each tangential hyperplane of H ₅ contains exactly one line of Z{\mathcal {Z}} . We say that dim(span H_T)=:d_T{{{\rm dim}}({{\rm span}}\,\mathcal {H}_{\bf{T}})=:d_{\bf{T}}} is the dimension of T and that T is a d _T - parallelism. Clifford parallelisms and 2-parallelisms coincide. The examples of non-Clifford parallelisms exhibited in Betten and Riesinger [Result Math 47:226–241, 2004; Adv Geom 8:11–32, 2008; J Geom (to appear)] are totally regular and of dimension 3. If G{\mathcal{G}} is a hyperflock determining line set, then {l^-1 (p₅(X) ?H₅) | X ? G}{\{\lambda^{-1}\,{\rm (}\pi_5(X){\,\cap H_5)\,|\, X\in\mathcal{G}\}}} is a totally regular parallelism. In the present paper the authors construct examples of topological (see Definition 1.1) 4- and 5-parallelisms via hyperflock determining line sets.     

Representing a Functional Curve by Curves with Fewer Peaks

In this paper, we study the problems of (approximately) representing a functional curve in 2-D by a set of curves with fewer peaks. Representing a function (or its curve) by certain classes of structurally simpler functions (or their curves) is a basic mathematical problem. Problems of this kind also find applications in applied areas such as intensity-modulated radiation therapy (IMRT). Let f\bf f be an input piecewise linear functional curve of size n. We consider several variations of the problems. (1) Uphill–downhill pair representation (UDPR): Find two nonnegative piecewise linear curves, one nondecreasing (uphill) and one nonincreasing (downhill), such that their sum exactly or approximately represents f\bf f. (2) Unimodal representation (UR): Find a set of unimodal (single-peak) curves such that their sum exactly or approximately represents f\bf f. (3) Fewer-peak representation (FPR): Find a piecewise linear curve with at most k peaks that exactly or approximately represents f\bf f. Furthermore, for each problem, we consider two versions. For the UDPR problem, we study its feasibility version: Given ε>0, determine whether there is a feasible UDPR solution for f\bf f with an approximation error ε; its min-ε version: Compute the minimum approximation error ε ^∗ such that there is a feasible UDPR solution for f\bf f with error ε ^∗. For the UR problem, we study its min-k version: Given ε>0, find a feasible solution with the minimum number k ^∗ of unimodal curves for f\bf f with an error ε; its min-ε version: given k>0, compute the minimum error ε ^∗ such that there is a feasible solution with at most k unimodal curves for f\bf f with error ε ^∗. For the FPR problem, we study its min-k version: Given ε>0, find one feasible curve with the minimum number k ^∗ of peaks for f\bf f with an error ε; its min-ε version: given k≥0, compute the minimum error ε ^∗ such that there is a feasible curve with at most k peaks for f\bf f with error ε ^∗. Little work has been done previously on solving these functional curve representation problems. We solve all the problems (except the UR min-ε version) in optimal O(n) time, and the UR min-ε version in O(n+mlog m) time, where m<n is the number of peaks of f\bf f. Our algorithms are based on new geometric observations and interesting techniques.     

Transforming the Physical Environment for Learning

Abstract

Everything Looks Impressive by Hugh Kennedy. New York: Doubteday, 1993, $10.00.

Generation X: Tales For An Accelerated Culture by Douglas Coupland. New York: St. Martin's Press, 1991, $13.95.

Also Cited: Campus Life: Undergraduate Cultures From The End Of The Eighteenth Century To The Present by Helen Lefkowitz Horowitz. New York: Alfred A. Knopf, 1987.

Coming Of Age In New Jersey: College In American Culture by Michael Moffatt. New Brunswick: Rutgers University Press, 1989.

Stover At Yale by Owen Johnson. New York: Collier Books, 1968 (originally published by Frederick A. Stokes Company, 1912).

The Plastic Age by Percy Marks. New York: Grosset &; Dunlap, 1924.     

A GENERALIZATION OF AUSLANDER–BUCHSBAUM AND BASS FORMULAS

Abstract

Given a contravariant functor F : 𝒞 → 𝒮ets for some category 𝒞, we say that F (𝒞) (or F) is generated by a pair (X, x) where X is an object of 𝒞 and x ∈ F(X) if for any object Y of 𝒞 and any y ∈ F(Y), there is a morphism f : Y → X such that F(f)(x) = y. Furthermore, when Y = X and y = x, any f : X → X such that F(f)(x) = x is an automorphism of X, we say that F is minimally generated by (X, x). This paper shows that if the ring R is left noetherian, then there exists a minimal generator for the functor ?xt (?, M) : ? → 𝒮ets, where M is a left R-module and ? is the class (considered as full subcategory of left R-modules) of injective left R-modules.     

Idempotency of Extensions via the Bicompletion

Let Top ₀ be the category of topological T ₀-spaces, QU ₀ the category of quasi-uniform T ₀-spaces, T : QU ₀ → Top ₀ the usual forgetful functor and K : QU ₀ → QU ₀ the bicompletion reflector with unit k : 1 → K. Any T-section F : Top ₀ → QU ₀ is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU ₀ is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).     

Quasi-Frobenius Corings and Quasi-Frobenius Extensions

In this article, the notions of a Frobenius pair of functors and Frobenius corings are generalized to an l-QF pair of functors and l-QF corings. We prove that an extension ι:B → A is left quasi-Frobenius if and only if (F ₁,G ₁) is an l-QF pair of functors, where F ₁: _A ? →  _B ? is the restriction of scalars functors, and G ₁ = A? _{B ^?} : _B ? →  _A ? is the induction functor. For an A-coring , we prove that  is an l-QF coring if and only if A → ? is an l-QF extension and _A  is a finitely generated projective modules if and only if (G ₂,F ₂) is an l-QF pair of functors, where G ₂ =  ? _{A ^?} : _A ? →  ? is the induction functor, F ₂:  ? →  _A ? is the forgetful functor, the result of Brzezinski is generalized.     

Vector Lattice Powers: f-Algebras and Functional Calculus

Let s ∈ {2.3,…} and E be an Archimedean vector lattice. We prove that there exists a unique pair (E ^? ,?), where E ^? is an Archimedean vector lattice and ?:E× ··· ×E (s times) → E ^? is a symmetric lattice s-morphism, such that for every Archimedean vector lattice F and every symmetric lattice s-morphism T:E × ··· × E (s times) → F, there exists a unique lattice homomorphism T ^? :E ^?  → F such that T = T ^? ○?. We give two approaches to construct (E ^? ,?) based on f-algebras and functional calculus, respectively, provided that E is also uniformly complete.     

Cohomological Characterizations of Biprojective and Biflat Banach Algebras

 Let A be a biprojective Banach algebra, and let A-mod-A be the category of Banach A-bimodules. In this paper, for every given -mod-A, we compute all the cohomology groups . Furthermore, we give some cohomological characterizations of biprojective Banach algebras. In particular, we show that the following properties of a Banach algebra A are equivalent to its biprojectivity: (i) for all -mod -A; (ii) for all -mod-A; (iii) for all -mod-A. (Here and are, respectively, the Banach A-bimodules of left, right and double multipliers of X.) Further, if A is a biflat Banach algebra and -mod-A, we compute all the cohomology groups , where is the Banach A-bimodule dual to X. Also, we give cohomological characterizations of biflat Banach algebras. We prove that a Banach algebra A is biflat if and only if any of the following conditions is valid: (i’) for all -mod-A; (ii’) for all -mod-A; (iii’) for all -mod-A.     

On convex optimization without convex representation

We consider the convex optimization problem P:min_x {f(x) : x ? K}{{\rm {\bf P}}:{\rm min}_{\rm {\bf x}} \{f({\rm {\bf x}})\,:\,{\rm {\bf x}}\in{\rm {\bf K}}\}} where f is convex continuously differentiable, and K ì \mathbb Rⁿ{{\rm {\bf K}}\subset{\mathbb R}^n} is a compact convex set with representation {x ? \mathbb Rⁿ : g_j(x) 3 0, j = 1,?,m}{\{{\rm {\bf x}}\in{\mathbb R}^n\,:\,g_j({\rm {\bf x}})\geq0, j = 1,\ldots,m\}} for some continuously differentiable functions (g _j ). We discuss the case where the g _j ’s are not all concave (in contrast with convex programming where they all are). In particular, even if the g _j are not concave, we consider the log-barrier function f_m{\phi_\mu} with parameter μ, associated with P, usually defined for concave functions (g _j ). We then show that any limit point of any sequence (x_m) ì K{({\rm {\bf x}}_\mu)\subset{\rm {\bf K}}} of stationary points of f_m, m? 0{\phi_\mu, \mu \to 0} , is a Karush–Kuhn–Tucker point of problem P and a global minimizer of f on K.     

Two Extensions to Finsler's Recurring Theorem

Finsler's theorem asserts the equivalence of (i) and (ii) for pairs of real quadratic forms f and g on R ⁿ : (i) f( ξ ) >0 for all ξ≠ 0 with g( ξ ) =0; (ii) f-λ g>0 for some λ∈ R. We prove two extensions: 1. We admit a vector-valued quadratic form g: R ⁿ → R ^k , for which we show that (i) implies that f-λ . . . g>0 on an ( n-k+1 ) -dimensional subspace Y R ⁿ for some λ∈ R ^k . 2. In the nonstrict version of Finsler's theorem for indefinite g we replace R ⁿ by a real vector space X . Accepted 22 February 1998     

Annihilator Primes and Foundation Primes

ABSTRACT

Let R be a Noetherian ring and M a finitely generated R -module. In this article, we introduce the set of prime ideals Fnd  M , the foundation primes of M . Using the fact that this set is nicely organized by foundation levels, we present an approach to the problem of understanding Annspec  M , the annihilator primes of M , via Fnd  M . We show: (1) Fnd  M is a finite set containing Annspec  M . Further, suppose that moreover every ideal of R has a centralizing sequence of generators; now, Annspec  M is equal to the set Ass  M of associated primes of M. Then: (2) For an arbitrary P  ∈ Fnd  M , P  ∈ Annspec  M if and only if there is no Q  ∈ Annspec  M such that P contains Q , and at the same time, the minimal foundation level on which appears P is greater than the minimal foundation level on which appears Q .     

Interpolation by holomorphic automorphisms and embeddings in Cn

Let n > 1 and let C ⁿ denote the complex n-dimensional Euclidean space. We prove several jet-interpolation results for nowhere degenerate entire mappings F:C ⁿ →C ⁿ and for holomorphic automorphisms of C ⁿ on discrete subsets of C ⁿ.We also prove an interpolation theorem for proper holomorphic embeddings of Stein manifolds into C ⁿ.For each closed complex submanifold (or subvariety) M ⊂ C ⁿ of complex dimension m < n we construct a domain Ω ⊂C ⁿ containing M and a biholomorphic map F: Ω → C ⁿ onto C ⁿ with J F ≡ 1such that F(M) intersects the image of any nondegenerate entire map G:C ^n−m →C ⁿ at infinitely many points. If m = n − 1, we construct F as above such that C ⁿ ∖F(M) is hyperbolic. In particular, for each m ≥ 1we construct proper holomorphic embeddings F:C ^m →C ^m−1 such that the complement C ^m+1 ∖F(C ^m )is hyperbolic.     

Laplace approximations for sums of independent random vectors

Let X _i , i∈N, be i.i.d. B-valued random variables, where B is a real separable Banach space. Let Φ be a mapping B→R. Under a central limit theorem assumption, an asymptotic evaluation of Z _n = E (exp (n Φ (∑ _{i =1} ⁿ X _i /n))), up to a factor (1 + o(1)), has been gotten in Bolthausen [1]. In this paper, we show that the same asymptotic evaluation can be gotten without the central limit theorem assumption. Received: 19 September 1997 / Revised version:22 April 1999