l p n Superspaces of spans of independent random variables

We show that for 1 ≦p < ∞,p ≠ 2, ifɛ > 0 is small enough andX ≦L _p is the span ofn independent Rademacher functions orn independent Gaussian random variables, then any superspaceY ofX satisfyingd(Y,L _p ^m ) ≦ 1 +ɛ has dimension larger thanr ⁿ, wherer =r(ɛ, p) > 1. This forms part of the author’s doctoral dissertation prepared at Texas A&M University under the direction of Professor W. B. Johnson. Supported in part by NSF DMS-85 00764.     

Analogues of the “zero-two” law for positive linear contractions inL p andC(X)

LetT be a positive linear contraction inL ^p (1≦p<∞), then we show that lim ‖T ^pf −T ⁿ⁺¹ f‖ _p ≦(1 − ε)2^1/p (f∈L _p ⁺ , ε>0 independent off) implies already lim_n n→∞ ‖T ⁿf −T ⁿ⁺¹ n+1f ‖_p p=0. Several other related results as well as uniform variants of these are also given. Finally some similar results inLsu/t8 andC(X) are shown.     

On extremal problems of graphs and generalized graphs

Anr-graph is a graph whose basic elements are its vertices and r-tuples. It is proved that to everyl andr there is anε(l, r) so that forn>n ₀ everyr-graph ofn vertices andn ^{r−ε(l, r)} r-tuples containsr. l verticesx ^(j), 1≦j≦r, 1≦i≦l, so that all ther-tuples occur in ther-graph.     

Density estimation for linear processes

Summary LetX _t , ...,X _n be random variables forming a realization from a linear process where {Z _t } is a sequence of independent and identically distributed random variables with E|Z _t |<∞ for some ε>0, andg _r →0 asr→∞ at some specified rate. LetX ₁ have a probability density functionf. It is then established that for every realx, the standard kernel type estimator based onX _t (1≦t≦n) is, under some general regularity conditions, asymptotically normal and converges a.s. tof(x) asn→∞. Research was supported in part by the Air Force Office of Scientific Research Grant No. AFOSR-81-0058.     

Bounded pseudo-differential operators

This lecture gives an inside look into the proof of the continuity of pseudo-differential operators of orderm and typep, δ₁, δ₂ for 0≦p≦δ₁=1, 0≦p≦δ₂<1, andm/n≦p≦(δ₁+δ₂)/2. Applications are mentioned.     

Topology of Random 2-Complexes

We study the Linial–Meshulam model of random two-dimensional simplicial complexes. One of our main results states that for p≪n ⁻¹ a random 2-complex Y collapses simplicially to a graph and, in particular, the fundamental group π ₁(Y) is free and H ₂(Y)=0, asymptotically almost surely. Our other main result gives a precise threshold for collapsibility of a random 2-complex to a graph in a prescribed number of steps. We also prove that, if the probability parameter p satisfies p≫n ^−1/2+ϵ , where ϵ>0, then an arbitrary finite two-dimensional simplicial complex admits a topological embedding into a random 2-complex, with probability tending to one as n→∞. We also establish several related results; for example, we show that for p<c/n with c<3 the fundamental group of a random 2-complex contains a non-abelian free subgroup. Our method is based on exploiting explicit thresholds (established in the paper) for the existence of simplicial embeddings and immersions of 2-complexes into a random 2-complex.     

Perfect fractional matchings in random hypergraphs

Given an r-uniform hypergraph H = (V, E) on |V| = n vertices, a real-valued function f:E→R⁺ is called a perfect fractional matching if Σ_vϵe f(e) ≤ 1 for all vϵV and Σ_eϵE f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n→ infinity, at the very moment t₀ when the last isolated vertex disappears, the hypergraph H_t0 has a perfect fractional matching. This result is clearly best possible. As a consequence, we derive that if p(n) = (ln n + w(n))/ , where w(n) is any function tending to infinity with n, then with probability tending to 1 a random r-uniform hypergraph on n vertices with edge probability p has a perfect fractional matching. Similar results hold also for random r-partite hypergraphs. © 1996 John Wiley & Sons, Inc.     

An extension of a result of ribe

It is proved that for every 1≦p<∞, 1≦q<∞ and for every sequence {p _n}, 1≦p _n<∞,p _n→p, the spaceX=(Σ⊕l _{p n}) _q (resp.U=(Σ⊕L _{p n}(0, 1)) _q ) is uniformly homeomorphic toX⊕l _p (resp.U⊕L _p(0, 1)). This extends Ribe’s result from the casep=1 to generalp<∞ and thus provides examples of uniformly convex, uniformly homeomorphic Banach spaces which are not Lipschitz equivalent.     

Two-point concentration in random geometric graphs

A random geometric graph G _n is constructed by taking vertices X ₁,…,X _n ∈ℝ ^d at random (i.i.d. according to some probability distribution ν with a bounded density function) and including an edge between X _i and X _j if ‖X _i -X _j ‖ < r where r = r(n) > 0. We prove a conjecture of Penrose ([14]) stating that when r=r(n) is chosen such that nr ^d = o(lnn) then the probability distribution of the clique number ω(G _n ) becomes concentrated on two consecutive integers and we show that the same holds for a number of other graph parameters including the chromatic number χ(G _n ). The author was partially supported by EPSRC, the Department of Statistics, Bekkerla-Bastide fonds, Dr. Hendrik Muller’s Vaderlandsch fonds, and Prins Bernhard Cultuurfonds.     

Universal PI-algebras and algebras of generic matrices

Let Ω[ξ] denote the polynomial algebra (with 1) in commutative indeterminates {ie65-1}, 1 ≦i, j ≦n, 1 ≦k < ∞, over a commutative ring Ω. Thealgebra of generic matrices Ω [Y] is defined to be the Ω-subalgebra ofM _n (Ω[ξ]) generated by the matricesY _k=({ie65-2}), 1 ≦i, j ≦n, 1 ≦k < ∞. This algebra has been studied extensively by Amitsur and by Procesi in particular Amitsur has used it to construct a finite dimensional, central division algebra Ω (Y) which is not a crossed product. In this paper we shall prove, for Ω a domain, that Ω(Y) has exponentn in the Brauer group (Amitsur may already know this fact); consequently, for Ω an infinite field andn a multiple of 4, iff(X ₁, …,X _m) is a polynomial linear in all theX _i but one (similar to Formanek’s central polynomials for matrix rings) andf ² is central forM _n (Ω), thenf is central forM _n (Ω). (The existence of a polynomial not central forM _n (Ω), but whose square is central forM _n(Ω) is equivalent to every central division algebra of degreen containing a quadratic extension of its center; well-known theory immediately shows this is the case of 4‖n and 8χn.) Also, information is obtained about Ω(Y) for arbitary Ω, most notably that the Jacobson radical is the set of nilpotent elements. Partial support for this work was provided by National Science Foundation grant NSF-GP 33591.     

An ergodic theorem on Banach lattices

E is a Banach lattice that is weakly sequentially complete and has a weak unitu. TLf _n=ϕ means that the infimum of |f _n−ϕ| andu converges strongly to zero.T is a positive contraction operator onE andA _n=(1/n)(I+T+...+T ⁿ⁻¹). Without an additional assumption onE, the “truncated limit” TLA _nf need not exist forf inE. This limit exists for eachf ifE satisfies the following additional assumption (C): For everyf inE ₊ and for every numberα>0, there is a numberβ=β(f, α) such that ifg is inE ₊, ‖g‖≦1, 0≦f′≦f and ‖f′‖>α then ‖f′+g‖≧‖g‖+β. Research of this author is partially supported by NSERC Grant A3974. Research of this author is partially supported by NSF Grant 8301619.     

On a problem of spencer

LetX ₁, ...,X _n be events in a probability space. Let ϱ_i be the probabilityX _i occurs. Let ϱ be the probability that none of theX _i occur. LetG be a graph on [n] so that for 1 ≦i≦n X _i is independent of ≈X _j ‖(i, j)∉G≈. Letf(d) be the sup of thosex such that if ϱ₁, ..., ϱ _n ≦x andG has maximum degree ≦d then ϱ>0. We showf(1)=1/2,f(d)=(d−1) ^d−1 d ^−d ford≧2. Hence df(d)=1/e. This answers a question posed by Spencer in [2]. We also find a sharp bound for ϱ in terms of the ϱ _i andG.     

Classification of finite groups according to the number of conjugacy classes II

In the following,G denotes a finite group,r(G) the number of conjugacy classes ofG, β(G) the number of minimal normal subgroups ofG andα(G) the number of conjugate classes ofG not contained in the socleS(G). Let Φ _j = {G|β(G) =r(G) −j}. In this paper, the family Φ₁₁ is classified. In addition, from a simple inspection of the groups withr(G) =b conjugate classes that appear in ϒ _j ^=1/11 Φ _j , we obtain all finite groups satisfying one of the following conditions: (1)r(G) = 12; (2)r(G) = 13 andβ(G) > 1; …; (9)r(G) = 20 andβ(G) > 8; (10)r(G) =n andβ(G) =n −a with 1 ≦a ≦ 11, for each integern ≧ 21. Also, we obtain all finite groupsG with 13 ≦r(G) ≦ 20,β(G) ≦r(G) − 12, and satisfying one of the following conditions: (i) 0 ≦α(G) ≦ 4; (ii) 5 ≦α(G) ≦ 10 andS(G) solvable.     

Symmetric block bases of sequences with large average growth

We show that if 0<ε≦1, 1≦p<2 andx ₁, …,x _n is a sequence of unit vectors in a normed spaceX such thatE ‖∑ _l ⁿ ε_i x _l‖≧n ^1/p, then one can find a block basisy ₁, …,y _m ofx ₁, …,x _n which is (1+ε)-symmetric and has cardinality at leastγn ^2/p-1(logn)⁻¹, where γ depends on ε only. Two examples are given which show that this bound is close to being best possible. The first is a sequencex ₁, …,x _n satisfying the above conditions with no 2-symmetric block basis of cardinality exceeding 2n ^2/p-1. This sequence is not linearly independent. The second example is a sequence which satisfies a lowerp-estimate but which has no 2-symmetric block basis of cardinality exceedingCn ^2/p-1(logn)^4/3, whereC is an absolute constant. This applies when 1≦p≦3/2. Finally, we obtain improvements of the lower bound when the spaceX containing the sequence satisfies certain type-condition. These results extend results of Amir and Milman in [1] and [2]. We include an appendix giving a simple counterexample to a question about norm-attaining operators.     

Automorphisms of random graphs with specified vertices

Conditions are found under which the expected number of automorphisms of a large random labelled graph with a given degree sequence is close to 1. These conditions involve the probability that such a graph has a given subgraph. One implication is that the probability that a random unlabelledk-regular simple graph onn vertices has only the trivial group of automorphisms is asymptotic to 1 asn → ∞ with 3≦k=O(n ^1/2−c). In combination with previously known results, this produces an asymptotic formula for the number of unlabelledk-regular simple graphs onn vertices, as well as various asymptotic results on the probable connectivity and girth of such graphs. Corresponding results for graphs with more arbitrary degree sequences are obtained. The main results apply equally well to graphs in which multiple edges and loops are permitted, and also to bicoloured graphs. Research of the second author supported by U. S. National Science Foundation Grant MCS-8101555, and by the Australian Department of Science and Technology under the Queen Elizabeth II Fellowships Scheme. Current address: Mathematics Department, University of Auckland, Auckland, New Zealand.     

N-widths of Ω r ′ in L p

Let Ω _ϕ ^r ={f:f ^(r-1) abs. cont. on [0,1], ‖q_r(D)f‖_p≤1, f^(2K+σ) (0)=f^(2K+σ)=0, (k)=0,...,l-1}. where , and I is an identical operator. Denote Kolmogorov, linear, Geelfand and Bernstein n-widths of Ω _ϕ ^r in L^p byd _n (Ω _ϕ ^r ;L ^p ),δ _n (Ω _ϕ ^r ;L ^p ),d ⁿ (Ω _p ^r ;L ^p ) andb _n (Ω _p ^r ;L ^p ), respectively. In this paper, we find a method to get an exact estimation of these n-widths. Related optimal subspaces and an optimal linear operator are given. For another subset , similar results are also derrived.     

Some geometrical properties of Banach spaces of polynomials

We investigate the asymmetry, gl constants and best factorization estimates of then-dimensional spaces of polynomialsH _p ⁿ =span{e ^ikx;k=1,2,…,n} equipped with theL _p norm for 1≦p≦∞. Supported in part by NSF grant # MCS-8109561.     

Factorization for non-nevanlinna classes of analytic functions

A generalization of the Blaschke product is constructed. This product enables one to factor out the zeros of the members of certain non-Nevanlinna classes of functions analytic in the unit disc, so that the remaining (non-vanishing) functions still belong to the same class. This is done for the classesA ⁻ⁿ (0<n<∞) andB ⁻ⁿ (0<n<2) defined as follows:f ∈A ⁻ⁿ iff |f(z)|≦C _f (1−|z|)⁻ⁿ ,f ∈B ⁻ⁿ iff |f(z)|≦exp {C _f (1−|z|)⁻ⁿ }, whereC _f depends onf.     

A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r)

Let f(n) be a multiplicative function such that there exists a prime p ₀ at which f does not vanish. In this paper, we prove that if f satisfies the equation f(p+q+r)=f(p)+f(q)+f(r) for all primes p, q and r, then f(n)=n for all integers n≥1.     

On a characterization of the exponential distribution by spacings

Summary LetX be a non-negative random variable with probability distribution functionF. SupposeX _i,n (i=1,…,n) is theith smallest order statistics in a random sample of sizen fromF. A necessary and sufficient condition forF to be exponential is given which involves the identical distribution of the random variables (n−i)(X _i+1,n−X_i,n) and (n−j)(X _j+1,n−X_j,n) for somei, j andn, (1≦i<j<n). The work was partly completed when the author was at the Dept. of Statistics, University of Brasilia, Brazil.