Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

The length,the width and the cutset-number of finite ordered sets

The partially ordered set P is an (, , ) ordered set if the width of P, the length of any chain of P and the cut-set number . We will prove that if P is an (, , ) ordered set then P contains a simple (, , ) ordered set and use this result to prove that if P has the 3 cutset property, then width of P length of P+3.     

A generalized integral with applications to trigonometric series

, . . .

---

---

The authors wish to thank the referee whose comments improved the presentation of the paper. In fact, the present form of Lemma 2, which was originally very long, is due to the referee.     

On the exactness of a theorem of G.A. Fomin

, . . [1] - . .     

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Let ₀ > ₁ ··· > _D denote the eigenvalues of and let q ^h _ij (0 h, i, j D) denote the Krein parameters of . Pick an integer h (1 h D – 1). The representation diagram = _h is an undirected graph with vertices 0,1,...,D. For 0 i, j D, vertices i, j are adjacent in whenever i j and q ^h _ij 0. It turns out that in , the vertex 0 is adjacent to h and no other vertices. Similarly, the vertex D is adjacent to D – h and no other vertices. We call 0, D the trivial vertices of . Let l denote a vertex of . It turns out that l is adjacent to at least one vertex of . We say l is a leaf whenever l is adjacent to exactly one vertex of . We show has a nontrivial leaf if and only if is the disjoint union of two paths.     

Асимптоический Анализ Распределения Статистики Диксона

. u 60-u u     

Sur la répartition des valeurs de la fonction d'Euler

Let (x) denote the number of those integers n with (n) x, where denotes the Euler function. Improving on a well-known estimate of Bateman (1972), we show that (x)-Ax R(x), where A=(2)(3)/(6) and R(x) is essentially of the size of the best available estimate for the remainder term in the prime number theorem.     

On a problem of B. I. Golubov

. . . : s_n(x) — , _n-(, 1)- n L ². , . , : a _k l ² _n () [0,1] , (*) , (**) . a _k l ² u _n () [0,1] , (**), (*) .     

QUADRATIC ESTIMATORS OF QUADRATIC FUNCTIONS WITH PARAMETERS IN NORMAL LINEAR MODELS

ＱＵＡＤＲＡＴＩＣＥＳＴＩＭＡＴＯＲＳＯＦＱＵＡＤＲＡＴＩＣＦＵＮＣＴＩＯＮＳＷＩＴＨＰＡＲＡＭＥＴＥＲＳＩＮＮＯＲＭＡＬＬＩＮＥＡＲＭＯＤＥＬＳ￥ＷＵＱＩＧＵＡＮＧ（吴启光）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｅＳｃｉｅｎｃｅ,ｔｈｅＣｈｉｎｅｓｅ...     

On term by term dyadic differentiability of Walsh series

. . . . : {ja _j },j=1,2,... — , f(x) , , f ^[1](x) — f .     

A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs

A proof of the following conjecture of Jungnickel and Tonchev on quasi-multiple quasi-symmetric designs is given: Let D be a design whose parameter set (v,b,r,k,) equals (v,sv,sk,k, s) for some positive integer s and for some integers v,k, that satisfy (v-1) = k(k-1) (that is, these integers satisfy the parametric feasibility conditions for a symmetric (v,k,)-design). Further assume that D is a quasi-symmetric design, that is D has at most two block intersection numbers. If (k, (s-1)) = 1, then the only way D can be constructed is by taking multiple copies of a symmetric (v,k, )-design.     

Extremal problems in classes of univalent functions,omitting prescribed values

Section 1 of the paper is devoted to extremal problems in the classes of conformal homeomorphisms of the circle and the annulus, connected directly with the problem on the maximum of the conformal modulus in the family of doubly connected domains. In Secs. 2 and 3 one considers the class R of functions f()=c₁+c₂²+... regular and univalent in the circleU={||<1} and such that f(₁)f(₂)=1 for ₁₂U (the class of Bieberbach-Eilenberg functions). Here one solves the problem of the maximum of |f(₀)| in the class of functions f()R with a fixed value f(₀, where ₀ is an arbitrary point U, and of the maximum of |f(₀)| in the entire class R. For the proof one makes use of the method of the moduli of families of curves.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 94–114, 1985.     

Pointwise convergence of expansions with respect to certain product systems

- , - _n A_n-,. , . , ¦_n¦=1 (n=1,2, ), . , — — , .     

Subalgebras that are cyclic as submodules

Let R be an associative, commutative, unital ring. By a R-algebra we mean a unital R-module A together with a R-module homomorphism : _R ⁿ AA (n2). We raise the question whether such an algebra possesses either an idempotent or a nilpotent element. In section 1 an affirmative answer is obtained in case R=k is an algebraically closed field and dim_kA<, as well as in case R=, dimS<, and n0(2). Section 2 deals with the case of reduced rings R and R-algebras which are finitely generated and projective as R-modules. In section 3 we show that the generic algebra over an integral domain D fails to have nilpotent elements in any integral domain extending its base ring D_n,m, and thus acquires an idempotent element in some integral domain extending D_n,m.Partially supported by National Science Foundation Grant GP-38229.     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.     

An algorithm for constructing an optimal structural schedule

The article is devoted to the problem of finding an optimal schedule for a class of functionals ƒ which allows for the existence of a structural set of activities. The functionalƒ(R), where, is defined in the following way: where {_i(t)} is a structural set of functions, and the function F is defined on any finite set of arguments and satisfies the following conditions: 1)F(x)=(x); 2) F(x₁,x₂)=(x₁,x₂), F(x₁,x₂,...x₃)= (x₁, F(x₂,...,x_s)), S2; 3) and do not decrease in each of their arguments, and moreover, 3a) strictly increases with the increase of both arguments, 3b) if (x₁,x₂)>(x₁, x₂ (x₂, x₃)> (x₂,x₃), then F(x₁,x₂,x₃)>F(x₁,x₂,x₃).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 124, pp. 5–20, 1983.     

О числе Делителей “Сдвинутых” Простых чисел-Близнецов

.      

On the parameter estimation of diffusional type processes with constant coefficients (Elementary Gaussian Processes)

, (1). 3, , ()=, (8) (16). [1], . (28) (31) ( 5), - (. [3]).

---

---

The author thanks Professor M.Arató for having pointed out this problem, and for his valuable suggestions.