A geometric property of extremal surfaces

Let the surface R³ be defined by the equation z = f(x, y), where f(x, y) is a function 3 times continuously differentiable in R². It is proved that if the total (Gaussian) curvature of the surface is nonzero almost everywhere on in the sense of Lebesgue measure in R²), then is extremal, i.e., for almost all (x,y) R² the inequality max (||qx||, ||qy, qf (x, y)) > q^–1/s–. holds for all integral q qo (f), where x is the distance from the real number x to the nearest integer and > 0 is arbitrarily small.Translated from Matematicheskie Zametki, Vol. 23, No. 2, pp. 177–181, February, 1978.In conclusion, the author thanks V. G. Sprindzhuk for suggesting the problem.     

Polynomial Wavelet-Type Expansions on the Sphere

We present a polynomial wavelet-type system on S ^d such that any continuous function can be expanded with respect to these wavelets. The order of the growth of the degrees of the polynomials is optimal. The coefficients in the expansion are the inner products of the function and the corresponding element of a dual wavelet system. The dual wavelets system is also a polynomial system with the same growth of degrees of polynomials. The system is redundant. A construction of a polynomial basis is also presented. In contrast to our wavelet-type system, this basis is not suitable for implementation, because, first, there are no explicit formulas for the coefficient functionals and, second, the growth of the degrees of polynomials is too rapid.     

On the Operator Semirings of a Γ-Semiring

In this paper we introduce the notion of operator semirings of a -semiring to study -semirings. It is shown that the lattices of all left (right) ideals (two-sided ideals) of a -semiring and its right (respectively left) operator semiring are isomorphic. This has many applications to characterize various -semirings.AMS Subject Classification (2000): 16Y60, 16Y99     

A proof for Theodorus' theorem by drawing diagrams

Summary In Plato's dialogue Theaetetus, the mathematician Theodorus (ca. 470-400 BC) is said to have proved the irrationality of 3, 5, ..., 17 by drawing diagrams. In this paper such a proof is presented and compared with another, more arithmetical, reconstructed proof by W. Knorr. Moreover a hypothetical early theory of similar rectangles is extracted from Euclid's Elements, which could have served as a basis for the geometrical proof of Theodorus' theorem.Herrn N. Stephanidis in Freundschaft gewidmet     

Limit theorems for multitype continuous time Markov branching processes

Summary Let X(t)=(X ₁ (t), X ₂ (t), , X _t (t)) be a k-type (2k<) continuous time, supercritical, nonsingular, positively regular Markov branching process. Let M(t)=((m _ij (t))) be the mean matrix where m _ij (t)=E(X _j (t)¦X _r (0)= _ir for r=1, 2, , k) and write M(t)=exp(At). Let be an eigenvector of A corresponding to an eigenvalue . Assuming second moments this paper studies the limit behavior as t of the stochastic process . It is shown that i) if 2 Re >₁, then · X(t)e{–t¦ converges a.s. and in mean square to a random variable. ii) if 2 Re ₁ then [ · X(t)] f(v · X(t)) converges in law to a normal distribution where f(x)=(x) ^–1 if 2 Re <₁ and f(x)=(x log x)^–1 if 2 Re =₁, ₁ the largest real eigenvalue of A and v the corresponding right eigenvector.Research supported in part under contracts N0014-67-A-0112-0015 and NIH USPHS 10452 at Stanford University.     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

Colouring a graph frugally

We prove that any graph with maximum degree sufficiently large, has a proper vertex colouring using +1 colours such that each colour class appears at most log⁸ times in the neighbourhood of any vertex. We also show that for 1, the minimum number of colours required to colour any such graph so that each vertex appears at most times in the neighbourhood of any vertex is (+^1+1//), showing in particular that when =log/loglog, such a colouring cannot always be achieved with O() colours. We also provide a polynomial time algorithm to find such a colouring. This has applications to the total chromatic number of a graph.The second two authors were supported by NATO Collaborative Research Grant #CRG950235.     

On an application of infinitely divisible distributions to quadrature problems

— - , .     

Harmonic measure of continua with a fixed diameter

Let be the family of all continua E in , where U={¦z¦ < 1}, let U(E) be the connected component of UE containing the point z=0, let w_E(z₀=w(z₀, E, U(E)) be the harmonic measure of E relative to the domain U(E) at the point z₀ U(E). In the paper one answers affirmatively a question raised by B. Rodkin [K. F. Barth, D. A. Branna, and W. K. Hayman, Research problems in complx analysis, Bull. London Math. Soc.,l6, No. 5, 490–517, 1984]. Namely, one proves that in the family (d₀) of continua E , satisfying the condition diam E=d₀,o<d₀2, one has the inequality arcsin d₀/2, one indicates all the cases for which equality prevails.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 146–148, 1985.     

About generalized ideals in a distributive lattice

Let L be a distributive lattice characterized by a ternary operation (, ,), where (a,b,c)=(ab)(bc)(ac)=(ab)(ac)(bc), a,b,cL. The note considers convex sublattices of L, called generalized ideals of L generated by the operation (, ,). Some remarks have been stated about the graph of a distributive lattice.     

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.     

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

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

On strong summability of multiple Fourier series and smoothness properties of functions

_n —n- — ƒ()L _v (T _n ), 1f, - -. -.     

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

.      

‘Outside’ as a primitive notion in constructive projective geometry

In intuitionistic (or constructive) geometry there are positive counterparts, apart and outside, of the relations = and incident. In this paper it is shown that the relation outside suffices to define incident, apart and equality. The equivalence of the new system with Heyting's system is shown and as a simple corollary one obtains duality for intuitionistic projective geometry.     

Идеологиыеское знаыение геометрии бояи—лобаыевского

... , , . ( ) , , . (. )     

Zeros in tables of characters for the groups Sn and An

In the representation theory of symmetric groups, for each partition of a natural number n, the partition h() of n is defined so as to obtain a certain set of zeros in the table of characters for S_n. Namely, h() is the greatest (under the lexicographic ordering ) partition among P(n) such that (g) 0. Here, is an irreducible character of S_n, indexed by a partition , and g is a conjugacy class of elements in S_n, indexed by a partition . We point out an extra set of zeros in the table that we are dealing with. For every non self-associated partition P(n), the partition f() of n is defined so that f() is greatest among the partitions of n which are opposite in sign to h() and are such that (g) 0 (Thm. 1). Also, for any self-associated partition of n > 1, we construct a partition () P(n) such that () is greatest among the partitions of n which are distinct from h() and are such that (g) 0 (Thm. 2).Supported by RFBR grant No. 04-01-00463 and by RFBR-BRFBR grant No. 04-01-81001.Translated from Algebra i Logika, Vol. 44, No. 1, pp. 24–43, January–February, 2005.     

Approximating derivations on ideals ofC *-algebras

For each^*-derivation of a separableC ^*-algebraA and each >0 there is an essential idealI ofA and a self-adjoint multiplierx ofI such that (–ad(ix))|I< and x.     

О Сходимости Лагранжева Интерполирования В Некоторых Множествах Функций

.      

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.