Transversally bounded lattices

A problem stemming from a boundedness question for torsion modules and its translation into ideal lattices is explored in the setting of abstract lattices. Call a complete lattice L transversally bounded (resp., uniformly transversally bounded) if for all families (X _i)_iIof nonempty subsets of L with the property that {x _iiI}<1 for all choices of x _iX _i, almost all of the sets X _ihave join smaller than 1 (resp., _jJ X _jhas join smaller than 1 for some cofinite subset J of I). It is shown that the lattices which are transversally bounded, but not uniformly so, correspond to certain ultrafilters with peculiar boundedness properties similar to those studied by Ramsey. The prototypical candidates of the two types of lattices which one is led to construct from ultrafilters (in particular the lattices arising from what will be called Ramsey systems) appear to be of interest beyond the questions at stake.     

The normal subgroup lattice of 2-transitive automorphism groups of linearly ordered sets

Using combinatorial and model-theoretic means, we examine the structure of normal subgroup lattices N(A()) of 2-transitive automorphism groups A() of infinite linearly ordered sets (, ). Certain natural sublattices of N(A()) are shown to be Stone algebras, and several first order properties of their dense and dually dense elements are characterized within the Dedekind-completion of (, ). As a consequence, A() has either precisely 5 or at least 2²¹ (even maximal) normal subgroups, and various other group- and lattice-theoretic results follow.     

Two congruence lattices of completely simple semigroups

For a Rees matrix semigroupS with normalized sandwich matrix and C(S), the congruence lattice ofS, we consider the lattice generated by {itpT_l, pK, pT_r, pt_l, pk, pt_r}. HerepT ₁ andpt _l are the upper and lower ends of the interval which makes up the _i -class of , _i being the left trace relation onC(S). The remaining symbols have the analogous meaning relative to the kernel and the right trace relations. We also consider the lattice generated by {T _l, K, T_r, t_l, _k, t_r} where and are the equality and the universal relations onS, respectively. In both cases, we find lattices freest relative to these lattices and represent them as distributive lattices with generators and relations.With 3 Figures     

Embeddings of Banach Spaces Into Banach Lattices and the Gordon–Lewis Property

In this paper we first show that if X is a Banach space and is a left invariant crossnorm on lX, then there is a Banach lattice L and an isometric embedding J of X into L, so that I J becomes an isometry of lX onto l_m J(X). Here I denotes the identity operator on l and l_m J(X) the canonical lattice tensor product. This result is originally due to G. Pisier (unpublished), but our proof is different. We then use this to prove the main results which characterize the Gordon–Lewis property GL and related structures in terms of embeddings into Banach lattices.     

A new interpolation procedure for adapting Runge-Kutta methods to delay differential equations

This paper deals with adapting Runge-Kutta methods to differential equations with a lagging argument. A new interpolation procedure is introduced which leads to numerical processes that satisfy an important asymptotic stability condition related to the class of testproblemsU(t)=U(t)+U(t–) with , C, Re()<–||, and >0. Ifc _i denotes theith abscissa of a given Runge-Kutta method, then in thenth stept _n–1t _n :=t _n–1+h of the numerical process our interpolation procedure computes an approximation toU(t _n–1+c _i h–) from approximations that have already been generated by the process at pointst _j–1+c _i h(j=1,2,3,...). For two of these new processes and a standard process we shall consider the convergence behaviour in an actual application to a given, stiff problem.     

Reconstructing dimensions of intersections of convex sets

Denoting by dimA the dimension of the affine hull of the setA, we prove that if {K _i:i T} and {K _i ^j :i T} are two finite families of convex sets inR ⁿ and if dim {K _i :i S} = dim {K _i ^j :i S}for eachS T such that|S| n + 1 then dim {K _i :i T} = dim {K _i : {i T}}.     

The distortion of Hilbert space

The unit sphere of Hilbert space, ₂, is shown to contain a remarkable sequence of nearly orthogonal sets. Precisely, there exist a sequence of sets of norm one elements of ₂, (C _i ) _i=1 , and reals _i 0 so that a) each setC _i has nonempty intersection with every infinite dimensional closed subspace of ₂ and b) forij,xC, andyC _j , |x, y|<_{min(i, j)} E. Odell was partially supported by NSF and TARP. Th. Schlumprecht was partially supported by NSF and LEQSF.     

HSP ≠ SHPS for metabelian groups,and related results

For the standard operators on classes of algebras,H (homomorphic images),S (subalgebras) andP (products), and the further operatorP _f of finite products, it is shown by counterexamples thatHSP SHPS andHSP _f SHP _fS for metabelian groups (groups satisfyingG={e}) and thatHSP _f SHPS for solvable groups (in fact, for finite groups satisfying (G, G)= {e}). From the first two inequalities and some easier examples, it follows that the partially ordered semigroups of operators on metabelian groups generated by {H, S, P} and by {H, S, P _f } are as in the standard 18-element diagram.In Memory of Evelyn NelsonThis work was done while the author was partly supported by NSF contracts MCS 82-02632 and DMS 85-02330.Presented by Robert W. Quackenbush.     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Lattice-ordered groups whose lattices of convex l-subgroups guarantee noncommutativity

Paul Conrad has asked whether for every lattice-ordered group G, there exists an Abelian N sharing its lattice C(G) of convex l-subgroups, i.e., such that C(N)C(G). Several counter-examples are exhibited, including all free l-groups of uncountably infinite rank. Also, for A() the l-group of order-automorphisms of the real line , it is shown that any N sharing its C would have to be an l-subgroup of the l-group C() of continuous real-valued functions-and that C(C())C(A()).This work was done while the author was spending a most enjoyable year at Boise State University.     

Krasnosel'skii numbers for bounded finitely starlike sets inR d

For eachk andd, 1kd, definef(d, d)=d+1 andf(d, k)=2d if 1kd–1. The following results are established:Let be a uniformly bounded collection of compact, convex sets inR ^d . For a fixedk, 1kd, dim {MM in }k if and only if for some > 0, everyf(d, k) members of contain a commonk-dimensional set of measure (volume) at least.LetS be a bounded subset ofR ^d . Assume that for some fixedk, 1kd, there exists a countable family of (k–l)-flats {H _i :i1} inR ^d such that clS S {H_i i 1 } and for eachi1, (clS S) H _i has (k–1) dimensional measure zero. Every finite subset ofS sees viaS a set of positivek-dimensional measure if and only if for some>0, everyf(d,k) points ofS see viaS a set ofk-dimensional measure at least .The numbers off(d,d) andf(d, 1) above are best possible.Supported in part by NSF grant DMS-8705336.     

Les classes de Chern des représentations galoisiennes complexes

Let F be a field, G _F its absolute Galois group, : G _FGL(C) a continuous complex representation of G _F and c _i() H_2i(F, Z) its Chern classes. We show, under a mild assumption on F. that c _i ()=0 for all i2. For general F, one has that 2c_i ()=0 for all i 2.

Cette dernière condition résulte en fait de la continuité de .     

A strong approximation for logarithmic averages of partial sums of random variables

LetS _n be the partial sums of -mixing stationary random variables and letf(x) be a real function. In this note we give sufficient conditions under which the logarithmic average off(S _n / _n ) converges almost surely to _– f(x)d(x). We also obtain strong approximation forH(n)= _k=1 ⁿ k ^–1 f(S _k /k)=logn _– f(x)d(x) which will imply the asymptotic normality ofH(n)/log^1/2 n. But for partial sums of i.i.d. random variables our results will be proved under weaker moment condition than assumed for -mixing random variables.     

On the automorphism conjecture for products of ordered sets

I. Rival and A. Rutkowski conjectured that the ratio of the number of automorphisms of an arbitrary poset to the number of order-preserving maps tends to zero as the size of the poset tends to infinity. We prove this hypothesis for direct products of arbitrary posets P=S ₁××S _n under the condition that max_i|S_i|=0(n/logn).     

Universalities

We show that a quotient category of the category of all topological spaces and all open continuous mappings contains an isomorphic copy of every category as a full subcategory. We construct a functorF : K K universal in the following sense: for every functorH : H ₁ H ₂ (H ₁,H ₂ arbitrary) there exist full one-to-one functors _i :H _i K such thatF o ₁ = ₂ oH (the construction proceeds in a more general setting of enriched categories).     

Logarithms and imaginary powers of closed linear operators

The imaginary powersA ^it of a closed linear operatorA, with inverse, in a Banach spaceX are considered as aC ₀-group {exp(itlogA);t R} of bounded linear operators onX, with generatori logA. Here logA is defined as the closure of log(1+A) – log(1+A ^–1). LetA be a linearm-sectorial operator of typeS(tan ), 0(/2), in a Hilbert spaceX. That is, |Im(Au, u)| (tan )Re(Au, u) foru D(A). Then ±ilog(1+A) ism-accretive inX andilog(1+A) is the generator of aC ₀-group {(1+A) ^it ;t R} of bounded imaginary powers, satisfying the estimate (1+A) ^it exp(|t|),t R. In particular, ifA is invertible, then ±ilogA ism-accretive inX, where logA is exactly given by logA=log(1+A)–log(1+A ^–1), and {A ^it;t R} forms aC ₀-group onX, with the estimate A ^it exp(|t|),t R. This yields a slight improvement of the Heinz-Kato inequality.     

On Decomposing an Abelian p-Group Under a p′-Operator Group

Let A be a p-group acting on a finite Abelian p-group P. We give a necessary and sufficient condition on an A-irreducible decomposition of ₁(P) = _i1U_i for the existence of an A-indecomposable decomposition of P = _i1R_i such that ₁(R_i) = U_i for all i I. This readily implies a main result of [1].2000 Mathematics Subject Classification: 20D15     

Finitely starlike sets whose F-stars have positive measure

Let and assume that there is a countable collection of lines {L _i : 1 i} such that (int cl S) and ((int cl S) S) L _i has one-dimensional Lebesgue measure zero, 1 i. Then every 4 point subset ofS sees viaS a set of positive two-dimensional Lebesgue measure if and only if every finite subset ofS sees viaS such a set. Furthermore, a parallel result holds with two-dimensional replaced by one-dimensional. Finally, setS is finitely starlike if and only if every 5 points ofS see viaS a common point. In each case, the number 4 or 5 is best possible.Supported in part by NSF grant DMS-8705336.     

More on P-Stable Convex Sets in Banach Spaces

We study the asymptotic behavior and limit distributions for sums S _n =b_n ^-1 _i=1 ⁿ _i,where _i, i 1, are i.i.d. random convex compact (cc) sets in a given separable Banach space B and summation is defined in a sense of Minkowski. The following results are obtained: (i) Series (LePage type) and Poisson integral representations of random stable cc sets in B are established; (ii) The invariance principle for processes S _n(t) =b_n ^-1 _i=1 ^[nt] _i, t[0, 1], and the existence of p-stable cc Levy motion are proved; (iii) In the case, where _i are segments, the limit of S _n is proved to be countable zonotope. Furthermore, if B = R ^d , the singularity of distributions of two countable zonotopes Y_{p 1}, ₁,Y_{p 2}, ₂, corresponding to values of exponents p ₁, p ₂ and spectral measures ₁, ₂, is proved if either p ₁ p ₂ or _{1 2}; (iv) Some new simple estimates of parameters of stable laws in R ^d , based on these results are suggested.     

How to build a barricade

Given a packing of congruent copies of a strictly convex planar setC in a parallel stripS of widthw and a straight linel, let |l| denote the sum of the lengths of the segmentslC _i over alliI It is proved that Where (C) is the density of the densest packing of congruent copies ofC in the plane. Some generalizations are also considered.