Canonical contact forms on spherical CR manifolds

We construct the CR invariant canonical contact form can(J) on scalar positive spherical CR manifold (M,J), which is the CR analogue of canonical metric on locally conformally flat manifold constructed by Habermann and Jost. We also construct another canonical contact form on the Kleinian manifold ()/, where is a convex cocompact subgroup of Aut_CRS²ⁿ⁺¹=PU(n+1,1) and () is the discontinuity domain of . This contact form can be used to prove that ()/ is scalar positive (respectively, scalar negative, or scalar vanishing) if and only if the critical exponent ()<n (respectively, ()>n, or ()=n). This generalizes Nayatanis result for convex cocompact subgroups of SO(n+1,1). We also discuss the connected sum of spherical CR manifolds.     

On upper bounds of Fourier-Walsh coefficients

An upper bound is established for the upper bounds of the Fourier-Walsh coefficients a_n(f) whose modulus of continuity (,f) does not exceed a given modulus of continuity (). In the case of convex majorants of (), these bounds are attained for individual ordinal numbers n.Translated from Matematicheskie Zametki, Vol. 6, No. 6, pp. 725–736, December, 1969.     

Weak solutions of the Stokes problem in weighted Sobolev spaces

For n2 we consider the Stokes problem in ⁿ, -u + p=f, -divu=g, in weighted Soboiev spaces H ₆ ^m,r , where the weights are proportional to (1+|x|). We prove the existence of weak solutions for any K, whereK is a discrete set of critical values. Furthermore, we characterize the solutions of the homogeneous problem.This research was supported by the DFG research group Equations of Hydrodynamics, Universities of Bayreuth and Paderborn.     

On Piecewise-Constant Approximation of Continuous Functions of n Variables in Integral Metrics

We consider the approximation by piecewise-constant functions for classes of functions of many variables defined by moduli of continuity of the form (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ), where _i ( _i ) are ordinary moduli of continuity that depend on one variable. In the case where _i ( _i ) are convex upward, we obtain exact error estimates in the following cases: (i) in the integral metric L ₂ for (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ); (ii) in the integral metric L _p (p 1) for (₁, ..., _n ) = c ₁₁ + ... + c _{n n} ; (iii) in the integral metric L _{(2, ..., 2, 2r)} (r = 2, 3, ...) for (₁, ..., _n ) = ₁(₁) + ... + _{n – 1}( _{n – 1}) + c _{n n} .     

Estimates of Entire Functions of Exponential Type Less than π in Terms of Logarithmic Sums over Real Duffin and Schaeffer Sequences

We give uniform estimates of entire functions of exponential type less than having sufficiently small logarithmic sums over real sequences { _n } satisfying | _n –n|L and _n+1– _n for fixed positive constants L and . We thereby generalize results about logarithmic sums over the set of integers and so-called relatively h-dense sequences.     

A characterization of the generalized twisted field planes of characteristic ≥5

Let be a non-Desarguesian semifield plane of orderp ⁿ, p a prime number 5 andn3, and let denote the group induced by the autotopism groupG of on the line at infinity. We prove that is a generalized twisted field plane if, and only if, has an element of order (p ^k–1)((p ⁿ–1)/(p ^m–1)), for some integersk andm, wherek | m, m | n, andm.This work was supported in part by NSF grants RII-9014056, component IV of the EPSCoR of Puerto Rico grant and ARO grant for Cornell MSI     

The concentration of the chromatic number of random graphs

We prove that for every constant >0 the chromatic number of the random graphG(n, p) withp=n ^–1/2– is asymptotically almost surely concentrated in two consecutive values. This implies that for any <1/2 and any integer valued functionr(n)O(n ) there exists a functionp(n) such that the chromatic number ofG(n,p(n)) is preciselyr(n) asymptotically almost surely.Research supported in part by a USA Israeli BSF grant and by a grant from the Israel Science Foundation.Research supported in part by a Charles Clore Fellowship.     

On a Particular Class of Minihypers and Its Applications. I. The Result for General q

This article is the first in a series of three articles that discuss a particular class of minihypers and its applications. Proving that for small and < N, a {v _{+ 1}, v ; N, q}-minihyper consists of a sum of -spaces, we show that the excess points of an s-cover with excess of PG(N, q), (s + 1)|(N + 1), form a sum of s-spaces, and that no maximal partial s-spreads with deficiency of PG(N, q), (s + 1)|(N + 1), exist. The case q square will be studied in greater detail in [7] and further applications of these classification results on this class of minihypers will be published in [8].     

Voronoi Diagrams of Real Algebraic Sets

A collection of n (possibly singular) semi-algebraic sets in ^d of dimension d–1, each defined by polynomials of maximal degree , has ((n) ^d ) first-order Voronoi cells (for any fixed d). In the nonhypersurface case, where the maximal dimension of the semi-algebraic sets is m d–2, the number of first-order Voronoi cells is bounded above by O(n ^{m+1 d} ) (for nonsingular semi-algebraic sets) or by O((n) ^d ) (in general). The complexity of the entire kth-order Voronoi diagram of a generic collection of n non-singular real algebraic sets in R ^d of maximal dimension m<d and maximal degree is O(n ^{min(d+k,2d)2(m+1)d} ).     

Interval-dividing processes

Summary If and then P(n ^–1·[(Y ₁)++(Y _n )] converges to cnts. law on R ¹) = P(n ^–1·[(Y ₁)++(Y _n )] converges to a cnts. law on R ¹). Thus if ,n then n ^–1[(X ₁)+...+(X _n )] converges a.s. The main result here generalizes this: Let X ₍₁₎ ⁿ , X ₍₂₎ ⁿ ,..., X _(n) ⁿ be the order statistics associated with X ₁, X ₂,,X _n. Define random variables Z ₁,Z ₂, by {Z _n =i}={X _n =X _(i) ⁿ }. Then if Z ₁,Z ₂,Z ₃, are independent and P(Z_ni)i/n, and {X _i} is bounded, n ^–1·[(X ₁)++(X _n)] converges a.s.     

Head of the line processor sharing for many symmetric queues with finite capacity

In this paper the steady-state behavior of many symmetric queues, under the head of the line processor-sharing discipline, is investigated. The arrival process to each of n queues is Poisson, with rateA, and each queue hasr waiting spaces. A job arriving at a full queue is lost. The queues are served by a single exponential server, which has a mean raten, and splits its capacity equally amongst the jobs at the head of each nonempty queue. The normal traffic casep=/< 1 is considered, and it is assumed thatn1 andr= 0(1). A 2-term asymptotic approximation to the loss probabilityL is derived, and it is found thatL = 0(n ^–r ), for fixedp. If6=(1–p)/p 1, then the approximation is valid if n² 1 and (r+ 1)²n, and in this caseL r!/(n)^r. Numerical values ofL are obtained forr = 1,2,3,4 and 5,n = 1000,500 and 200, and various values ofp< 1. Very small loss probabilities may be obtained with appropriate values of these parameters.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

Improvement of Bruck's completion theorem

Improving Bruck's Completion-Theorem for nets, we show that a net of order k and degree k + 1 – can be extended to an affine plane, if 3k > 8³ – 18² + 8 + 4. As applications we obtain the following two theorems: A maximal partial t-spread in PG(2t + 1, q), q not a square, with deficiency > 0 satisfies 8³ – 18² + 8 + 4 3q ². There exists an absolute constant c such that every linear space with constant point degree n + 1 and minimum line degree n + 1 – a can be embedded in a protective plane of order n provided that n > ca ³.     

On a problem of Erdős and Lovász: Random lines in a projective plane

Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let _k denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from _k then P_r(H<)0(k).Corollary If there exists a _k thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008     

Nielsen Methods and Groups Acting on Hyperbolic Spaces

We show that for any n & in there exists a constant C(n) such that any n-generated group G which acts by isometries on a -hyperbolic space (with >0) is either free or has a nontrivial element with translation length at most C(n).     

Remarks on ergodicity of stationary irreducible transient Markov chains

Summary Consider a stationary process {X _n(), – < n < . If the measure of the process is finite (the measure of the whole sample space finite), it is well known that ergodicity of the process {X _n(), - < n < and of each of the subprocesses {X _n(), 0 n < , {X _n(), – < n 0 are equivalent (see [3]). We shall show that this is generally not true for stationary processes with a sigma-finite measure, specifically for stationary irreducible transient Markov chains. An example of a stationary irreducible transient Markov chain {X _n(), - < n <} with {itX_n(), 0 n < < ergodic but {X _n(), < n 0 nonergodic is given. That this can be the case has already been implicitly indicated in the literature [4]. Another example of a stationary irreducible transient Markov chain with both {X _n(), 0 n < and {itX _n(),-< < n 0} ergodic but {X _n(), - < n < nonergodic is presented. In fact, it is shown that all stationary irreducible transient Markov chains {X _n(), - < n < < are nonergodic.This research was supported in part by the Office of Naval Research.John Simon Guggenheim Memorial Fellow.     

The cover-index of infinite graphs

We show that the cover-index of an infinite graph can be expressed in terms of colouring properties of its finite subgraphs when the minimum degree of the graph is finite. We prove that every simple graph with infinite minimum degree contains a tree which is regular of degree and use this to prove that every graph with minimum degree can be decomposed into mutually edge-disjoint spanning subgraphs without ioslated vertices. In particular, the cover-index of a graph equals the minimum degree, when this is infinite.     

Quasi-coherence of Hardy spaces in several complex variables

In this paper, we prove that the Hardy spaceH ^p (), 1p<, over a strictly pseudoconvex domain in ⁿ with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH ^p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.     

Product integration for the linear transport equation in slab geometry

Summary In this paper we present a product quadrature rule for the discretization of the well-known linear transport equation in slab geometry. In particular we give an algorithm for constructing the weights of the rule and prove that the order of convergence isO(n ^–3+ ), >0 small as we like. Numerical examples are given, and our formula is also compared with product Simpson rules. Finally, we examine a Nyström method based on our quadrature.Work sponsored by the Ministero della Pubblica Instruzione of Italy     

On a problem of H. N. Gupta

It is shown that the axiom For any points x, y, z such that y is between x and z, there is a right triangle having x and z as endpoints of the hypotenuse and y as foot of the altitude to the hypotenuse, when added to three-dimensional Euclidean geometry over arbitrary ordered fields, is weaker than the axiom Every line which passes through the interior of a sphere intersects that sphere.