Замечания о Сходкмости лагранжева интерполрования

( qP. )     

Outlines for the computation of the multiplicities of the spectra of orthogonal sums

If A and B are operators in the spaces X and Y, respectively, and if the operator B has many sets , , such that the manifolds p is a polynomial are dense in the space Y, then Here a=(the multiplicity of the spectrum of the operator A)=mindimL: span (AⁿL:n0)}=X. For example, if B=T^–g is a Toeplitz operator in the space H² with antianalytic symbol) and if g (the polynomial convex hull of the spectrum (A)) , then. Conversely, if and, then (under some assumptions on the regularity of the function f we have. One also gives examples of univalent and essentially univalent functions f (f H), for which Tf>1.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 126, pp. 150–158, 1983.     

Fortsetzungssätze und Moduln über Semifields

. . — . — —.

---

---

Herrn Professor Dr. Frank Terpe zum 60. Geburtstag gewidmet     

Pointwise convergence of multiple Fourier series using different convergence notions

, . , L ^p (²) p>1 . , C(T³), - , . - .

---

---

This work was completed while the first named author was a visiting professor at Indiana University, Bloomington, Indiana; and the second named author was a visiting professor at Ohio State University, Columbus, Ohio, U.S.A.     

Indefinite quadratic polynomials of small signature

LetF()=Q()+L() be a real quadratic polynomial with no constant term. Suppose that the quadratic partQ() is indefinite of type (r, n-r). For an integerk4 we show that if min (r, n-r) >-k there exists a functionf (n, k)=–1/2+3/(4k+2)+O _k (1/n) with the following property. For any >0 and all large enoughX there is an integer vector 0 such that || X and.     

On certain imbedding and extension theorems for a weighted class of functions

n- , S n–1 m (0m<n), () S . () , ().     

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.     

Аппроксимация субга рмонических функций

The following statement is proved. Letu be a subharmonic function in the region and _u the associated measure. Then there exists a functionf holomorphic in and such that if _f is the associated measure of the function in ¦f¦, then ¦u(z)–ln¦f(z)¦ A¦ln s¦+B¦ln diam¦+ s(¦lns¦+1)+C. hold at every point z for which the setsD(z, t)={w: ¦w–z¦},t(0,s) lie in and satisfy(D(z, t))t both for= _u and for= _f . In the case where is an unbounded region, In diam should be replaced by ln ¦z¦. The constants, , do not depend on andu.

---

---

. . .     

The martin boundary for harmonic functions on groups of automorphisms of a homogeneous tree

Consider a closed subgroup of the automorphism group of a homogeneous treeT, and assume that acts transitively on the vertex set. Suppose that is a probability measure on which has continuous density with respect to Haar measure and whose support is compact open and generates as a closed semigroup. It is shown that the Martin boundary of with respect to the random walk with law coincides with the space of ends ofT. This extends known results for free groups and applies, for example, to the affine group over a non archimedean local field.     

Decrease orders of theL p -moduli of continuity (0<p≦∞)

k — , 0<p, _k(p) — k- L _p ¹ ; >0, - , (0, ), (t)0 (t0), (t) ,t ^–(t) . _k(p), , 0<p1 _{k(p) (k– 1)p+1}, 1<p — _k , .     

On the solution of a generalized Schrödinger-type equation

Lu(t)+(u,F)g(t)=f(t), tS. , ( F, g). .

---

---

The authors wish to thank Professor Yu. A. Rozanov for his help and discussions.     

О сравнительной теории простЫх чисел

.      

Perversité et variation

Let S be the spectrum of a strictly henselian discrete valuation ring with residue characteristic p and =/, where is a prime number p and is an integer 1. For a scheme X of finite type over S and smooth over S along the special fiber X _s outside a closed point x, we study the vanishing cycles complex R() and the tame variation , for in the tame inertia group I _t . In particular, we show that if X is regular, flat over S of relative dimension n1, and is a topological generator of I _t , then R ^q () _x =0 for qn and is an isomorphism. Mathematics Subject Classification (2000):14F20, 14D05, 14D06     

The Milnor–Totaro Theorem for Space Polygons

If denotes the curvature and the torsion of a closed, generic, and oriented polygonal space curve X in , then we show that _X (² + ²) ds = _X ds + _X | | ds > 4 if is positive. We also show that _X (² + ²) ds 2n if no four consecutive vertices lie in a plane and X has linking number n with a straight line. These extend theorems of Milnor and Totaro.     

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.     

On cubature formulas on the basis of lattices

Q (.. , L). Q . P(S_r(2)) — 2 (S _r(2) (r — ). , M(P(S _r(m=sup{t(·)t(·)₁:t P(S _r(2)),t 0}. , /4+(1)M(P(S _r(2)))/r ²15/17+(1)(r+). (Q), Q L.     

Differentiation of fractional order onp-groups,approximation properties

G- p- . [5] - (G) L _r(G) (1r<), . . , - . , , , . . , X. , . (. [1], [2] [4]).     

Flowchart machines

Let denote a conventional flowchart. Any algorithm can be represented by a flowchart. If action nodes in call then is a recursive flowchart. We show how to decompose arbitrary non-self-modifying programs into structure and atomic parts. We specifically give the synthesis procedure for a controller . can serve as the only sequencer in an execution of . If is recursive then is a pushdown machine, otherwise is a finite state machine. The next-state functionf and the output functiong of represent respectively all of the structure-, i.e. the programmer-oriented-, and all of the atomic-, i.e. the data-oriented-, parts of .f defines the flow or pattern of computations andg the actual transformations or operations on data. Thus we construct and analyze programs by constructing and analyzing their sequencers .