A Bohr Phenomenon For Elliptic Equations

In 1914 Bohr proved that there is an r (0,1) such that if apower series converges in the unit disk and its sum has modulusless than 1 then, for |z| < r, the sum of absolute valuesof its terms is again less than 1. Recently, analogous resultshave been obtained for functions of several variables. The aimof this paper is to place the theorem of Bohr in the contextof solutions to second-order elliptic equations satisfying themaximum principle. 2000 Mathematics Subject Classification: 35J15, 32A05, 46A35.     

Wavelet bases in

Some years ago, compactly supported divergence-free wavelets were constructed which also gave rise to a stable (biorthogonal) wavelet splitting of . These bases have successfully been used both in the analysis and numerical treatment of the Stokes and Navier-Stokes equations. In this paper, we construct stable wavelet bases for the stream function spaces . Moreover, -free vector wavelets are constructed and analysed. The relationship between and are expressed in terms of these wavelets. We obtain discrete (orthogonal) Hodge decompositions.

Our construction works independently of the space dimension, but in terms of general assumptions on the underlying wavelet systems in that are used as building blocks. We give concrete examples of such bases for tensor product and certain more general domains . As an application, we obtain wavelet multilevel preconditioners in and .

     

Gaussian extended cubature formulae for polyharmonic functions

The purpose of this paper is to show certain links between univariate interpolation by algebraic polynomials and the representation of polyharmonic functions. This allows us to construct cubature formulae for multivariate functions having highest order of precision with respect to the class of polyharmonic functions. We obtain a Gauss type cubature formula that uses values of linear functionals (integrals over hyperspheres) and is exact for all -harmonic functions, and consequently, for all algebraic polynomials of variables of degree .

     

Uniqueness and asymptotic behaviour for solutions of semilinear problems with boundary blow-up

In this paper we prove uniqueness of positive solutions to logistic singular problems , , 1$">, 0$"> in , where the main feature is the fact that . More importantly, we provide exact asymptotic estimates describing, in the form of a two-term expansion, the blow-up rate for the solutions near . This expansion involves both the distance function and the mean curvature of .

     

Serre's generalization of Nagao's theorem: An elementary approach

Let be a smooth projective curve over a field . For each closed point of let be the coordinate ring of the affine curve obtained by removing from . Serre has proved that is isomorphic to the fundamental group, , of a graph of groups , where is a tree with at most one non-terminal vertex. Moreover the subgroups of attached to the terminal vertices of are in one-one correspondence with the elements of , the ideal class group of . This extends an earlier result of Nagao for the simplest case .

Serre's proof is based on applying the theory of groups acting on trees to the quotient graph , where is the associated Bruhat-Tits building. To determine he makes extensive use of the theory of vector bundles (of rank 2) over . In this paper we determine using a more elementary approach which involves substantially less algebraic geometry.

The subgroups attached to the edges of are determined (in part) by a set of positive integers , say. In this paper we prove that is bounded, even when Cl is infinite. This leads, for example, to new free product decomposition results for certain principal congruence subgroups of , involving unipotent and elementary matrices.

     

Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than

Let be a prime congruent to 1 modulo 4, and let be rational integers such that is the fundamental unit of the real quadratic field . The Ankeny-Artin-Chowla conjecture (AAC conjecture) asserts that will not divide . This is equivalent to the assertion that will not divide , where denotes the th Bernoulli number. Although first published in 1952, this conjecture still remains unproved today. Indeed, it appears to be most difficult to prove. Even testing the conjecture can be quite challenging because of the size of the numbers ; for example, when , then both and exceed . In 1988 the AAC conjecture was verified by computer for all . In this paper we describe a new technique for testing the AAC conjecture and we provide some results of a computer run of the method for all primes up to .

     

Estimation of the Multivariate Normal Precision Matrix under the Entropy Loss

Let X ₁, , X _n (n > p) be a random sample from multivariate normal distribution N _p (, ), where R ^p and is a positive definite matrix, both and being unknown. We consider the problem of estimating the precision matrix ^–1. In this paper it is shown that for the entropy loss, the best lower-triangular affine equivariant minimax estimator of ^–1 is inadmissible and an improved estimator is explicitly constructed. Note that our improved estimator is obtained from the class of lower-triangular scale equivariant estimators.     

On Logarithmic Smoothing of the Maximum Function

We consider the maximum function f resulting from a finite number of smooth functions. The logarithmic barrier function of the epigraph of f gives rise to a smooth approximation g of f itself, where >0 denotes the approximation parameter. The one-parametric family g converges – relative to a compact subset – uniformly to the function f as tends to zero. Under nondegeneracy assumptions we show that the stationary points of g and f correspond to each other, and that their respective Morse indices coincide. The latter correspondence is obtained by establishing smooth curves x() of stationary points for g , where each x() converges to the corresponding stationary point of f as tends to zero. In case of a strongly unique local minimizer, we show that the nondegeneracy assumption may be relaxed in order to obtain a smooth curve x().     

A Load-Balanced Network with Two Servers

A load-balanced network with two queues Q ₁ and Q ₂ is considered. Each queue receives a Poisson stream of customers at rate _i , i=1,2. In addition, a Poisson stream of rate arrives to the system; the customers from this stream join the shorter of two queues. After being served in the ith queue, i=1,2, customers leave the system with probability 1–p _i ^*, join the jth queue with probability p(i,j), j=1,2, and choose the shortest of two queues with probability p(i,{1,2}). We establish necessary and sufficient conditions for stability of the system.     

Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints

For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality.