A bounded law of the iterated logarithm for Hilbert space valued martingales and its application to U-statistics

Summary A bounded law of the iterated logarithm for martingales with values in a separable Hilbert space H is proved. It is then applied to prove invariance principles for U-statistics for independent identically distributed (-valued) random variables {X _j , j1} and a kernel h: ^m H, m2, which is degenerate for the common distribution function of X _j , j1. This extends to general m results of an earlier paper on this subject and even gives new results in the case H=.     

On Identities in Algebras Q n,λ Generated by Idempotents

We investigate the presence of polynomial identities in the algebras Q _n, generated by n idempotents with the sum e ( and e is the identity of an algebra). We prove that Q _4,2 is an algebra with the standard polynomial identity F ₄, whereas the algebras Q _4,, 2, and Q _n,, n 5, do not have polynomial identities.     

Invariant measures ofC 2-diffeomorphisms of Markov type inR d

A class of uniformly expanding, piecewiseC ²-diffeomorphisms from domainsIR ^d (bounded or not) into themselves is considered. It is shown that the number of the extreme points of Fix (P )={gG:Pg=g} whereP is the Frobenius-Perron operator associated with andG={gL ¹: g0 g=1}, can be determined in an effective way. Moreover, it is shown that the sequence {P ^j g} is convergent inL ¹ for anygG, and in the topology of uniform convergence for anygG(1). The limit is a linear projectionR inL ¹ (defined by (3.1)) which mapsG onto Fix (P ) (see Th. 3.1).Dedicated to professor A. Lasota on the occasion of his 60th birthday     

Spreads admitting elliptic regulizations

Throughout this paper, the underlying projective space is 3-dimensional and Pappian. A spreadL admits aregulization , if is a collection of reguli contained inL and if each element ofL, except at most two lines, is contained either in exactly one regulus of or in all reguli of . Replacement of each regulus of by its complementary regulus (exceptional lines remain unchanged) produces thecomplementry congruence L ^c of L with respect to . IfL ^c is an elliptic linear congruence of lines, then we call anelliptic regulization. Applying a method due to Thas and Walker we construct topological spreads of PG(3,) which admit one elliptic and no further regulization. For each of these spreads we determine the group of automorphic collineations. Among others we obtain also spreads which are the complete intersection of a general linear complex of lines and of a cubic complex of lines.In conclusion, I would like to thank H. H{upavlicek} (Vienna) for valuable suggestions in the preparation of this article.     

Increase of stable processes

One says thatt>0 is an increase time for a real-valued path if stays above the level (t) immediately after timet, and below (t) immediately before timet. Dvoretzkyet al.,⁽¹⁰⁾ proved that Brownian motion has no increase times a.s. This result is extended here to (strictly) stable processes. Specifically, the probability that a stable processX possesses increase times is 0 if and only ifP(X ₁0)1/2.     

On Almost β-Continuous Functions

A subset A of a topological space is said to be -open [1] if A Cl(Int(Cl(A))). A function f : X Y is said to be almost -continuous [18] if for each point x X and each open neighbourhood V of f(x) there exists a -open set U containing x such that f(U) Int(Cl(V)). Some new characterizations and several fundamental properties are obtained.     

Variable speed coating with purely viscous non-Newtonian fluids

The flow between variable speed rollers is considered of purely viscous non-Newtonian fluids which obey the power law. The objective is to determine the dependence of the coating thickness on the upper roller,h ₁ , as a function of modified capillary number, ₁, of power indexn and speed ratioS=U ₁/U ₂ whereU ₁,U ₂ are the speeds of upper and lower rollers respectively. Analytical/numerical solutions are obtained forS close to unity;S=1+ where 1.

---

Zusammenfassung Die Strömung zwischen zwei mit verschiedenen Geschwindigkeiten rotierenden Metallzylindern wird untersucht für rein viskose nicht-newtonische Flüssigkeiten, welche einem Potenzgesetz gehorchen. Das Ziel ist die Bestimmung der Abhängigkeit der Schichtdickeh ₁ am oberen Zylinder als Funktion der modifizierten Kapillaritätszahl ₁, des Geschwindigkeitsexponentenn und des VerhältnissesS=U ₁/U ₂, wobeiU ₁ undU ₂ die Geschwindigkeiten des oberen und unteren Zylinders sind. Analytische und numerische Lösungen liegen vor für den FallS nahe zu Eins.

     

Statistically self-affine sets: Hausdorff and box dimensions

We introduce a class of random sets in ₂ that include McMullen's generalized Sierpinski carpets. We give exact expressions for the Hausdorff and Bouligand-Minkowski (box) dimensions of these sets, and find in particular that typically they are not equal. Our expression for the Hausdorff dimension isnot what one would expect by analogy with McMullen's formula for the Hausdorff dimension of a generalized Sierpinski carpet.Supported by Davis Ross Grant.Supported by NSF Grant DMS-9146252. Department of Statistics, Purdue University.     

Ein Störungssatz für abgeschlossene,lineare Operatoren

Zusammenfassung In vorliegender Note wird ein Satz von Kato [7] über die Störung eines abgeschlossenen, normal auflösbaren OperatorsT mit endlichem Null-defekt (T) durch einen streng singulären Operator verallgemeinert. Zu diesem Zweck wird für jedes 0 mit Hilfe des Kuratowskischen Nichtkompaktheitsmaßes eine KlasseC von beschränkten, linearen Operatoren eingeführt, welche sowohl die streng singulären Operatoren als auch die OperatorenS mit S enthält.Das erzielte Resultat steht in engem Zusammenhang mit den Untersuchungen von Gol'denteinn, Gohberg und Markus [5] und von Gol'denteienn und Markus [6].     

On the sublattices of the Barnes-wall lattice

This paper is connected with the fundamental work of E.S. Barnes and G.E. Wall [1] in which the authors defined the so-called Barnes-Wall lattice. We shall determine the number of minima of some special sublattices of dimension 2 ⁿ –k of this lattice, where 1kn.Supported by Hung. Nat. Found for Sci. Research (OTKA) grant no. 1615 (1992)     

Level set representation for the Gibbs states of the ferromagnetic ising model

Summary We prove the existence of a real valued random field with parameters in thed-dimensional cubic lattice, such that the distribution of the level set of this random field is a Gibbs state for the nearest neighbour ferromagnetic Ising model. Using this, we prove the continuity of the percolation probability with respect to the parameter (,h) in the uniqueness region except on the critical curve _c ={(,h _c ())}, whereh _c() is the critical level of the external field above which percolation takes place.Supported in part by JSPS, BiBoS, Grant in Aid for Cooperative research no. 62303006 and Grant in Aid for Scientific Research no. 63540168     

Explicit matchings in the middle levels of the Boolean lattice

New classes of explicit matchings for the bipartite graph (k) consisting of the middle two levels of the Boolean lattice on 2k+1 elements are constructed and counted. This research is part of an ongoing effort to show that (k) is Hamiltonian.Supported by Office of Naval Research contract N00014-85K-0494.Supported by National Science Foundation grant DMS-8041281.     

Almost constant sequences and well-distribution in compact groups

We study the properties of sequences (c _n ) in a compact groupG such that (x _n ) being (weakly) well-distributed implies (c _n x _n ) being (weakly) well-distributed and give a complete characterisation in terms of almost constant sequences as well as a generalisation to non-compact locally compact groups.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

How non-uniform can a uniform sample be: a histogram approach

Summary Let _n be the empirical probability measure associated with n i.i.d. random vectors each having a uniform distribution in the unit square S of the plane. After _n is known, take the worst partition of the square into kn rectangles R _i, each with its short side at least times as long as the long side, and let Z= n|_n(R _j)–(R _j)|. We prove distribution inequalities for Z implying the right half of c _p,(n,k)^p/2 EZ ^p C _p,(n,k ^p/2, p > 0. (The left half follows easily by considering non-random partitions.) Similar results are obtained in other dimensions, and for population distributions other than uniform, and our results are related to data based histogram density estimation.Supported by NSF Grant MCS 8201128Supported by NSF Grant DMS-8401996     

On cuts and matchings in planar graphs

We study the max cut problem in graphs not contractible toK ₅, and optimum perfect matchings in planar graphs. We prove that both problems can be formulated as polynomial size linear programs.Supported by the joint project Combinatorial Optimization of the Natural Sciences and Engineering Research Council of Canada and the German Research Association (Deutsche Forschungsgemeinschaft, SFB 303).     

An intersection property for starshaped sets in the plane

Let be a family of compact starshaped sets in the plane. If every three and every two members of have a union which is connected and simply connected, then {F:F in } is simply connected and nonempty. Of course, if every three and every two members of have a starshaped union, the same result holds.Supported in part by NSF grants DMS-8705336, DMS-8908717 and by a Senior Faculty Summer Research Fellowship, Research Council, University of Oklahoma.     

Nonabelian K-theory: The nilpotent class of K1 and general stability

A functorial filtration GL _n =S^–1L _n S⁰L _n S ⁱ L _n E _n of the general linear group GL _{n, n} 3, is defined and it is shown for any algebra A, which is a direct limit of module finite algebras, that S^–1 L _n (A)/S⁰L _n (A) is abelian, that S⁰L _n (A) S¹L _n (A) is a descending central series, and that S ⁱ L _n (A) = E _n(A) whenever i the Bass-Serre dimension of A. In particular, the K-functors k ₁ S ⁱ L _n =S ⁱ L _n /E _n are nilpotent for all i 0 over algebras of finite Bass-Serre dimension. Furthermore, without dimension assumptions, the canonical homomorphism S ⁱ L _n (A)/S ⁱ⁺¹ L _n (A)S ⁱ L _{n+ 1}(A)/S ⁱ⁺¹ L _{n + 1} (A) is injective whenever n i + 3, so that one has stability results without stability conditions, and if A is commutative then S⁰L _n (A) agrees with the special linear group SL _n (A), so that the functor S⁰L _n generalizes the functor SL _n to noncommutative rings. Applying the above to subgroups H of GL _n (A), which are normalized by E _n(A), one obtains that each is contained in a sandwich GL _n (A, ) H E _n(A, ) for a unique two-sided ideal of A and there is a descending S⁰L _n (A)-central series GL _n (A, ) S⁰L _n (A, ) S¹L _n (A, ) S ⁱ L _n (A, ) E _n(A, ) such that S ⁱ L _n (A, )=E _n(A, ) whenever i Bass-Serre dimension of A.Dedicated to Alexander Grothendieck on his sixtieth birthday     

On a coupled system of abstract differential equations similar to the thermoelasticity equations

The study of a model system of differential equations arising from the dynamical problems of thermo elasticity is continued. The case of shifts of the general type is investigated. We employ the commutant method based on the properties of the operator (A,B)=AB-BA.Translated from Ukrainskii Matematicheskii Zhumal, Vol. 45, No. 8, pp. 1162–1165, August, 1993.     

Patching upX-trees

A fundamental problem in many areas of classification, and particularly in biology, is the reconstruction of a leaf-labeled tree from just a subset of its induced subtrees. Without loss of generality, we may assume that these induced subtrees all have precisely four leaves. Of particular interest is determining whether a collection of quartet subtrees uniquely defines a parent tree. Here, we solve this problem in the case where the collection of quartet trees is of minimal size, by studyingencodings of binary trees by such quartet trees. We obtain a characterization of minimal encodings that exploits an underlying patchwork structure. As we will show elsewhere, this allows one to obtain a polynomial time algorithm for certain instances of the problem of reconstructing trees from subtrees.Supported by DFG — Graduiertenkolleg Strukturbildungsprozesse, Forschungsschwerpunkt Mathematisierung, University of Bielefeld, Germany.Supported by the New Zealand Marsden Fund.