Convergence of series of translations

For a mean zero norm one sequence (f _n )L ₂[0, 1], the sequence (f _n {nx+y}) is an orthonormal sequence inL ₂([0, 1]²); so if , then converges for a.e. (x, y)[0, 1]² and has a maximal function inL ₂([0, 1]²). But for a mean zerofL ₂[0, 1], it is harder to give necessary and sufficient conditions for theL ₂-norm convergence or a.e. convergence of . Ifc _n 0 and , then this series will not converge inL ₂-norm on a denseG subset of the mean zero functions inL ₂[0, 1]. Also, there are mean zerofL[0, 1] such that never converges and there is a mean zero continuous functionf with a.e. However, iff is mean zero and of bounded variation or in some Lip() with 1/2<1, and if |c _n | = 0(n ^–) for >1/2, then converges a.e. and unconditionally inL ₂[0, 1]. In addition, for any mean zerof of bounded variation, the series has its maximal function in allL _p[0, 1] with 1p<. Finally, if (f _n )L [0, 1] is a uniformly bounded mean zero sequence, then is a necessary and sufficient condition for to converge for a.e.y and a.e. (x _n )[0, 1]. Moreover, iffL [0, 1] is mean zero and , then for a.e. (x _n )[0, 1], converges for a.e.y and in allL _p [0, 1] with 1p<. Some of these theorems can be generalized simply to other compact groups besides [0, 1] under addition modulo one.     

An Improvement of an Inequality of Fiedler Leading to a New Conjecture on Nonnegative Matrices

Suppose that A is an n × n nonnegative matrix whose eigenvalues are = (A), ₂, ..., _n. Fiedler and others have shown that \det( I -A) ⁿ - ⁿ, for all > with equality for any such if and only if A is the simple cycle matrix. Let a _i be the signed sum of the determinants of the principal submatrices of A of order i × i, i=1, ..., n - 1. We use similar techniques to Fiedler to show that Fiedler's inequality can be strengthened to: for all . We use this inequality to derive the inequality that: . In the spirit of a celebrated conjecture due to Boyle-Handelman, this inequality inspires us to conjecture the following inequality on the nonzero eigenvalues of A: If ₁ = (A), ₂,...,_k are (all) the nonzero eigenvalues of A, then . We prove this conjecture for the case when the spectrum of A is real.     

A representation theorem for weak automorphisms of a universal algebra

Given a group G and a descending chainG ₀,G ₁,...,G _n, of normal subgroups ofG, we prove that there exists a universal algebra , such that the chain ...W_n( )...W₁( }) W₀( )W( ) is isomorphic to the chain ...G _n ...G ₁G ₀G, where W( ) is the group of weak automorphisms of , and W_n( ) is the group of weak automorphisms of that leaves alln-ary operations fixed.We also prove that there are an infinite number of non-isomorphic algebras that satisfy the above.These results are a generalization of those proved by J. Sichler, in the special case when G=G₀, and G₁=G₂=...=G_n=....Presented by J. Mycielski.This paper comprises part of the author's doctoral dissertation at the University of Notre Dame in 1983. The author wishes to express her deep gratitude to Professor Abraham Goetz for suggesting this problem, for being extremely generous with his time and experience, and for giving her his constant encouragement. The author also thanks the reviewer for his helpful comments.     

Boundary Asymptotics for Orthogonal Rational Functions on the Unit Circle

Let w() be a positive weight function on the unit circle of the complex plane. For a sequence of points { _k } _{k = 1} included in a compact subset of the unit disk, we consider the orthogonal rational functions _n that are obtained by orthogonalization of the sequence { 1, z / ₁, z ² / ₂, ... } where , with respect to the inner product In this paper we discuss the behaviour of _n (t) for t = 1 and n under certain conditions. The main condition on the weight is that it satisfies a Lipschitz–Dini condition and that it is bounded away from zero. This generalizes a theorem given by Szeg in the polynomial case, that is when all _k = 0.     

Generalized Quasi-Variational Inequalities Without Continuities

Given a nonempty set and two multifunctions , we consider the following generalized quasi-variational inequality problem associated with X, : Find such that . We prove several existence results in which the multifunction is not supposed to have any continuity property. Among others, we extend the results obtained in Ref. 1 for the case (x(X.     

Die Verteilung der schlichten Funktionen in einem Funktionenraum

We consider the set of regular functions . We construct a Borel measure and a class of outer measures _h onH. With these and _h we show that: (HS)=0 and _h (HS)=0, (S is the set of normed univalent functions). From _h (HS)=0 follows—forh=t —that the Hausdorff—Billingsley-dimension ofHS is zero.     

Daugavet type inequalities for operators on L p–spaces

Let T be a regular operator from L ^p L ^p. Then , where T_r denotes the regular norm of T, i.e., T_r=|T| where |T| denotes the modulus operator of a regular operator T. For p=1 every bounded linear operator is regular and T=T_r, so that the above inequality generalizes the Daugavet equation for operators on L ¹–spaces. The main result of this paper (Theorem 9) is a converse of the above result. Let T be a regular linear operator on L _p and denote by T _A the operator T_A. Then for all A with (A)>0 if and only if .     

An alternative construction of Conway's ordered field No

An -universally extending ordered field of power is constructed for each regular power where 0 < On and . When is inaccessible, the structure is either a (set) model of J. H. Conway's ordered field No or an isomorphic copy of No depending on whether or not is a set or a proper class.Presented by Jan Mycielski.     

An application of Shoenfield's absoluteness theorem to the theory of uniform distribution

IfC is a Polish probability space, a Borel set whose sectionsW _x ( have measure one and are decreasing , then we show that the set _x W _x has measure one. We give two proofs of this theorem—one in the language of set theory, the other in the language of probability theory, and we apply the theorem to a question on completely uniformly distributed sequences.Supported by DFG grant Ko 490/7-1.     

Convex independent sets and 7-holes in restricted planar point sets

For a finite setA of points in the plane, letq(A) denote the ratio of the maximum distance of any pair of points ofA to the minimum distance of any pair of points ofA. Fork>0 letc (k) denote the largest integerc such that any setA ofk points in general position in the plane, satisfying for fixed , contains at leastc convex independent points. We determine the exact asymptotic behavior ofc (k), proving that there are two positive constants=(), such thatk ^1/3c (k)k ^1/3. To establish the upper bound ofc (k) we construct a set, which also solves (affirmatively) the problem of Alonet al. [1] about the existence of a setA ofk points in general position without a 7-hole (i.e., vertices of a convex 7-gon containing no other points fromA), satisfying . The construction uses Horton sets, which generalize sets without 7-holes constructed by Horton and which have some interesting properties.     

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Denote by the class of all triangle-free graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical triangle-free graph is bipartite. Fix > 0 and let . If n/2 m (1 – ) t ₃, then almost all graphs in are not bipartite, whereas if m (1 + )t ₃, then almost all of them are bipartite. For m (1 + )t ₃, this allows us to determine asymptotically the number of graphs in . We also obtain corresponding results for C -free graphs, for any cycle C of fixed odd length. Forschergruppe Algorithmen, Struktur, Zufall supported by Deutsche Forschungsgemeinschaft grant FOR 413/1-1     

Moyennes uniformes et moyennes suivant une marche aléatoire

Summary Let be a bounded function on such that converges towards l as n goes to infinity, uniformly with respect to m. Let {X _n} be a random walk on , not concentrated on a proper subgroup of Then, with probability 1, converges towards l as n goes to infinity. The result also holds for any countable abelian group instead of . Other modes of convergence are considered (Cesaro convergence of order >1/2). The Cesaro convergence of expressions such that (X _n) (X _n+1) is also investigated.     

Random Logistic Maps II. The Critical Case

Let (X _n ) ₀ be a Markov chain with state space S=[0,1] generated by the iteration of i.i.d. random logistic maps, i.e., X _n+1=C _n+1 X _n (1–X _n ),n0, where (C _n ) ₁ are i.i.d. random variables with values in [0, 4] and independent of X ₀. In the critical case, i.e., when E(log C ₁)=0, Athreya and Dai⁽²⁾ have shown that X _n ^P 0. In this paper it is shown that if P(C ₁=1)<1 and E(log C ₁)=0 then(i) X _n does not go to zero with probability one (w.p.1) and in fact, there exists a 0<<1 and a countable set (0,1) such that for all xA(0,1), P _x (X _n for infinitely many n1)=1, where P _x stands for the probability distribution of (X _n ) ₀ with X ₀=x w.p.1. A is a closed set for (X _n ) ₀.(ii) If is the supremum of the support of the distribution of C ₁, then for all xA (a)

A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound

Let k and d be any integers such that k 4 and . Then there exist two integers and in {0,1,2} such that . The purpose of this paper is to prove that (1) in the case k 5 and (,) = (0,1), there exists a ternary code meeting the Griesmer bound if and only if and (2) in the case k 4 and (,) = (0,2) or (1,1), there is no ternary code meeting the Griesmer bound for any integers k and d and (3) in the case k 5 and , there is no projective ternary code for any integers k and such that 1k-3, where and for any integer i 0. In the special case k=6, it follows from (1) that there is no ternary linear code with parameters [233,6,154] , [234,6,155] or [237,6,157] which are new results.     

Reversible subsets of certain linear transformations

Summary Suppose U is a set,F is a field of subsets of U, p_AB is the set of all real-valued bounded finitely additive functions defined onF, and for each in p_AB, A()={: in p_AB, absolutely continuous with respect to }. SupposeM is a linear subspace of p_AB such that . A generalisation of a previously discussed collection of linear transformations (see J. London Math. Soc., vol. 44 (1969), pp. 385–396) is treated by letting C_M denote the set to which T belongs iff T is a linear transformation from M into p_AB such that for some K inR and all in M and V inF, . Certain theorems of the aforementioned reference are generalized, as well as one of Trans. Amer. Math. Soc., vol. 199, (1974), pp. 131–140. The principal result of the present paper is the following generalisation of a reversibility characterisation in the first mentioned reference: Theorem: If T is in C_M, then (, T()): in M A(T()) is the only reversible subset T⁰ if T such that: i) the domain M⁰ of T⁰ is a linear subspace of M and , and ii) the range of T⁰ is the range of T.     

Sur l'homotopie rationnelle des espaces fonctionnels

Let X be a nilpotent space such that it exists k1 with H^p (X,) = 0 p > k and H^k (X,) 0, let Y be a (m–1)-connected space with mk+2, then the rational homotopy Lie algebra of Y^X (resp. is isomorphic as Lie algebra, to H^* (X,) (_* (Y) ) (resp.⁺ (X,) (_* (Y) )). If X is formal and Y -formal, then the spaces Y^X and are -formal. Furthermore, if dim _* (Y) is infinite and dim H^* (Y,Q) is finite, then the sequence of Betti numbers of grows exponentially.     

Divisibility of Certain Partition Functions by Powers of Primes

Let be the prime factorization of a positive integer k and let b _k (n) denote the number of partitions of a non-negative integer n into parts none of which are multiples of k. If M is a positive integer, let S _k (N; M) be the number of positive integers N for which b _k(n ) 0(mod M). If we prove that, for every positive integer j In other words for every positive integer j, b _k(n) is a multiple of for almost every non-negative integer n. In the special case when k=p is prime, then in representation-theoretic terms this means that the number ofp -modular irreducible representations of almost every symmetric groupS _n is a multiple of p ^j. We also examine the behavior of b _k(n) (mod ) where the non-negative integers n belong to an arithmetic progression. Although almost every non-negative integer n (mod t) satisfies b _k(n) 0 (mod ), we show that there are infinitely many non-negative integers n r (mod t) for which b _k(n) 0 (mod ) provided that there is at least one such n. Moreover the smallest such n (if there are any) is less than 2 .     

On the Harris Recurrence of Iterated Random Lipschitz Functions and Related Convergence Rate Results

A result by Elton⁽⁶⁾ states that an iterated function system

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

The Lattice of Interpretability Types of Cantor Varieties

For integers 1 m < n, a Cantor variety with m basic n-ary operations _i and n basic m-ary operations _k is a variety of algebras defined by identities _k(₁( ), ... , _m( )) = _k and i(₁( ), ... ,_n( )) = y _i, where = (x ₁., ... , x _n) and = (y ₁, ... , y _m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product ₁ × ₂ of a lattice, ₁, of positive integers respecting the natural linear ordering and a lattice, ₂, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.