Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .     

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.     

On contiguity of probability measures corresponding to semimartingales

, (ⁿ), - (P ⁿ ), P ⁿ (A ⁿ )>0P ⁿ (A ⁿ )0,n. [15] - , . , P ⁿ P ⁿ T ⁿ T ⁿ .     

On the order of approximation to functions ofH p (R) (0<p≦1) by certain means of Fourier integrals

H ^P (R ₊ ² ) — R ₊ ² ={zC: Imz>0} ^p (R) — H ^p (R ₊ ² ). P ^k (f,x) — ë- — ,W ^k (f,x) — — R ^k, (f,x) — f H (R) (. §1,1)–3)); _k (, f) _p — - . , fH ^p (R) 0<p1,kN; (1+)^–1<p1, 0<<,kN.     

Exact error bound of approximation by interpolating splines inL-metric on the classesW p r (1≦p

Корнейчук  Н. П. 《Analysis Mathematica》1977,3(2):109-117

Black holes on the plane drawn by a Wiener process

Summary We say that the discD()R ², of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT.     

On Piecewise-Constant Approximation of Continuous Functions of n Variables in Integral Metrics

We consider the approximation by piecewise-constant functions for classes of functions of many variables defined by moduli of continuity of the form (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ), where _i ( _i ) are ordinary moduli of continuity that depend on one variable. In the case where _i ( _i ) are convex upward, we obtain exact error estimates in the following cases: (i) in the integral metric L ₂ for (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ); (ii) in the integral metric L _p (p 1) for (₁, ..., _n ) = c ₁₁ + ... + c _{n n} ; (iii) in the integral metric L _{(2, ..., 2, 2r)} (r = 2, 3, ...) for (₁, ..., _n ) = ₁(₁) + ... + _{n – 1}( _{n – 1}) + c _{n n} .     

Über den algorithmischen Nachweis von Ungleichungen I

We shall develop a method to prove inequalities in a unified manner. The idea is as follows: It is quite often possible to find a continuous functional : ⁿ , such that the left- and the right-hand side of a given inequality can be written in the form (u)(v) for suitable points,v=v(u). If one now constructs a map ^{n n} , which is functional increasing (i.e. for each x ⁿ (which is not a fixed point of ) the inequality (x)<((x)) should hold) one specially gets the chain (u)( u))( ²(u))... ⁿ (u)). Under quite general conditions one finds that the sequence { ⁿ (u)} _n converges tov=v(u). As a consequence one obtains the inequality (u)(v).     

A quantitative refinement of Rado's theorem

The fundamental result of the paper is the following. Theorem: Let be a k-quasiconformal Jordan curve and let be another Jordan curve (not necessarily quasiconformal). Assume that f maps conformallyext ontoext , f()=, f()>0. We assume that there exists a homeomorphism between and such that Then there exist numbers =(k)>0 and A=A(k), such that f(())– A, .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 157, pp. 103–112, 1987.     

Critical points of essential norms of singular integral operators in weighted spaces

We show that for any simple piecewise Ljapunov contour there exists a power weight such that the essential norm |S | in the spaceL ₂(, ) does not depend on the angles of the contour and it is given by formula (2). All such weights are described. For the union =₁₂ of two simple piecewise Lyapunov curves we prove that the essential norm |S | inL ₂() is minimal if both ₁ and ₂ are smooth in some neighborhoods of the common points. It is the case when the norm |S | in the spaceL ₂() as well as inL ₂(, ) does not depend on the values of the angles and it can be calculated by formula (5).     

Isomorphism of one-place functors Ext

Let be an associative ring with identity. One considers the category of left (unitary) -modules m and also the contravariant and the covariant functors Ext ¹ ( ,A) and Ext ¹ (A, ): M_z M. One proves the following results: (1) If the homomorphism of -modules A B induces an isomorphism Ext ¹ ( ,A)Ext ¹ ( ,B), then there exist injective -modules J₁ and J₂ such that AJ₁BJ₂. (2) Every functorial morphism Ext ¹ ( ,A)Ext ¹ ( ,B) induces a certain homomorphism of -modules AB. One also obtains a dual result.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 112, pp. 71–74, 1981.     

Sharp Nikolskii inequalities with exponential weights

w _a(x)=exp(–x^a), xR, a0. , N _n (a,p,q) — (2), _n P _nw_ap, CN_n(a,p, q)P_nw_aq. , — , {P _n}, .

---

---

This material is based upon research supported by the National Science Foundation under Grant No. DMS-84-19525, by the United States Information Agency under Senior Research Fulbright Grant No. 85-41612, and by the Hungarian Ministry of Education (first author). The work was started while the second author visited The Ohio State University between 1983 and 1985, and it was completed during the first author's visit to Hungary in 1985.     

Limiting behavior of certain mixtures of distributions

U — [0, 1] Y — . X=[1–U ^1/v /Y], U Y.     

On the approximation by rational combinations of a class of functions

() [0,1] — {(n)} — , +. , f(x) [0,1] () , x ₁ ,x ₂ [0, 1], (₁)=(₂), f(x ₁ )=f(x ₂ ).     

Замечания о порядке погрещности интерполяции

.      

Computation of Almost Split Sequences with Applications to Relatively Projective and Prinjective Modules

Let be an Artin algebra, let mod be the category of finitely generated -modules, and let Amod be a contravariantly finite and extension closed subcategory. For an indecomposable and not Ext-projective module CA, we compute the almost split sequence 0ABC0 in A from the almost split sequence 0DTrCEC0 in mod. Since the computation is particularly simple if the minimal right A-approximation of DTrC is indecomposable for all indecomposable and not Ext-projective CA, we manufacture subcategories A with the desired property using orthogonal subcategories. The method of orthogonal subcategories is applied to compute almost split sequences for relatively projective and prinjective modules.     

On the Growth of the Maximum of the Modulus of an Entire Function on a Sequence

Let M _f(r) and _f(r) be, respectively, the maximum of the modulus and the maximum term of an entire function f and let be a continuously differentiable function convex on (–, +) and such that x = o((x)) as x +. We establish that, in order that the equality be true for any entire function f, it is necessary and sufficient that ln (x) = o((x)) as x +.     

Asymptotic Formulae and Divisor Problems

We investigate the asymptotic behaviour of the summatory functions of _z(n, ), _k(n, ) z ⁽ⁿ⁾ and _k(n, ) z ⁽ⁿ⁾.     

On the solution of singular linear systems of algebraic equations by semiiterative methods

Summary For a square matrixT ^n,n , where (I–T) is possibly singular, we investigate the solution of the linear fixed point problemx=T x+c by applying semiiterative methods (SIM's) to the basic iterationx ₀ ⁿ ,x _k T c _k–1+c(k1). Such problems arise if one splits the coefficient matrix of a linear systemA x=b of algebraic equations according toA=M–N (M nonsingular) which leads tox=M ^–1 N x+M ^–1 bT x+c. Even ifx=T x+c is consistent there are cases where the basic iteration fails to converge, namely ifT possesses eigenvalues 1 with ||1, or if =1 is an eigenvalue ofT with nonlinear elementary divisors. In these cases — and also ifx=T x+c is incompatible — we derive necessary and sufficient conditions implying that a SIM tends to a vector which can be described in terms of the Drazin inverse of (I–T). We further give conditions under which is a solution or a least squares solution of (I–T)x=c.Research supported in part by the Alexander von Humboldt-Stiftung     

On power series with positive coefficients

M. . , . , ^p () (). , , .