Almost-all results on the p λ problem. II

Summary Suppose that 1/2 ≦ λ < 1. Balog and Harman proved that for any real θ there exist infinitely many primes p satisfying p^λ-θ < p^{-(1-λ)/2+ ε} (with an asymptotic result). In the present paper we establish that for almost all θ in the interval 0 ≦ θ < 1 there exist infinitely many primes p such that {p^λ-θ} < p^{-min{(2-λ)/6,(14-9λ)/32}+ε}. Thus we obtain a better result for almost all θ than for a single θ if λ>1/2.     

Small fractional parts of additive forms

Letf(x)=θ₁ x ₁ ^k +...+θ _s x _s ^k be an additive form with real coefficients, and ∥α∥ = min {|α-u|:uεℤ} denote the distance fromα to the nearest integer. We show that ifθ ₁,…,θ _s , are algebraic ands = 4k then there are integersx ₁,…,x _s , satisfying l ≤x ₁,≤ N and ∥f(x)∥ ≤ N ^E , withE = − 1 + 2/e. Whens = λk, 1 ≤λ ≤ 2k, the exponentE may be replaced byλE/4, and if we drop the condition thatθ ₁,…,θ _s , be algebraic then the result holds for almost all values of θεℝ ^s . Whenk ≥ 6 is small a better exponent is obtained using Heath-Brown’s version of Weyl’s estimate.     

On semigroups generated by restrictions of elliptic operators to invariant subspaces

Let A be the closed unbounded operator inL _p(G) that is associated with an elliptic boundary value problem for a bounded domainG. We prove the existence of a spectral projectionE determined by the set Γ = {λ;θ ₁≦argλ≦θ ₂} and show thatAE is the infinitesimal generator of an analytic semigroup provided that the following conditions hold: 1<p<∞; the boundary ϖΓ of Γ is contained in the resolvent setp(A) ofA;π/2≦θ<θ ₂≦3π/2 ; and there exists a constantc such that (I)││(λ-A)^-1││≦c/│λ│ for λ∈ϖΓ. The following consequence is obtained: Suppose that there exist constantsM andc such that λ∈p(A) and estimate (I) holds provided that |λ|≧M and Re λ=0. Then there exist bounded projectionE ⁻ andE ⁺ such thatA is completely reduced by the direct sum decompositionL _p(G)=E⁻L_p (G) ⊕E⁺L_p (G) and each of the operatorsAE ⁻ and—AE ⁺ is the infinitestimal generator of an analytic semigroup.     

Scheduling strategies and long-range dependence

Consider a single server queue with unit service rate fed by an arrival process of the following form: sessions arrive at the times of a Poisson process of rate λ, with each session lasting for an independent integer time τ ⩾ 1, where P(τ = k) = p _k with p _k ~ αk ^−(1+α) L(k), where 1 < α < 2 and L(·) is a slowly varying function. Each session brings in work at unit rate while it is active. Thus the work brought in by each arrival is regularly varying, and, because 1 < α < 2, the arrival process of work is long-range dependent. Assume that the stability condition λE[τ] < 1 holds. By simple arguments we show that for any stationary nonpreemptive service policy at the queue, the stationary sojourn time of a typical session must stochastically dominate a regularly varying random variable having infinite mean; this is true even if the duration of a session is known at the time it arrives. On the other hand, we show that there exist causal stationary preemptive policies, which do not need knowledge of the session durations at the time of arrival, for which the stationary sojourn time of a typical session is stochastically dominated by a regularly varying random variable having finite mean. These results indicate that scheduling policies can have a significant influence on the extent to which long-range dependence in the arrivals influences the performance of communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

Block plan for a fractional 2 m factorial design derived from a 2 r factorial design

Summary For a given fractional 2 ^m factorial (2 ^m -FF) designT, the constitution of a block plan to divideT intok (2 ^r−1<k≦2 ^r ) blocks withr block factors each at two levels is proposed and investigated. The well-known three norms of the confounding matrix are used as measures for determining a “good” block plan. Some theorems concerning the constitution of a block plan are derived for a 2 ^m -FF design of odd or even resolution. Two norms which may be preferred over the other norm are slightly modified. For each value ofN assemblies with 11≦N≦26, optimum block plans fork=2 blocks with block sizes [N/2] andN−[N/2] minimizing the two norms are presented forA-optimal balanced 2⁴-FF designs of resolutionV given by Srivastava and Chopra (Technometrics,13, 257–269).     

Uniform Spacing of Zeros of Orthogonal Polynomials

It is shown that for doubling weights, the zeros of the associated orthogonal polynomials are uniformly spaced in the sense that if cos θ _m,k , θ _m,k ∈[0,π] are the zeros of the m-th orthogonal polynomial associated with w, then θ _m,k −θ _m,k+1∼1/m. It is also shown that for doubling weights, neighboring Cotes numbers are of the same order. Finally, it is proved that these two properties are actually equivalent to the doubling property of the weight function.     

A property of (v,k, λ)-designs

It is shown that if the subsetsX ₁,...,X _v of a setX form a (v, k, λ)-design, then there does not exist another subsetX _v+1 ofX havingany cardinalityk ₁ and intersecting each of theX _j, 1≦j≦v, inany number λ₁ of elements, where 0<k ₁<v and 0<λ₁<k (in order to avoid uninteresting cases).     

Inclusion-exclusion inequalities

Ifμ is a positive measure, andA ₂, ...,A _n are measurable sets, the sequencesS ₀, ...,S _n andP _[0], ...,P _[n] are related by the inclusion-exclusion equalities. Inequalities among theS _i are based on the obviousP _[k]≧0. Letting =the average average measure of the intersection ofk of the setsA _i , it is shown that (−1) ^k Δ ^k M _i ≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS ₀=1, whenS ₁≧N−1, and for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN, for all sequencesM ₀, ...,M _n of sufficiently large length if and only if for 0<t<1.     

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.     

Rearrangement invariant subspaces of Lorentz function spaces

The main result is that for 2≦q≦p<∞ the only subspaces of the Lorentz function spaceL _pq [0, 1] which are isomorphic to r.i. function spaces on [0, 1] are, up to equivalent renormings,L _pq [0, 1] andL ₂[0, 1].     

A sequential sampling rule for selecting the most probable multinomial event

Summary A sequential sampling rule is given for selecting the most probable event from a multinomial distribution withk cells. A random number of observations is taken from the given multinomial distribution at each stage of sampling, where the number is distributed according to a Poisson distribution with mean λ. The sampling is stopped when the count in any cell is greater than or equal to a given positive integerN. The cell with the highest count is selected for the most probable event. The mathematical analysis of the problem is simplified as a result of the statistical independence of the cell frequencies due to the randomization of the sample number. The expected value of the stage when the sampling terminates is decreasing in λ. The sequential sampling scheme in which one observation is taken at a time until the highest cell count is equal toN, corresponds to λ→0. A table is given showing some properties of the given selection procedure.     

Bounds and inequalities for single server loss systems

We consider a single server loss system in which arrivals occur according to a doubly stochastic Poisson process with a stationary ergodic intensity functionλ _t . The service times are independent, exponentially distributed r.v.'s with meanμ ⁻¹, and are independent of arrivals. We obtain monotonicity results for loss probabilities under time scaling as well as under amplitude scaling ofλ _t . Moreover, using these results we obtain both lower and upper bounds for the loss probability.     

The total reducibility order of a polynomial in two variables

LetK be an algebraically closed field of characteristic zero. ForA ∈K[x, y] let σ(A) = {λ ∈K:A − λ is reducible}. For λ ∈ σ(A) letA − λ = ∏ _i=1 ^n(λ) A _iλ ^k _μ whereA _iλ are distinct primes. Let ϱ_λ(A) =n(λ) − 1 and let ρ(A) = Σ_λɛσ(A)ϱ_λ(A). The main result is the following: Theorem.If A ∈ K[x, y] is not a composite polynomial, then ρ(A) < degA.     

On the variation of co-ordinates in subspaces

Summary Let1≦k≦n−1, 2≦n. This paper examines the vectors δ_p(L_k), where L_k is a k-dimensional subspace of an n-dimensional space, and the co-ordinates of δ_p(L_k) are given below by (1.1). For fixed k, the set of such vectors as L_k varies is determined for p=2. For general p, information is given on upper and lower bounds for the sum of the co-ordinates of δ_p(L_k). Dedicated to the sixtieth birthday of Prof. Edgar R. Lorch This research was supported in part by the Office of Naval Research under contract number Nonr 3775(09), NR 047040.     

On a Class of Generalized Lacunary Difference Sequence Spaces Defined by Orlicz Functions

In this article we introduce the generalized lacunary difference sequence spaces [N_θ,M,Δ~m]_0,[N_θ,M,Δ~m]_1 and [N_θ,M,Δ~m]_∞using m~(th)- difference.We study their properties like completeness,solidness,symmetricity.Also we obtain some inclusion relations involving the spaces [N_θ,M,Δ~m]_0,[N_θ,M,Δ~m]_1 and[N_θ,M,Δ~m]_∞and the Cesàro summable and strongly Cesàro summable sequences.     

On the evolution of islands

Letn cells be arranged in a ring, or alternatively, in a row. Initially, all cells are unmarked. Sequentially, one of the unmarked cells is chosen at random and marked until, aftern steps, each cell is marked. After thekth cell has been marked the configuration of marked cells defines some number of islands: maximal sets of adjacent marked cells. Let ξ _k denote the random number of islands afterk cells have been marked. We give explicit expressions for moments of products of ξ _k ’s and for moments of products of 1/ξ _k ’s. These are used in a companion paper to prove that if a random graph on the natural number is made by drawing an edge betweeni≧1 andj>i with probabilityλ/j, then the graph is almost surely connected ifλ>1/4 and almost surely disconnected ifλ≦1/4.     

Strongly almost convergent generalized difference sequences associated with multiplier sequences

Let Λ = (λ _k ) be a sequence of non-zero complex numbers. In this paper we introduce the strongly almost convergent generalized difference sequence spaces associated with multiplier sequences i.e. w ₀[A,Δ ^m ,Λ,p], w ₁[A,Λ ^m ,Λ,p], w _∞[A,Δ ^m ,Λ,p] and study their different properties. We also introduce Δ _Λ ^m -statistically convergent sequences and give some inclusion relations between w ₁[Δ ^m ,λ,p] convergence and Δ _Λ ^m -statistical convergence. Communicated by Pavel Kostyrko     

On a problem of klee concerning convex polytopes

A non-simpliciald-polytope is shown to have strictly fewerk-faces ([(d−1)/2]≦k≦d−1) then some simpliciald-polytope with the same number of vertices; actual numerical bounds are given. This provides a strong affirmative answer to a problem of Klee.     

Inverse problems for Sturm—Liouville operators with potentials in Sobolev spaces: Uniform stability

Two inverse problems for the Sturm-Liouville operator Ly = s-y″ + q(x)y on the interval [0, fy] are studied. For θ ⩾ 0, there is a mapping F:W ₂^θ → l _B ^θ, F(σ) = {s _k }₁^∞, related to the first of these problems, where W ₂^∞ = W ₂^∞[0, π] is the Sobolev space, σ = ∫ q is a primitive of the potential q, and l _B ^θ is a specially constructed finite-dimensional extension of the weighted space l ₂^θ, where we place the regularized spectral data s = {s _k }₁^∞ in the problem of reconstruction from two spectra. The main result is uniform lower and upper bounds for ∥σ - σ₁∥_θ via the l _B ^θ-norm ∥s − s₁∥_θ of the difference of regularized spectral data. A similar result is obtained for the second inverse problem, that is, the problem of reconstructing the potential from the spectral function of the operator L generated by the Dirichlet boundary conditions. The result is new even for the classical case q ∈ L ₂, which corresponds to θ = 1.