On Closed Weingarten Surfaces

We investigate closed surfaces in Euclidean 3-space satisfying certain functional relations κ = F(λ) between the principal curvatures κ, λ. In particular we find analytic closed surfaces of genus zero where F is a quadratic polynomial or F(λ) = cλ²ⁿ⁺¹. This generalizes results by H. Hopf on the case where F is linear and the case of ellipsoids of revolution where F(λ) = cλ³.     

On Closed Weingarten Surfaces

We investigate closed surfaces in Euclidean 3-space satisfying certain functional relations κ = F(λ) between the principal curvatures κ, λ. In particular we find analytic closed surfaces of genus zero where F is a quadratic polynomial or F(λ) = cλ²ⁿ⁺¹. This generalizes results by H. Hopf on the case where F is linear and the case of ellipsoids of revolution where F(λ) = cλ³.     

Dynamics of rational maps: Lyapunov exponents,bifurcations, and capacity

 Let L(f)=∫log∥Df∥dμ _f denote the Lyapunov exponent of a rational map, f:P ¹→P ¹ . In this paper, we show that for any holomorphic family of rational maps {f _λ :λX} of degree d>1, T(f)=dd ^c L(f _λ ) defines a natural, positive (1,1)-current on X supported exactly on the bifurcation locus of the family. The proof is based on the following potential-theoretic formula for the Lyapunov exponent:

Proper cycles of indefinite quadratic forms and their right neighbors

In this paper we consider proper cycles of indefinite integral quadratic forms F = (a, b, c) with discriminant Δ. We prove that the proper cycles of F can be obtained using their consecutive right neighbors R ⁱ(F) for i ⩾ 0. We also derive explicit relations in the cycle and proper cycle of F when the length l of the cycle of F is odd, using the transformations τ(F) = (−a, b, −c) and ϰ(F) = (−c, b, −a).     

Groups of typeF a,b,−c

For integersa, b andc, the groupF ^a,b,−c is defined to be the group 〈R, S : R ²=RS ^aRS^bRS^−c=1〉. In this paper we identify certain subgroups of the group of affine linear transformations of finite fields of orderp ⁿ (for certainp andn) as groups of typeF ^a,b,−c for certain (not unique) choices ofa, b andc.     

Canonical Theorems for Convex Sets

Let F be a family of pairwise disjoint compact convex sets in the plane such that none of them is contained in the convex hull of two others, and let r be a positive integer. We show that F has r disjoint ⌊ c _r n⌋ -membered subfamilies F _i (1 ≤ i ≤ r) such that no matter how we pick one element F _i from each F _i , they are in convex position, i.e., every F _i appears on the boundary of the convex hull of ⋃ _i=1 ^r F _i . (Here c _r is a positive constant depending only on r .) This generalizes and sharpens some results of Erdős and Szekeres, Bisztriczky and Fejes Tóth, Bárány and Valtr, and others. <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p427.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received April 30, 1997, and in revised form August 5, 1997.     

Operators on the Lattice of Pseudovarieties of Finite Semigroups

L (F) of pseudovarieties of finite semigroups that attempts to take full advantage of the underlying lattice structure, Auinger, Hall and the present authors recently introduced fourteen complete congruences on L (F). Such congruences provide a framework from which to study L (F) both locally and globally. For each such congruence ρ and each U∈L (F) the ρ-class of U is an interval [U ^ρ, U _ρ]. This provides a family of operators of the form U⇒Uρ on L (F) that reveal important relationships between elements of L (F). Various aspects of these operators are considered including characterizations of U ^ρ, bases of pseudoidentities for U ^ρ, instances of commutativity (U ^ρ)^σ = U ^σ)^ρ, as well as the semigroups generated by certain pairs of such operators.     

Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization

Based on the authors’ previous work which established theoretical foundations of two, conceptual, successive convex relaxation methods, i.e., the SSDP (Successive Semidefinite Programming) Relaxation Method and the SSILP (Successive Semi-Infinite Linear Programming) Relaxation Method, this paper proposes their implementable variants for general quadratic optimization problems. These problems have a linear objective function c ^T x to be maximized over a nonconvex compact feasible region F described by a finite number of quadratic inequalities. We introduce two new techniques, “discretization” and “localization,” into the SSDP and SSILP Relaxation Methods. The discretization technique makes it possible to approximate an infinite number of semi-infinite SDPs (or semi-infinite LPs) which appeared at each iteration of the original methods by a finite number of standard SDPs (or standard LPs) with a finite number of linear inequality constraints. We establish:?•Given any open convex set U containing F, there is an implementable discretization of the SSDP (or SSILP) Relaxation Method which generates a compact convex set C such that F⊆C⊆U in a finite number of iterations.?The localization technique is for the cases where we are only interested in upper bounds on the optimal objective value (for a fixed objective function vector c) but not in a global approximation of the convex hull of F. This technique allows us to generate a convex relaxation of F that is accurate only in certain directions in a neighborhood of the objective direction c. This cuts off redundant work to make the convex relaxation accurate in unnecessary directions. We establish:?•Given any positive number ε, there is an implementable localization-discretization of the SSDP (or SSILP) Relaxation Method which generates an upper bound of the objective value within ε of its maximum in a finite number of iterations. Received: June 30, 1998 / Accepted: May 18, 2000?Published online September 20, 2000     

The ring lemma in three dimensions

Suppose that n cyclically tangent discs with pairwise disjoint interiors are externally tangent to and surround the unit disc. The sharp ring lemma in two dimensions states that no disc has a radius below c _n (R ²) = (F _2n−3−1)⁻¹—where F _k denotes the kth Fibonacci number—and that the lower bound is attained in essentially unique Apollonian configurations. In this article, generalizations of the ring lemma to three dimensions are discussed, a version of the ring lemma in three dimensions is proved, and a natural generalization of the extremal two-dimensional configuration—thought to be extremal in three dimensions—is given. The sharp three-dimensional ring lemma constant of order n is shown to be bounded from below by the two-dimensional constant of order n − 1.     

Finsler metrics with constant （or scalar） flag curvature

A Finsler metric on a manifold M with its flag curvature K is said to be almost isotropic flag curvature if K =3c + σ where σ and c are scalar functions on M.In this paper,we establish the intrinsic re...     

Approximation of analytic by Borel sets and definable countable chain conditions

LetI be a σ-ideal on a Polish space such that each set fromI is contained in a Borel set fromI. We say thatI fails to fulfil theΣ ₁ ¹ countable chain condition if there is aΣ ₁ ¹ equivalence relation with uncountably many equivalence classes none of which is inI. Assuming definable determinacy, we show that if the family of Borel sets fromI is definable in the codes of Borel sets, then eachΣ ₁ ¹ set is equal to a Borel set modulo a set fromI iffI fulfils theΣ ₁ ¹ countable chain condition. Further we characterize the σ-idealsI generated by closed sets that satisfy the countable chain condition or, equivalently in this case, the approximation property forΣ ₁ ¹ sets mentioned above. It turns out that they are exactly of the formMGR(F)={A : ∀F ∈ F A ∩F is meager inF} for a countable family F of closed sets. In particular, we verify partially a conjecture of Kunen by showing that the σ-ideal of meager sets is the unique σ-ideal onR, or any Polish group, generated by closed sets which is invariant under translations and satisfies the countable chain condition. Research partially supported by NSF grant DMS-9317509.     

A numerical approach to a minimum problem with applications in image segmentation

A numerical approach to the problem: minF ^λ(E), whereF ^λ(E)=P(E,R ⁿ )+λ|Ω/E|, is considered. The functionalF ^λ is approximated, using techniques of Γ-convergence, with a sequence of functionals that are successively discretized by finite differences. A relation between the index of the approximating sequence and the meshsize of the domain is found.

---

Riassunto Viene presentato un approccio numerico del problema: minF ^λ(E), doveF ^λ(E)=P(E,R ⁿ )+λ|Ω/E|. Il funzionaleF ^λ viene approssimato, usando tecniche di Γ-convergenza, con una successione di funzionali, successivamente discretizzati con differenze finite. Viene trovata una relazione tra l'indice della successione approssimante e il passo del reticolo del dominio.

     

Bounds of the Ideal Class Numbers of Real Quadratic Function Fields

The theory of continued fractions of functions is used to give a lower bound for class numbers h(D) of general real quadratic function fields K=k(D)over k=Fq(T)．For five series of real quadratic function fields K,the bounds of h(D)are given more explicitly,e．g.,if D=F^2 C．then h(D)≥degF／degP;if D=(SG)^2 cS．then h(D)≥degS／degP;if D=(A^m a)^2 A,then h(D)≥degA／degP,where P is an irreducible polynomial splitting in K,c∈Fq．In addition,three types of quadratic function fields K are found to have ideal class numbers bigger than one．     

The hyperspace of the regions below continuous maps with the fell topology

For a Tychonoff space X,we use ↓USC F(X) and ↓C F(X) to denote the families of the hypographs of all semi-continuous maps and of all continuous maps from X to I = [0,1] with the subspace topologies of the hyperspace Cld F(X × I) consisting of all non-empty closed sets in X × I endowed with the Fell topology.In this paper,we shall show that there exists a homeomorphism h:↓USC F(X) → Q = [1,1] ω such that h(↓CF(X))=c0 = {(xn)∈Q| lim n→∞ x n = 0} if and only if X is a locally compact separable metrizable space and the set of isolated points is not dense in X.     

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.     

Difference estimates for continuous and discrete operator semigroups

For suitable bounded operator semigroups (e ^tA ) _t≥0 in a Banach space, we characterize the estimate ‖Ae ^tA ‖≤c/F(t) for large t, where F is a function satisfying a sublinear growth condition. The characterizations are by holomorphy estimates on the semigroup, and by estimates on powers of the resolvent. We give similar characterizations of the difference estimate ‖T ⁿ −T ⁿ⁺¹‖≤c/F(n) for a power-bounded linear operator T, when F(n) grows faster than n ^1/2 for large n.     

Correlated equilibria of games with many players

Let G _m,n be the class of strategic games with n players, where each player has m≥2 pure strategies. We are interested in the structure of the set of correlated equilibria of games in G _m,n when n→∞. As the number of equilibrium constraints grows slower than the number of pure strategy profiles, it might be conjectured that the set of correlated equilibria becomes large. In this paper, we show that (1) the average relative measure of the set of correlated equilibria is smaller than 2⁻ⁿ; and (2) for each 1<c<m, the solution set contains c ⁿ correlated equilibria having disjoint supports with a probability going to 1 as n grows large. The proof of the second result hinges on the following inequality: Let c ₁, …, c _l be independent and symmetric random vectors in R ^k, l≥k. Then the probability that the convex hull of c ₁, …, c _l intersects R ^k ₊ is greater than or equal to . Received: December 1998/Final version: March 2000     

<Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>(<Emphasis Type="Italic">μ</Emphasis>) for vector-valued measure <Emphasis Type="Italic">μ</Emphasis>

Let μ be a measure from a σ-algebra of subsets of a set T into a sequentially complete Hausdorff topological vector space X. Assume that μ is convexly bounded, i.e., the convex hull of its range is bounded in X, and denote by L ¹(μ) the space of scalar valued functions on T which are integrable with respect to the vector measure μ. We study the inheritance of some properties from X to L ¹(μ). We show that the bounded multiplier property passes from X to L ¹(μ). Answering a 1972 problem of Erik Thomas, we show that for a rather large class of F-spaces X the non-containment of c ₀ passes from X to L ¹(μ).     

Classification of the isomorphic types of martingale-H 1 spaces

LetF _n be an increasing sequence of finite fields on a probability space (Ω,F _n,P) whereF denotes the σ-algebra generated by ∪F _n. ThenF _n is isomorphic to one of the following spaces:H ¹(δ), ΣH _n ¹ ,l ^l.     

Packing,covering and decomposing of a complete uniform hypergraph into delta-systems

Anh-uniform hypergraph generated by a set of edges {E ₁,...,E _c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE _i⌢E _j=F,∀i≠j. The main result of this paper says that givenp, h andc, there isn ₀ such that forn≥n ₀ the set of edges of a completeh-uniform hypergraphK _n ^h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if . This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK _n ^h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK _n ^h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK _n ^h into subsets generating small but not necessarily isomorphic delta-systems.