The Whitehead Group of the Novikov Ring

The Bass–Heller–Swan–Farrell–Hsiang–Siebenmann decomposition of the Whitehead group K ₁(A[z,z^-1]) of a twisted Laurent polynomial extension A[z,z^-1] of a ring A is generalized to a decomposition of the Whitehead group K ₁(A((z))) of a twisted Novikov ring of power series A((z))=A[[z]][z^-1]. The decomposition involves a summand W₁(A, ) which is an Abelian quotient of the multiplicative group W(A,) of Witt vectors 1+a₁z+a₂z²+ ··· A[[z]]. An example is constructed to show that in general the natural surjection W(A, )^ab W₁(A, ) is not an isomorphism.     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems

We prove that the existence of a polynomial time-approximation algorithm (where < 1 is a fixed constant)for a class of independent set problems, leads to a polynomial timeapproximation algorithm with approximation ratio strictly smallerthan 2 for vertex covering, while the non-existence of such analgorithm induces a lower bound on the ratio of every polynomialtime approximation algorithm for vertex covering. We also prove asimilar result for a (maximization) convex programming problemincluding quadratic programming as subproblem.     

The Hilbert–Poincaré Series for Some Algebras of Invariants of Cyclic Groups

Let be a linear representation of a finite group over a field of characteristic 0. Further, let R be the corresponding algebra of invariants, and let P (t) be its Hilbert–Poincaré series. Then the series P (t) represents a rational function (t)/(t). If R is a complete intersection, then (t) is a product of cyclotomic polynomials. Here we prove the inverse statement for the case where is an almost regular (in particular, regular) representation of a cyclic group. This yields an answer to a question of R. Stanley in this very special case. Bibliography: 3 titles.     

Time decay for nonlinear wave equations in two space dimensions

The Cauchy Problem for the equation u_tt–u+|u|^p–1u=0 (x², t>0, >1) is studied. Smooth Cauchy data is prescribed, and no smallness condition is imposed. For >5, it is shown that the maximum amplitude of such a wave decays at the expected rate t^–1/2 as t. For 1+8<5, the maximum amplitude still decays, but at a slower rate. These results are then used to demonstrate the existence of the scattering operator when >_o, where _o is the root of the cubic equation ³-2²-7-8=0; thus _o4.15.Alfred P. Sloan Research Fellow     

Exact Values of Widths of Classes of Analytic Functions on the Disk and Best Linear Approximation Methods

In the Hardy space H _p, (p1, 0< 1, H _p,1 H _p) we develop best linear approximation methods (previously studied by Taikov and Ainulloev) for the classes W(r,,) of analytic functions on the unit disk and calculate the exact values of linear, Gelfand, and informational n-widths of these classes.     

The conditions of selfadjointness of the operator of singular integration

It is proved that the operator of singular integration along a bounded rectifiable curve is self-adjoint in the weighted spaceL ₂(, ) if and only if is a circle and (t)=const.     

Posterior Sensitivity to the Sampling Distribution and the Prior: More than One Observation

Sensitivity of a posterior quantity (f, P) to the choice of the sampling distribution f and prior P is considered. Sensitivity is measured by the range of (f, P) when f and P vary in nonparametric classes ^f and ^P respectively. Direct and iterative methods are described which obtain the range of (f, P) over f ^f when prior P is fixed, and also the overall range over f ^f and P ^P . When multiple i.i.d. observations X ₁,...,X _k are observed from f, the posterior quantity (f, P) is not a ratio-linear function of f. A method of steepest descent is proposed to obtain the range of (f, P). Several examples illustrate applications of these methods.     

Stable Exponents in Discrete Groups

It is known that in a word hyperbolic group the stable exponent of every nontorsion element is an integer. We prove that this is also true in finitely generated nilpotent groups. On the other hand, we show that for any rational number 1 there exists a torsionfree CAT(0) group containing an element whose stable exponent is equal to .     

Holomorphe Funktionen auf Gebieten über Banach-Räumen zu vorgegebenen Konvergenzradien

Given a function: ₊ on a domain spread over an infinite dimensional complex Banach space E with a Schauder basis such that -log is plurisubharmonic and d (d denotes the boundary distance on ) one can find a holomorphic function f: with _f, where _f is the radius of convergence of f. If, in addition, is locally Lipschitz continuous with constant 1, f can be chosen so that (3M)^–1 _f, where M is the basis constant of E. In the particular case of E= ₁ there are holomorphic functions f on with= _f.     

Rational Approximation of Analytic Functions Having Generalized Orders of Rate of Growth

Let f be holomorphic on a domain G C¯ and _n be the error in best approximation of f in the supremum norm on a compact set E G by rational functions of order n. We obtain results characterizing the degree of decrease of the best approximation _n in terms connected with the condenser (E,F), F=C¯ \ G¯, and the rate of growth of the maximum modulus of f(z). In particular, if f has a generalized order (, , f) in the domain G, thenlim sup_n (n)/ (log (1/log⁺((_{0 1} ....... _n)^1/n(n+1) ))) (, , f),where = exp (1/C(E,F)), C(E,F) is the capacity of the condenser (E,F).     

Second-order properties of the loss probability inM/M/s/s +c systems

The Erlang loss function, which gives the steady state loss probability in anM/M/s/s system, has been extensively studied in the literature. In this paper, we look at the similar loss probability inM/M/s/s + c systems and an extension of it to nonintegral number of servers and queue capacity. We study its monotonicity properties. We show that the loss probability is convex in the queue capacity, and that it is convex in the traffic intensity if is below some ^* and concave if is greater that ^*, for a broad range of number of servers and queue capacities. We prove that the one-server loss system is the onlyM/M/s/s +c system for which the loss probability is concave in the traffic intensity in all its range.Research supported by Grant BD/645/90-RM from Junta Nacional de Investigação Científica e Tecnológica.On leave from: Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1096 Lisboa Codex, Portugal.     

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.     

Finite clusters in high-density continuous percolation: Compression and sphericality

Summary A percolation process inR ^d is considered in which the sites are a Poisson process with intensity and the bond between each pair of sites is open if and only if the sites are within a fixed distancer of each other. The distribution of the number of sites in the clusterC of the origin is examined, and related to the geometry ofC. It is shown that when andk are large, there is a characteristic radius such that conditionally on |C|=k, the convex hull ofC closely approximates a ball of radius , with high probability. When the normal volumek/ thatk points would occupy is small, the cluster is compressed, in that the number of points per unit volume in this -ball is much greater than the ambient density . For larger normal volumes there is less compression. This can be compared to Bernoulli bond percolation on the square lattice in two dimensions, where an analog of this compression is known not to occur.Research supported by NSF grant number DMS-9006395     

Unisecant curves on a general ruled surface

Let X be an irreducible algebraic curve of genus g smooth and proper over an algebraically closed field k, a locally free sheaf of rank 2 over X, F=P() the projective bundle associated to and :FX the canonical projection. Aunisecant curve on F is a curve (effective divisor) C on F such that the intersection number (C,–¹(x))=1, x X. Notice that a section of F over X or alternatively a sub-line bundle of means simply an irreducible unisecant curve. We give here some results on unisecant curves on F. In particular we are able to prove C.Segre's result regarding his general surfaces [8]. A more ample account including all the details will appear later.     

Some remarks on the modulus of continuity of a conformal mapping of the disk onto a Jordan domain

Letd(;z, t) be the smallest diameter of the arcs of a Jordan curve with endsz andt. Consider the rapidity of decreasing ofd(;)=sup{d(;z, t):z, t , ¦z–t¦} (as 0,0) as a measure of nicety of . Letg(x) (x0) be a continuous and nondecreasing function such thatg(x)x,g(0)=0. Put¯g(x)=g(x)+x, h(x)=(¯g(x))². LetH(x) be an arbitrary primitive of 1/h ^–1(x). Note that the functionH ^–1 x is positive and increasing on (–, +),H ^–1 0 asx– andH ^–1+ asx +. The following statement is proved in the paper.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 176–184, August, 1996.This research was supported by the Russian Foundation for Basic Research under grant No. 93-01-00236 and by the International Science Foundation under grant No. NCF000.     

Best Linear Methods of Approximation of Functions of the Hardy Class H p

We determine the exact value of the best linear polynomial approximation of a unit ball of the Hardy space H _p, 1 p , on concentric circles , 0 < 1, in the uniform metric. We construct the best linear method of approximation and prove the uniqueness of this method.     

Solvability of partial differential equations of infinite order in certain classes of entire functions

In this paper it is shown that under conditions of applicability of the operator to the class [,] =(I,s), ₂ 1, ₂), ₁, ₂< the equation y=f has a particular solution of this class vf[, ]. The general form of a solution of the homogeneous equation y=0 is established. The growth of a solution is investigated by means of a system of conjugate orders and a system of conjugate types. A solvability result is also obtained in the class , where T is a certain set in R ₊ ² depending on the operator .Translated from Matematicheskie Zametki, Vol. 19, No. 2, pp. 225–236, February, 1976.In conclusion, the author would like to express his thanks to his adviser, Yu. F. Korobeinik.     

Spatial problem of Darboux type for one model equation of third order

For a hyperbolic type model equation of third order a Darboux type problem is investigated in a dihedral angle. It is shown that there exists a real number ₀ such that for > ₀ the problem under consideration is uniquelly solvable in the Frechet space. In the case where the coefficients are constants, Bochner's method is developed in multidimensional domains, and used to prove the uniquely solvability of the problem both in Frechet and in Banach spaces.     

Best approximation and best unilateral approximation of the kernel of a biharmonic equation and optimal renewal of the values of operators

For the classB _p , 0 < 1, 1p , of 2-periodic functions of the form f(t)=u(,t), whereu (,t) is a biharmonic function in the unit disk, we obtain the exact values of the best approximation and best unilateral approximation of the kernel K(t) of the convolution f= K *g, gl, with respect to the metric of L₁. We also consider the problem of renewal of the values of the convolution operator by using the information about the values of the boundary functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol.47, No. 11, pp. 1549–1557, November, 1995.