Subadditive functions on modules and subgroups of abelian groups

Thepositive half A ₊ of an ordered abelian groupA is the set {x Ax 0} andM A ₊ is amodule if for allx, y M alsox + y, |x – y| M. If A ₊ \M thenM() is the module generated byM and. S M isunbounded inM if(x M)(y S)(x y) and isdense inM if (x₁, x₂ M)(y S) (x₁ <>₂ x₁ y x₂). IfM is a module, or a subgroup of any abelian group, a real-valuedg: M R issubadditive ifg(x + y) g(x) + g(y) for allx, y M. The following hold:

A new proof of the Komlós-Révész-theorem

The Komlós-Révész theorem states: For r.v.s.X _n with X _{n 1}M there exists a subsequenceX _{k n} and a r.v.X with X₁M such that

Maximal polynomial subordination to univalent functions in the unit disk

Let C be a simply connected domain, 0, and let _n,nN, be the set of all polynomials of degree at mostn. By _n() we denote the subset of polynomials p _n withp(0)=0 andp(D), whereD stands for the unit disk {z: |z|<1}, and=" by=">we denote the maximal range of these polynomials. Letf be a conformal mapping fromD onto ,f(0)=0. The main theme of this note is to relate _n (or some important aspects of it) to the imagesf _s (D), wheref _s (z):=f[(1–s)z], 0s<1. for=" instance=" we=" prove=" the=" existence=" of=" a=" universal=">c ₀ such that, forn2c ₀,     

Bruck nets,codes, and characters of loops

Numerous computational examples suggest that if _{k-1 k} are (k- 1)- and k-nets of order n, then rank _{p k} - rank _{p k-1} n - k + 1 for any prime p dividing n at most once. We conjecture that this inequality always holds. Using characters of loops, we verify the conjecture in case k = 3, proving in fact that if p ^e n, then rank _{p 3} 3n - 2 - e, where equality holds if and only if the loop G coordinatizing ₃ has a normal subloop K such that G/K is an elementary abelian group of order p ^e . Furthermore if n is squarefree, then rank _p = 3n - 3 for every prime p ¦ n, if and only if ₃ is cyclic (i.e., ₃ is coordinated by a cyclic group of order n).The validity of our conjectured lower bound would imply that any projective plane of squarefree order, or of order n 2 mod 4, is in fact desarguesian of prime order.     

Survival time of a random graph

LetV _n ={1, 2, ...,n} ande ₁,e ₂, ...,e _N ,N= be a random permutation ofV _n ⁽²⁾. LetE _t={e ₁,e ₂, ...,e _t} andG _t=(V _n ,E _t ). If is a monotone graph property then the hitting time() for is defined by=()=min {t:G _t }. Suppose now thatG starts to deteriorate i.e. loses edges in order ofage, e ₁,e ₂, .... We introduce the idea of thesurvival time =() defined by t = max {u:(V _n, {e _u,e _u+1, ...,e _T }) }. We study in particular the case where isk-connectivity. We show that

Convex polynomial and spline approximation in C[−1, 1]

We prove that a convex functionf C[–1, 1] can be approximated by convex polynomialsp _n of degreen at the rate of ₃(f, 1/n). We show this by proving that the error in approximatingf by C² convex cubic splines withn knots is bounded by ₃(f, 1/n) and that such a spline approximant has anL third derivative which is bounded by n³₃(f, 1/n). Also we prove that iff C²[–1, 1], then it is approximable at the rate ofn ^–2 (f, 1/n) and the two estimates yield the desired result.Communicated by Ronald A. DeVore.     

On the lower Markov spectrum

C. Hightower found two infinite sequences of gaps in the Markov spectrum, ( _n , _n ) and ( _n , _n ) with _n and _n both Markov elements, converging to . This paper exhibits Markov elements _n ^* and _n ^* such that, for alln 1, ( _n ^* , _n ) and ( _{n n} ^* ) are gaps in the Markov spectrum. Other results include showing that, for alln 1, _n is completely isolated, while the other endpoints of the gaps are limit points in the Markov spectrum.     

A test of convergence of Fourier series with respect to multiplicative systems,analogous to the Jordan test

, {p _n} _n=0 (p₀=1, _n2 n2). : x f(t) V(G)

Circularity of Finite Groups without Fixed Points

Let áA, B | A^m=1, Bⁿ=A^t, BAB^-1=A^r?\langle A, B\,\vert\, A^\mu=1,\, B^\nu=A^t,\, BAB^{-1}=A^\rho\rangle where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.     

Rational approximation to Lipschitz and Zygmund classes

In this paper, characterizations for lim _n(R _n (f)/(n ^–1)=0 inH and for lim _n(n ^r+ R _n (f)=0 inW ^r Lip ,r1, are given, while, forZ, a generalization to a related result of Newman is established.Communicated by Ronald A. DeVore.     

On the metric theory of the nearest integer continued fraction expansion

Supposek _n denotes either (n) or (p _n) (n=1,2,...) where the polynomial maps the natural numbers to themselves andp _k denotes thek ^th rationals prime. Also let denote the sequence of convergents to a real numberx and letc _n(x)) _n=1 be the corresponding sequence of partial quotients for the nearest integer continued fraction expansion. Define the sequence of approximation constants _n(x)) _n=1 by

Christoffel functions,orthogonal polynomials,and Nevai's conjecture for Freud weights

We obtain upper and lower bounds for Christoffel functions for Freud weights by relatively new methods, including a new way to estimate discretization of potentials. We then deduce bounds for orthogonal polynomials on thereby largely resolving a 1976 conjecture of P. Nevai. For example, let W:=e ^–Q, whereQ: is even and continuous in, Q^" is continuous in (0, ) andQ ^'>0 in (0, ), while, for someA, B,

On vector-valued random Fourier series

Consider a (complex) Banach spaceX, such thatX C_O, and vectors(X _i ) _i ofX. Consider an independent standard normal sequence(g _i ) _i . Then if anX-valued random Fourier series _{|k| n} e ^ikt g _k x _k satisfies

Subcoercivity and subelliptic operators on Lie groups II: The general case

Let (,G, U) be a continuous representation of a Lie groupG by bounded operatorsg U (g) on the Banach space and let (, ,dU) denote the representation of the Lie algebra obtained by differentiation. Ifa ₁, ...,a _d is a Lie algebra basis of ,A _i =dU (a _i ) and whenever =(i ₁, ...,i _k ) we reconsider the operators

On maximal ranges of polynomial spaces in the unit disk

Let be a domain in C, 0, and let _n ⁰ () be the set of polynomials of degreen such thatP(0)=0 andP(D), whereD denotes the unit disk. The maximal range _n is then defined to be the union of all setsP(D),P _n ⁰ (). We derive necessary and, in the case of ft convex, sufficient conditions for extremal polynomials, namely those boundaries whose ranges meet _n . As an application we solve explicitly the cases where is a half-plane or a strip-domain. This also implies a number of new inequalities, for instance, for polynomials with positive real part inD. All essential extremal polynomials found so far in the convex cases are univalent inD. This leads to the formulation of a problem. It should be mentioned that the general theory developed in this paper also works for other than polynomial spaces.Communicated by J. Milne Anderson.     

Interpolation by Lagrange polynomials,B-splines and bounds of errors

m N k=m–2,m–1

Realizations of regular polytopes

Let be a finite regular incidence-polytope. A realization of is given by an imageV of its vertices under a mapping into some euclidean space, which is such that every element of the automorphism group () of induces an isometry ofV. It is shown in this paper that the family of all possible realizations (up to congruence) of forms, in a natural way, a closed convex cone, which is also denoted by The dimensionr of is the number of equivalence classes under () of diagonals of , and is also the number of unions of double cosets ^{** *–1*} ( ^*), where ^* is the subgroup of () which fixes some given vertex of . The fine structure of corresponds to the irreducible orthogonal representations of (). IfG is such a representation, let its degree bed _G , and let the subgroup ofG corresponding to ^* have a fixed space of dimensionw _G . Then the relations

Fourier series of functions whose Hankel transform is supported on [0, 1]

LetJ denote the Bessel function of order . For >–1, the system x^–/2–1/2J_+2n+1(x^1/2, n=0, 1, 2,..., is orthogonal onL ²((0, ),x dx). In this paper we study the mean convergence of Fourier series with respect to this system for functions whose Hankel transform is supported on [0, 1].Communicated by Mourad Ismail.     

On multivariate polynomial interpolation

We provide a map which associates each finite set in complexs-space with a polynomial space from which interpolation to arbitrary data given at the points in is possible and uniquely so. Among all polynomial spacesQ from which interpolation at is uniquely possible, our is of smallest degree. It is alsoD- and scale-invariant. Our map is monotone, thus providing a Newton form for the resulting interpolant. Our map is also continuous within reason, allowing us to interpret certain cases of coalescence as Hermite interpolation. In fact, our map can be extended to the case where, with eachgq, there is associated a polynomial space P, and, for given smoothf, a polynomialqQ is sought for which