A Radial Derivative with Boundary Values of the Spherical Poisson Integral

A formula of a radial derivative is obtained with the aid of derivatives with respect to and to of the functions closely connected with the spherical Poisson integral and the boundary values are determined for . The boundary values are also found for partial derivatives with respect to the Cartesian coordinates .     

Riemann's Fragment on Limit Values of Elliptic Modular Functions

We give an interpretation different from that of Dedekind to work n° 28 of the complete works of Riemann Fragmente über die Grenzfälle der Elliptischen Modulfunctionen.We prove a theorem of inversion of radial limit and sum in a series of functions. This allows us to justify all of Riemann's reasoning in the fragment to obtain the limit values of modular elliptic functions. In particular we prove the statement of Riemann that for every rational number x we have where denotes the periodic function with period 1, such that (x) = x when |x| < 1/2, and (n + ) = 0 for every n Z.This assertion of Riemann was criticized by Dedekind. We also give the transformation formulae of the logarithms of the classical theta-function ₃(0), giving an alternative form to that obtained by B. C. Berndt [1].     

Algorithms for optimization problems with exclusion constraints

This paper proposes algorithms for minimizing a continuously differentiable functionf(x): ⁿ subject to the constraint thatx does not lie in specified bounded subsets of ⁿ . Such problems arise in a variety of applications, such as tolerance design of electronic circuits and obstacle avoidance in the selection of trajectories for robot arms. Such constraints have the form . The function is not continuously differentiable. Algorithms based on the use of generalized gradients have considerable disadvantages because of the local concavity of at points where the set {j|g ^j (x)=(x)} has more than one element. Algorithms which avoid these disadvantrages are presented, and their convergence is established.This research was sponsored in part by the National Science Foundation under Grant ECS-81-21149, the Air Force Office of Scientific Research (AFSC), United States Air Force under Contract F49620-79-C-0178, the Office of Naval Research under Grant N00014-83-K-0602, the Air Force Office of Scientific Research under Grant AFOSR-83-0361, and the Semiconductor Research Consortium under Grant SRC-82-11-008.     

On a Problem of P. Gallagher

Let p be an odd prime. For each integer a with x < a x + u and (a,p) = 1, we define by a 1 (mod p) and 1 p - 1. Let r(p,u,x) be the number of integers with x < a x + u and (a,p) = 1 for which a and are of opposite parity, and let E(n,u,x) = r(n,u,x) - 1/2 1, where denotes summation over all a such that (a,p) = 1. The main purpose of this paper is to prove that for any positive integer 1 u we have the asymptotic formula

Spherical elastic-plastic waves

Zusammenfassung Es wird die Fortpflanzung elastisch-plastischer Spannungswellen in einem unendlichen Medium betrachtet, welches einer idealen Spannungs-Verformungs-Kurve folgt, Trescas Fliesskriterium unterworfen ist und einen sphärischen Hohlraum enthält, wobei an der Fläche des Hohlraumes ein Stoss angenommen wird. Ein rechnerisches Verfahren, basiert auf endliche Differenzen, wird entwickelt and ein Beispiel gegeben.

---

Notation radial stress - tangential stress - K yield stress - _rr non-dimensional radial stress ( /K) - non-dimensional tangential stress ( /K) - , Lame's constants - K _b Bulk constant (=(3+2)/3) - v Poisson's constant - Material density - C Elastic wave velocity (=((+2)/)^1/2) - C _p Plastic wave velocity (=(K _b /)^1/2) - distance from center of cavity - r ₀ cavity radius - v non-dimensional radial co-ordinate (= /r ₀) - time - t non-dimensional time (=C /r ₀) - radial displacement - u non-dimensional radial displacement (=/r ₀) - particle velocity - v non-dimensional particle velocity (= /C) - pressure - P(t) non-dimensional pressure (= /K)     

A Delocalization Property for Assembly Maps and an Application in Algebraic K-Theory of Group Rings

Let be a group, F the free -module on the set of finite order elements in , with acting by conjugation, and the ring extension of by % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeaacaGaaiaabeqaamaabaabaaGcbaWaaiWaaeaada% WcaaqaaiaaigdaaeaatCvAUfKttLearyGqLXgBG0evaGqbciab-5ga% UbaaieaacaGFLbGaaGOmaiaabc8acqWFPbqAcaqGVaGae8NBa42aaq% qaaeaacqGHdicjcqaHZoWzcqGHiiIZcqqHtoWrcaqGGaGaae4Baiaa% bAgacaqGGaGaae4BaiaabkhacaqGKbGaaeyzaiaabkhacaqGGaGae8% NBa4gacaGLhWoaaiaawUhacaGL9baaaaa!563E!\[\left\{ {\frac{1}{n}e2{\text{\pi }}i{\text{/}}n\left| {\exists \gamma \in \Gamma {\text{ of order }}n} \right.} \right\}\]. For a ring R with , we build an injective assembly map , detected by the Dennis trace map. This is proved by establishing a delocalization property for the assembly map in Hochschild homology, namely providing a gluing of simpler assembly maps (i.e. localized at the identity of ) to build , and by delocalizing a known assembly map in K-theory to define . We also prove the delocalization property in cyclic homology and in related theories.     

Sur les Propriétés Arithmétiques de la Fonction de Tschakaloff

Let P and Q be non-zero polynomials with integer coefficients; suppose that all the roots of Q are rational numbers, and that Q(n) 0 for every n N. Let q Z, with |q| 2, and let Q^*. We prove that the number is irrational.From this we deduce linear independence results over Q for the values at x = of Tschakaloff's function Ta(x) = , of its derivatives, and of its primitives. The proof uses Loxton and Van der Poorten's extension of Mahler's transcendence method, which leads, in this case, only to irrationality results.     

A Characterization of Some Minihypers and its Application to Linear Codes

Any {f,r- 2+s; r,q}-minihyper includes a hyperplane in PG(r, q) if fr-1 + s 1 + q – 1 for 1 s q – 1, q 3, r 4, where i = (qi + 1 – 1)/ (q – 1 ). A lower bound on f for which an {f, r – 2 + 1; r, q}-minihyper with q 3, r 4 exists is also given. As an application to coding theory, we show the nonexistence of [ n, k, n + 1 – qk – 2 ]q codes for k 5, q 3 for qk – 1 – 2q – 1 < n qk – 1 – q – 1 when k > q – q - \sqrt q + 2$$ " align="middle" border="0"> and for when , which is a generalization of [18, Them. 2.4].     

Minimal Blocking Sets in Projective Spaces of Square Order

In this paper minimal m-blocking sets of cardinality at most in projective spaces PG(n,q) of square order q, q 16, are characterized to be (t, 2(m-t-1))-cones for some t with . In particular we will find the smallest m-blocking sets that generate the whole space PG(n,q) for 2m n m.     

On the Lax Solution to the Hamilton–Jacobi Equation and Its Generalizations. Part II

This article is a continuation of [J. Math. Sci., 99, No.5, 1541–1547 (2000)] devoted to the validity of the Lax formula (cited in the article of Crandall, Ishii, and Lions [Bull. AMS, 27, No.1, 1–67 (2000)])

Algebraic Dilogarithm Identities

The Rogers L-function satisfies the functional equation .From this we derive several other such equations, including Euler's identity L(x)+L(1-x)=L(1) and various identities arising from summation and transformation formulas for basic hypergeometric series. We also obtain some new equations of the form where is algebraic and the c _k are integers.     

Chebyshev Solution of the Nearly-Singular One-Dimensional Helmholtz Equation and Related Singular Perturbation Equations: Multiple Scale Series and the Boundary Layer Rule-of-Thumb

The one-dimensional Helmholtz equation, ² u _xx –u=f(x), arises in many applications, often as a component of three-dimensional fluids codes. Unfortunately, it is difficult to solve for 1 because the homogeneous solutions are exp(±x/), which have boundary layers of thickness O(1/). By analyzing the asymptotic Chebyshev coefficients of exponentials, we rederive the Orszag–Israeli rule [16] that Chebyshev polynomials are needed to obtain an accuracy of 1% or better for the homogeneous solutions. (Interestingly, this is identical with the boundary layer rule-of-thumb in [5], which was derived for singular functions like tanh([x–1]/).) Two strategies for small are described. The first is the method of multiple scales, which is very general, and applies to variable coefficient differential equations, too. The second, when f(x) is a polynomial, is to compute an exact particular integral of the Helmholtz equation as a polynomial of the same degree in the form of a Chebyshev series by solving triangular pentadiagonal systems. This can be combined with the analytic homogeneous solutions to synthesize the general solution. However, the multiple scales method is more efficient than the Chebyshev algorithm when is very, very tiny.     

Existence and regularity of solutions for a semilinear first-order equation on the torus

The problem is considered on the N-dimensional torus with a_i and g a continuous function satisfying a growth condition as ¦u¦. We show the existence of bounded solutions that are continuous if g is strictly increasing in u.     

On the Chebyshev Function ψ(x)

Suppose that the Riemann hypothesis is valid, and let be the Chebyshev function. In this paper, we obtain the following bound for all >1 and positive integers .     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

Lecture Hall Partitions II

For a non-decreasing integer sequence a=(a₁,...,a_n) we define L_a to be the set of n-tuples of integers = (₁,...,_n) satisfying . This generalizes the so-called lecture hall partitions corresponding to a_i=i and previously studied by the authors and by Andrews. We find sequences a such that the weight generating function for these a-lecture hall partitions has the remarkable form In the limit when n tends to infinity, we obtain a family of identities of the kind the number of partitions of an integer m such that the quotient between consecutive parts is greater than is equal to the number of partitions of m into parts belonging to the set P, for certain real numbers and integer sets P. We then underline the connection between lecture hall partitions and Ehrhart theory and discuss some reciprocity results.     

Almost everywhere convergence of the spherical partial sums for radial functions

LetfL ^p( ⁿ ),n2, be a radial function and letS _Rf be the spherical partial sums operator. We prove that if thenS _Rf(x)f(x) a.e. asR. The result is false for and \frac{{2n}}{{n + 1}}$$ " align="middle" border="0"> .Partially supported by M.P.I.     

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

M-estimators of structural parameters in pseudolinear models

Real valued M-estimators in a statistical model 1 with observations are replaced by -valued M-estimators in a new model with observations where are regressors, is a structural parameter and a structural function of the new model. Sufficient conditions for the consistency of are derived, motivated by the sufficiency conditions for the simpler parent estimator The result is a general method of consistent estimation in a class of nonlinear (pseudolinear) statistical problems. If F has a natural exponential density e^{x–b( x )} then our pseudolinear model with u = (g o )^–1 reduces to the well known generalized linear model, provided () = db()/d and g is the so-called link function of the generalized linear model. General results are illustrated for special pairs and leading to some classical M-estimators of mathematical statistics, as well as to a new class of generalized -quantile estimators.     

Markov- and Bernstein-Type Inequalities for Polynomials with Restricted Coefficients

The Markov-type inequality is proved for all polynomials of degree at most n with coefficients from {-1,0,1} with an absolute constant c. Here ·[0,1] denotes the supremum norm on [0,1]. The Bernstein-type inequality is shown for every polynomial p of the form The inequality is also proved for every analytic function p on the open unit disk D that satisfies the growth condition