The embedding of linearly ordered sets

It is shown that if a linearly ordered set B does not contain as subsets sets of order type and ^* then B can be embedded in 2 . We construct an example of a set satisfying the above conditions which cannot be embedded in any 2 if < . Simultaneously we show that for any ordinal, 2 ⁺¹ cannot be embedded in 2 and that there exists at least ₊₁ distinct dense order types of cardinality 2 .Translated from Matematicheskie Zametki, Vol. 11, No. 1, pp. 83–88, January, 1972.In conclusion, I wish to take the opportunity to thank Yu. L. Ershov for kindness and assistance in this work.     

Inner functions and related spaces of pseudocontinuable functions

Let be an inner function, let C, ¦¦=1. Then the harmonic function [(+)]/(–)] is the Poisson integral of a singular measure D. N. Clark's known theorem enables us to identify in a natural manner the space H² H² with the space L² ( ).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 7–33, 1989.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

Some Area-Diameter Inequalities for Two-Dimensional Lattices

We obtain some inequalities concerning area and diameter of planar convex sets verifying the assumptions of Minkowski's Theorem, establishing the best possible upper bounds for the ratio A/D, (0,2], and for A/D when some lattice points are included.     

Convex independent sets and 7-holes in restricted planar point sets

For a finite setA of points in the plane, letq(A) denote the ratio of the maximum distance of any pair of points ofA to the minimum distance of any pair of points ofA. Fork>0 letc (k) denote the largest integerc such that any setA ofk points in general position in the plane, satisfying for fixed , contains at leastc convex independent points. We determine the exact asymptotic behavior ofc (k), proving that there are two positive constants=(), such thatk ^1/3c (k)k ^1/3. To establish the upper bound ofc (k) we construct a set, which also solves (affirmatively) the problem of Alonet al. [1] about the existence of a setA ofk points in general position without a 7-hole (i.e., vertices of a convex 7-gon containing no other points fromA), satisfying . The construction uses Horton sets, which generalize sets without 7-holes constructed by Horton and which have some interesting properties.     

On monotone and convex approximation by algebraic polynomials

The following results are obtained: If >0, 2, [3, 4], andf is a nondecreasing (convex) function on [–1, 1] such thatE _n (f) n ^– for any n>, then E _n ⁽¹⁾ (f)Cn ^– (E _n ⁽²⁾ (f)Cn ^–) for n>, where C=C(), E_n(f) is the best uniform approximation of a continuous function by polynomials of degree (n–1), and E _n ⁽¹⁾ (f) (E _n ⁽²⁾ (f)) are the best monotone and convex approximations, respectively. For =2 ( [3, 4]), this result is not true.Published in Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 9, pp. 1266–1270, September, 1994.     

A cutting plane algorithm for convex programming that uses analytic centers

Anoracle for a convex setS ⁿ accepts as input any pointz in ⁿ , and ifz S, then it returns yes, while ifz S, then it returns no along with a separating hyperplane. We give a new algorithm that finds a feasible point inS in cases where an oracle is available. Our algorithm uses the analytic center of a polytope as test point, and successively modifies the polytope with the separating hyperplanes returned by the oracle. The key to establishing convergence is that hyperplanes judged to be unimportant are pruned from the polytope. If a ball of radius 2^–L is contained inS, andS is contained in a cube of side 2 ^L+1, then we can show our algorithm converges after O(nL ²) iterations and performs a total of O(n ⁴ L ³+TnL ²) arithmetic operations, whereT is the number of arithmetic operations required for a call to the oracle. The bound is independent of the number of hyperplanes generated in the algorithm. An important application in which an oracle is available is minimizing a convex function overS. Supported by the National Science Foundation under Grant CCR-9057481PYI.Supported by the National Science Foundation under Grants CCR-9057481 and CCR-9007195.     

Patching ideal families on℘ kλ

Ideal families defined on a cardinalk often exhibit reflection properties. IfC k is a club, for example, thenC is a club-in- club-in-k often. In this paper we generalize this notion to ideal families defined on _k and exhibit some examples.     

Some Classes of L 1-Convergence of Fourier Series

In this paper equivalent classes of the classes M and S _pr , p > 1, > 0. r { 0,1,2, ... ,[]} defined by Shuyun [3] are obtained. Then, it is shown that the class S _pr , 1 > p 2, 0, r {0,1,2,...,[]} is a subclass of BVC _r , where S _pr is the equivalent class of the Shuyun's class S _pr , BV is the class of null sequences of bounded variation and C _r is the extension of the Garrett--Stanojevic class. As a corollary of this result, we have obtained the theorem, proved in [7].     

Fredholm integro-differential equation

We consider numerical solution of an integro-differential equation with nonsmooth initspaial values. Unique solvability in Sobolev spaceW ₂ (0, 1), =1,2, is proved. We establish the rate of convergence of the approximate solution to the exact solution in fractional spacesW ₂ ⁺¹ , 01, with approximation order O(h ^++1/2 ) for 01/2 andO(h ⁺¹ |ln h|1/2, for 1/2 #x2264;1.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 64, pp. 8–16, 1988.     

Sur la convergence presque sure,au sens de Cesaro d'ordre α, 0<α<1, de variables aléatoires indepéndantes et identiquement distribuées

Summary We prove the following theorem: «Given 0<1, the (C, )-means of a sequence of i.i.d. random variables X _n converge a.s. iff E|X _n|^1/<.» For 1/2<1 and 0<<1/2 this result is essentially known. We give here a proof of the case =1/2; an important tool is a theorem of Hsu and Robbins [5].     

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

The evolution of a population for a certain viability system

Summary For the Fisher-Wright-Haldane selection model with fitness parametersf _ij =1+ _{i ij} ( _i –1) a complete global analysis is performed.

---

Zusammenfassung Für das Fisher-Wright-Haldane-Selektionsmodell mit den Fitneßparameternf _ij =1+ _{i ij} ( _i –1) wird eine vollständige globale Analyse, durchgeführt.

     

Admissibility of unbiased tests for a composite hypothesis with a restricted alternative

This paper discusses -admissiblility and d-admissiblity which are important concepts in studying the performance of statistical tests for composite hypotheses. A sufficient condition for -admissibility is presented. When =1/m, the Nomakuchi-Sakata test, which is uniformly more powerful than the likelihood ratio test for hypotheses min (₁, ₁) = 0 versus min (₁, ₁) > 0, is generalized for a class of distributions in an exponential family, and its unbiasedness and -admissibility are shown. Finally, the case of 1/m is discussed in brief.     

A Complete Metric in the Function Space D α[0,∞)

Subspaces D of D[0,1] and of D[0,) are defined. With constructed metrics d , D are shown to be complete separable metric spaces. Conditions for tightness of probability measures in D are given.     

On the complexity of following the central path of linear programs by linear extrapolation II

A class of algorithms is proposed for solving linear programming problems (withm inequality constraints) by following the central path using linear extrapolation with a special adaptive choice of steplengths. The latter is based on explicit results concerning the convergence behaviour of Newton's method to compute points on the central pathx(r), r>0, and this allows to estimate the complexity, i.e. the total numberN = N(R, ) of steps needed to go from an initial pointx(R) to a final pointx(), R>>0, by an integral of the local weighted curvature of the (primal—dual) path. Here, the central curve is parametrized with the logarithmic penalty parameterr0. It is shown that for large classes of problems the complexity integral, i.e. the number of stepsN, is not greater than constm log(R/), where < 1/2 e.g. = 1/4 or = 3/8 (note that = 1/2 gives the complexity of zero order methods). We also provide a lower bound for the complexity showing that for some problems the above estimation can hold only for 1/3.As a byproduct, many analytical and structural properties of the primal—dual central path are obtained: there are, for instance, close relations between the weighted curvature and the logarithmic derivatives of the slack variables; the dependence of these quantities on the parameterr is described. Also, related results hold for a family of weighted trajectories, into which the central path can be embedded.On leave from the Institute of Mathematics, Eötvös University Budapest, H-1080 Budapest, Hungary.     

Growth of length of sequential derivation transformed into natural one

We consider the (&, )-fragment of the intuitionistic propositional calculus. It is proved that under the standard transformation of a Gentzen derivation into a natural derivation(), the length of (())2^2·length( ). There is constructed a sequence of Gentzen derivations of length _i, for which the length of (( _i))2^{1/3·length(i}), which shows that the upper bound obtained is not too weak.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 192–196, 1979.     

Untere und obere Schranken für den tiefsten Eigenwert der elastisch gestützten Membran

Zusammenfassung Es werden untere und obere Schranken für den tiefsten Eigenwert ₁() der elastisch gestützten schwingenden Membran hergeleitet. Die elastische Bindung der Membran am Rande wird durch charakterisiert, und wird als Parameter betrachtet.Die Verwendung des klassischen Rayleigh-Prinzipes liefert obere Schranken, mit Hilfe eines konvexen FunktionalsJ() erhält man obere und untere Schranken. Eine Zerlegungsmethode endlich gibt eine untere Schranke für ₁().

---

Summary This article is concerned with the determination of upper and lower bounds for the lowest eigenvalue ₁() of the elastically supported vibrating membrane. The elastic support on the boundary is characterized by which is regarded as a parameter.The classical Rayleigh-Principle gives upper bounds. The use of a convex functionalJ() yields upper and lower bounds for ₁(). A method of decomposition leads to a lower bound for ₁().

---

---

Neu-Technikum, Buchs SG     

A relationship between the Mahler measure and the discriminant of algebraic numbers

In this note we show that in the well-known Dobrowolski estimate lnM() (ln lnd/ lnd)3,d , where is a nonzero algebraic number of degreed that is not a root of unity andM() is its Mahler measure, the parameterd can be replaced by the quantity=d/() ^1/d, where () is the modulus of the discriminant of. To this end, must satisfy the condition deg ^p=deg for any primep.Translated fromMatematicheskie Zametki, Vol. 59, No. 3, pp. 415–420, March, 1996.     

On the Uniform Summability of Multiple Walsh-Fourier Series

In this paper we prove that if f C (0, 1 ^N ) and the function f is of bounded partial variation, then the N-dimensional Walsh-Fourier series of the function f is uniformly (C,–) summable (₁ +...+ _N < 1, _i > 0, i = 1,...,N) in the sense of Pringsheim. If ₁ +...+ _N = 1, _i > 0, i = 1,2,...,N, then there exists a continuous function f ₀ of bounded partial variation on [0, 1] ^N such that the Cesàro (C,–) means _m ^– (f₀,Õ) of the N-dimensional Walsh-Fourier series of f ₀ diverge over cubes.