On the rank of a spectral function

Let P(x), 0 x 1, be an absolutely continuous spectral function in the separable Hilbert spacesS. If the vectors h_j, j=1, 2, ..., s; s are such that the set P(x)h_j is complete inS, then the rank of the function P(x) equals the general rank of the matrix-function d/dxP(x)h_i,h_js₁.Translated from Matematicheskie Zametki, Vol. 5, No. 4, pp. 457–460, April, 1969.     

Characterization theorem of generalized polynomial of best approximation having bounded coefficients

Let the set of generalized polynomials having bounded coefficients beK={p= _jg_j. _{j j j},j=1, 2, ...,n}, whereg ₁,g ₂, ...,g _n are linearly independent continuous functions defined on the interval [a, b], _j, _j are extended real numbers satisfying _j<+, _j>-, and _{j j}. Assume thatf is a continuous function defined on a compact setX [a, b]. This paper gives the characterization theorem forp being the best uniform approximation tof fromK, and points out that the characterization theorem can be applied in calculating the approximate solution of best approximation tof fromK.     

Conditions for non-oscillation of singular linear differential equations of second order

Conditions are found in the fulfillment of which each non-trivial solution of the equation u+ (t)u+(t)u=0, where(t) L(a, b) and (t–a)(t–b)(t) L(a, b) has not more than one zero on the interval atb.Translated from Matematicheskie Zametki, Vol. 6, No. 5, pp. 633–639, November, 1969.     

The problem of irregular perfect systems of sets of iterated differences

Fors2, the set of iterated differences associated with the prescribed integersa(s, j), 1js, is the set {a(i, j): 1jis} wherea(i–1,j)=|a(i, j)–a(i, j+1)|, general problem raised by work of Kreweras and Loeb concerns the existence of partitions of runs of consecutive integers into full sets of iterated differences. In the regular case, where all the sets of iterated differences have the same valencys, it is known that such partitions do not exist at least fors>8. We find here that the problem is more challenging in the case where the sets have different valencies.     

Un théorème sur les séries de Dirichlet

We considerk Dirichlet series a _j (n)n ^–s (1jk),k2. We suppose that for eachj the series a _j (n)n ^–s converges fors=s _j =j+it _j , and that Max j<1/(k–1). We prove that the (Dirichlet) product of these series converges uniformly on every bounded segment of the line es = (₁+...+ _k )/k+1–1/k and we estimate the rate of convergence. The number 1–1/k cannot be replaced by a smaller one.     

Triple Positive Solutions for Multipoint Conjugate Boundary Value Problems

For the nth order nonlinear differential equation y ⁽ⁿ⁾(t)=f(y(t)), t [0,1], satisfying the multipoint conjugate boundary conditions, y ^(j)(a_i) = 0,1 i k, 0 j n _i - 1, 0 =a ₁ < a ₂ < < a _k = 1, and _i=1 ^k n _i =n, where f: [0, ) is continuous, growth condtions are imposed on f which yield the existence of at least three solutions that belong to a cone.     

Acceleration of Superlinearly Convergent Sequences

A method analogous to the Aitken extrapolation is proposed to accelerate the convergence of sequences of real or complex numbers with asymptotic behavior where e _i is the error of the ith element of the sequence, d _j1 for all 1jr, and d_j > 1. The R-order of the resulting sequences is computed using methods which are also of independent interest.     

Two-sided polynomial approximation of functions

Conditions are established when the collocation polynomials P_m(x) and P_M(x), m M, constructed respectively using the system of nodes x_j of multiplicities a_j 1, j = O,, n, and the system of nodes x_-r,,x_o,,x_n,,x_n+r1, r O, r₁ O, of multiplicities a_-r,,(a_o + y_o),,(a_n + y_n),,a_n+r1, a_j + y_j 1, are two sided-approximations of the function f on the intervals , x_j[, j = O,...,n + 1, and on unions of any number of these intervals. In this case, the polynomials P_m (x), P_M ^(l) (x) with l a_j are two-sided approximations of the function f⁽¹⁾ in the neighborhood of the node x_j and the integrals of the polynomials P_m(x), P_M(x) over D_j are two-sided approximations of the integral of the function f (over D_j). If the multiplicities a_j a_j + y_j of the nodes x_j are even, then this is also true for integrals over the set _j= _µ ^k D_j µ 1, k n. It is shown that noncollocation polynomials (Fourier polynomials, etc.) do not have these properties.Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 67, pp. 31–37, 1989.     

Lattice point theory of irractional ellipsoids with an arbitrary center

We shall consider positive definite quadratic formsQ inr2 variables of the almost diagonal shape where 2, and for 1j,Q _j is a positive definite quadratic form with integral coefficients inr _j variables, _j is a positive real number,r _j1 andr ₁+...+r =r Letb ₁,...,b _r be a system of real numbers with 0b _j<1. For x>0 letA(x) be the number of lattice points in the ellipsoidQ(u+b)x, letV(x) be the volume of this ellipsoid and letP(x)=A(x)-V(x). Our purpose is to find the exact order ofP(x); i. e., the numberf for which for each >0P(x)=O(x^f+) andP(x)=(x ^f–).     

Cross-monotone subsequences

Two finite real sequences (a ₁,...,a _k ) and (b ₁,...,b _k ) are cross-monotone if each is nondecreasing anda _i+1–a _i b _i+1–b _i for alli. A sequence (₁,..., _n ) of nondecreasing reals is in class CM(k) if it has disjointk-term subsequences that are cross-monotone. The paper shows thatf(k), the smallestn such that every nondecreasing (₁,..., _n ) is in CM(k), is bounded between aboutk ²/4 andk ₂/2. It also shows thatg(k), the smallestn for which all (₁,..., _n ) are in CM(k)and eithera _k b ₁ orb _k a ₁, equalsk(k–1)+2, and thath(k), the smallestn for which all (₁,..., _n ) are in CM(_k)and eithera ₁b ₁...a _k b _k orb ₁a ₁...b _k a _k , equals 2(k–1)²+2.The results forf andg rely on new theorems for regular patterns in (0, 1)-matrices that are of interest in their own right. An example is: Every upper-triangulark ²×k ² (0, 1)-matrix has eitherk 1's in consecutive columns, each below its predecessor, ork 0's in consecutive rows, each to the right of its predecessor, and the same conclusion is false whenk ² is replaced byk ²–1.     

Inequalities for two set systems with prescribed intersections

Inequalities are presented for systems {(A _i ,B _i ):1 i m} of pairs of finite sets satisfyingA _i B _i = andA _i B _j orA _j B _i fori j.     

ALTERNATION THEORY IN APPROXIMATION BY POLYNOMIALS HAVING BOUNDED COEFFICIENTS

ＡＬＴＥＲＮＡＴＩＯＮＴＨＥＯＲＹＩＮＡＰＰＲＯＸＩＭＡＴＩＯＮＢＹＰＯＬＹＮＯＭＩＡＬＳＨＡＶＩＮＧＢＯＵＮＤＥＤＣＯＥＦＦＩＣＩＥＮＴＳＸＵＳＨＵＳＨＥＮＧ（许树声）（ＪｉａｎｇｎａｎＵｎｉｖｅｒｓｉｔｙ,Ｗｕｘｉ２１４０６３,Ｃｈｉｎａ）Ａｂｓ...     

A Local Approach to 1-Homogeneous Graphs

Let bea distance-regular graph with diameter d. For vertices x and y of at distancei, 1 i d, we define the setsC _i(x,y) = i–1(x) (y), A _i (x,y) = _i (x) (y) and B _i (x,y) = _i+1(x) (y).Then we say has the CAB_j property,if the partition CAB _i (x,y) = {C _i (x,y),A _i (x,y),B _i (x,y)}of the local graph of y is equitable for each pairof vertices x and y of at distance i j. We show that in with the CAB_j property then the parameters ofthe equitable partitions CAB i(x,y) do not dependon the choice of vertices x and y atdistance i for all i j. The graph has the CAB property if it has the CAB _d property. We show the equivalence of the CAB property and the1-homogeneous property in a distance-regular graph with a ₁ 0. Finally, we classify the 1-homogeneous Terwilligergraphs with c ₂ 2.     

Packing random items of three colors

Consider three colors 1,2,3, and forj3, considern items (X _i,j)in of colorj. We want to pack these items inn bins of equal capacity (the bin size is not fixed, and is to be determined once all the objects are known), subject to the condition that each bin must contain exactly one item of each color, and that the total item sizes attributed to any given bin does not exceed the bin capacity. Consider the stochastic model where the random variables (X _i,jj)in,j3 are independent uniformly distributed over [0,1]. We show that there is a polynomial-time algorithm that produces a packing which has a wasted spaceK logn with overwhelming probability.Work partially supported by an N.S.F. grant.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

On well-quasi-ordering finite structures with labels

A quasi-ordered setA (i.e. one equipped with a reflexive and transitive relation ) is said to be well-quasi-ordered (wqo) if for every infinite sequencea ₁,a ₂, ... of elements ofA there are indicesi, j such thati < j anda _i a _j.Various natural wqo setsQ admit labelling by another wqoA yielding another quasi-ordered setQ(A), which may or may not be wqo. A suitable concept covering this phenomenon is the notion of aQO-category. We have two conjectures aboutQO-categories in the effect that labellingQO-categories by a wqo set can always be reduced to labelling by ordinals. We prove these conjectures for a broad class ofQO-categories and for generalQO-categories we prove weaker forms of these conjectures.     

Finite cupping sets

We show that given any (Turing) degree 0<c0 and any uniformly ₂ sequence of degrees b₀,b₁,b₂,.. such that i(b_i c), there exists 0<a<0 such that for all i0, ab_i c. If c is c.e. and b₀,b₁,b₂,.. are uniformly (strictly) below c then there exists such an a below c.     

Shape-preserving Kolmogorov widths of classes of <Emphasis Type="Italic">s</Emphasis>-monotone integrable functions

Let s ₀ and let ₊ ^s be the set of functions x defined on a finite interval I and such that, for all collections of s + 1 pairwise different points t ₀,..., t _s I, the corresponding divided differences [x; t ₀,...,t _s ] of order s are nonnegative. Let ₊ ^s B _{p +} ^s B _p, 1 p where B _p is a unit ball in the space L _p, and let ₊ ^s L _{q +} ^s L _q, 1 q . For every s 3 and 1 q p , we determine the exact orders of the shape-preserving Kolmogorov widths {x - y} \right\ L_q , $$]]>, where M ⁿ is the collection of all affine linear manifolds M ⁿ in L _q such that dim M ⁿ n and M ⁿ ₊ ^s L _q .Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 7, pp. 901–926, July, 2004.     

Monotone subsequences in (0, 1)-matrices

A (0, 1)-matrix contains anS ₀(k) if it has 0-cells (i, j ₁), (i + 1,j ₂),..., (i + k – 1,j _k) for somei andj ₁ < ... < j_k, and it contains anS ₁(k) if it has 1-cells (i ₁,j), (i ₂,j + 1),...,(i _k ,j + k – 1) for somej andi ₁ < ... <i _k . We prove that ifM is anm × n rectangular (0, 1)-matrix with 1 m n whose largestk for anS ₀(k) isk ₀ m, thenM must have anS ₁(k) withk m/(k ₀ + 1). Similarly, ifM is anm × m lower-triangular matrix whose largestk for anS ₀(k) (in the cells on or below the main diagonal) isk ₀ m, thenM has anS ₁(k) withk m/(k ₀ + 1). Moreover, these results are best-possible.     

Anwendungen der Nielsenschen Kürzungsmethode in Gruppen mit einer definierenden Relation

LetG=a ₁,b ₁, ...,a _q ,b _q | (W ₁ (a ₁,b ₁) ...W _q (a _q b _q ))=1,q1, 2,W _j (a _j ,b _j )1. We solve the isomorphism problem forG inasmuch as we can decide in finitely many steps, if any arbitrary one-relator group is isomorphic toG or not. FurthermoreG turns out to have a finitely generated automorphism group. Forq=1 this was proved byS. J. Pride. Forq2 the proof is based onNielsen's reduction method. There are some other interesting results on subgroup problems for one-relator groups obtained by this method.