Circularity of Finite Groups without Fixed Points

Let be a fixed point free group given by the presentation 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.     

Asymptotics of polynomials orthogonal with respect to varying measures

Letd be a finite positive Borel measure on the interval [0, 2] such that >0 almost everywhere; andW _n be a sequence of polynomials, degW _n =n, whose zeros (w _n ,1,,w _n,n lie in [|z|1]. Let d _n <> for each_nN, whered _n =d/|W _n (e ⁱ )|². We consider the table of polynomials _n,m such that for each fixednN the system _n,m,mN, is orthonormal with respect tod _n . If

The GHS inequality and the Riemann hypothesis

LetV(t) be the even function on (–, ) which is related to the Riemann xi-function by (x/2)=4 _– exp(ixt–V(t))dt. In a proof of certain moment inequalities which are necessary for the validity of the Riemann Hypothesis, it was previously shown thatV'(t)/t is increasing on (0, ). We prove a stronger property which is related to the GHS inequality of statistical mechanics, namely thatV' is convex on [0, ). The possible relevance of the convexity ofV' to the Riemann Hypothesis is discussed.Communicated by Richard Varga.     

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)

Spectral synthesis for Euler type operators

A=(a _ij) _i ^j=1 — k-o ,a _ij . :

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 ₀,     

On the computation of modules of long quadrilaterals

We study quadrilateralsQ which are given by two intervals on {:Im = 0} and {:Im = 1}, and two Jordan arcs ₁, ₂, in {:0 Im 1} connecting these two intervals. Many practical problems require the determination of the modulem(Q) ofQ, but ifQ is long, i.e., if

Blocks of orthogonal random variables and the strong law of large numbers

(X _k ),k=1,2,... — _k ² >1; (X _k ) , E(X _k X _t )=0 p k<>(p+1) (p,k,l=1, 2, ...) , , ,

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:

The Number of Linearly Independent Binary Vectors with Applications to the Construction of Hypercubes and Orthogonal Arrays, Pseudo ( t, m, s)-Nets and Linear Codes

We study formulae to count the number of binary vectors of length n that are linearly independent k at a time where n and k are given positive integers with 1kn. Applications are given to the design of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes.     

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.     

Lehmer pairs of zeros,the de Bruijn-Newman constant Λ, and the Riemann Hypothesis

We give here a rigorous formulation for a pair of consecutive simple positive zeros of the functionH ₀ (which is closely related to the Riemann -function) to be a Lehmer pair of zeros ofH ₀. With this formulation, we establish that each such pair of zeros gives a lower bound for the de Bruijn-Newman constant (where the Riemann Hypothesis is equivalent to the assertion that 0). We also numerically obtain the following new lower bound for :

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.     

Sharpening of Stečkin's theorem to strong approximation

. . , , : f — ,

Characterizations of logA≥logB and normaloid operators via Heinz inequality

In 1951, Heinz showed the following useful norm inequality:If A, B0and XB(H), then AXB ^r X^1–r A ^r XB ^r holds for r [0, 1]. In this paper, we shall show the following two applications of this inequality:Firstly, by using Furuta inequality, we shall show an extension of Cordes inequality. And we shall show a characterization of chaotic order (i.e., logAlogB) by a norm inequality.Secondly, we shall study the condition under which , where is Aluthge transformation ofT. Moreover we shall show a characterization of normaloid operators (i.e.,r(T)=T) via Aluthge transformation.     

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

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 very weak entire solutions of nonlinear partial differential equations

Let us consider the variational equation in R ⁿ