Pointwise hereditary majorization and some applications

A pointwise version of the Howard-Bezem notion of hereditary majorization is introduced which has various advantages, and its relation to the usual notion of majorization is discussed. This pointwise majorization of primitive recursive functionals (in the sense of Gödel'sT as well as Kleene/Feferman's) is applied to systems of intuitionistic and classical arithmetic (H andH ^c) in all finite types with full induction as well as to the corresponding systems with restricted induction and^c.

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 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.     

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.     

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

ИНтЕгРАльНыЕ пРЕДст АВлЕНИь В тРУБЧАтых ОБлАстьх НАД пОлИЁДРАМИ И ВОпРОсы пРИБлИжЕНИ ь ФУНкцИИ

Let B ⁿ be a domain and (y), y B and arbitrary positive, continuous function. If p, s (0, +), denote byH _s, ^p (T _B ) the class of the functionsf(z)f(x+iy), holomorphic in the tube domain

An extension of the Erdős-Stone theorem

LetK _p(u₁, ..., u_p) be the completep-partite graph whoseith vertex class hasu _i vertices (lip). We show that the theorem of Erds and Stone can be extended as follows. There is an absolute constant >0 such that, for allr1, 0<1 and=">1/r, every graphG=G ⁿ of sufficiently large order |G|=n with at least

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

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.     

Global properties of solutions to 1D-viscous compressible barotropic fluid equations with density dependent viscosity

The Navier-Stokes equations for compressible barotropic fluid in 1D with the mass force under zero velocity boundary conditions are studied. We prove the uniform upper and lower bounds for the density as well as the uniform in time L ²()-estimates for _x and u _x (u is the velocity). Moreover, a collection of the decay rate estimates for - (with being the stationary density) and u in ²()-norm and H ¹()-norm as time t are established. The results are given for general state function p() (but mainly monotone) and viscosity coefficient µ() of arbitrarily fast (or slow) growth as well as for the large data.     

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.     

Null-Controllability of Discrete-Time Systems with Restrained Controls in Asplund Spaces

This paper is concerned with the null-controllability of the infinite-dimensional discrete-time linear system described by

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 existence of strongly normal ideals overP κ λ

For every uncountable regular cardinal and any cardinal,P denotes the set . Furthermore, < denotes=" the=" binary=" operation=" defined=">P byx<> iffxy¦x<>.By anideal over P we mean a proper, non-principal,-complete ideal overP extending the ideal dual to the filter generated by . For any idealI overP ,I ⁺ denotes the setP –I, andI ^* the filter dual toI.     

On very weak entire solutions of nonlinear partial differential equations

Let us consider the variational equation in R ⁿ