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.     

A graded scale of parametric families of distributions,and parameter estimates based on the sample mean

Summary Denote by _k a class of familiesP={P} of distributions on the line R¹ depending on a general scalar parameter , being an interval of R¹, and such that the moments µ₁()=xdP ,...,µ_2k ()=x ^2k dP are finite, ₁ (), ..., _k (), _k+1 () ..., _k () exist and are continuous, with ₁ () 0, and _j +1 ()= ₁ () _j () +[₂() -₁()²] _j ()/ ₁ (), J=2, ..., k. Let ₁=¯x=x ₁ + ... +x _n/n, ₂=x ₁ ² + ... +x _n ²/n, ..., _k =(x ₁ ^k + ... +x _n ^k/n denote the sample moments constructed for a sample x₁, ..., x_n from a population with distribution Pg. We prove that the estimator of the parameter by the method of moments determined from the equation ₁= ₁() and depending on the observations x₁, ..., x_n only via the sample mean ¯x is asymptotically admissible (and optimal) in the class _k of the estimators determined by the estimator equations of the form ₀ () + ₁ () ₁ + ... + _k () _k =0 if and only ifP _k .The asymptotic admissibility (respectively, optimality) means that the variance of the limit, as n (normal) distribution of an estimator normalized in a standard way is less than the same characteristic for any estimator in the class under consideration for at least one 9 (respectively, for every ).The scales arise of classes _{1 2}... of parametric families and of classes _{1 2} ... of estimators related so that the asymptotic admissibility of an estimator by the method of moments in the class _k is equivalent to the membership of the familyP in the class _k .The intersection consists only of the families of distributions with densities of the form h(x) exp {C₀() + C₁() x } when for the latter the problem of moments is definite, that is, there is no other family with the same moments ₁ (), ₂ (), ...Such scales in the problem of estimating the location parameter were predicted by Linnik about 20 years ago and were constructed by the author in [1] (see also [2, 3]) in exact, not asymptotic, formulation.Translated from Problemy Ustoichivosti Stokhasticheskikh Modelei, pp. 41–47, 1981.     

On Sums of Projections

In the paper, for all n, we describe the set _n of all real numbers admitting a collection of projections P ₁,...,P _n on a Hilbert space H such that _k=1 ⁿ P _k= I (I is the identity operator on H) and study the problem to find all collections of this kind for a given _n .     

Perfect splines of least uniform deviation

(v _k) ₁ ⁿ , 1v _kr, v₁+...+v_n r, p(;r) — =(x ₁,v ₁),...,(x _n,v _n), v _1+...+v _n-r ^(r(;·)=1. , (^*;t) [, ] (;t) _{x 1}<... n v ₁ ...,v _n. (^*;t) .     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

The Lattice of Interpretability Types of Cantor Varieties

For integers 1 m < n, a Cantor variety with m basic n-ary operations _i and n basic m-ary operations _k is a variety of algebras defined by identities _k(₁( ), ... , _m( )) = _k and i(₁( ), ... ,_n( )) = y _i, where = (x ₁., ... , x _n) and = (y ₁, ... , y _m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product ₁ × ₂ of a lattice, ₁, of positive integers respecting the natural linear ordering and a lattice, ₂, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.     

Estimation of the Intensity of the Flow of Nonmonotone Refusals in the Queuing System (≤ λ)/G/m

We consider a queuing system ()/G/m, where the symbol () means that, independently of prehistory, the probability of arrival of a call during the time interval dtdoes not exceed dt. The case where the queue length first attains the level r m+ 1 during a busy period is called the refusal of the system. We determine a bound for the intensity ₁(t) of the flow of homogeneous events associated with the monotone refusals of the system, namely, ₁(t) = O( ^{r+ 1}₁ ^{m– 1} _{r– m+ 1}), where _k is the kth moment of the service-time distribution.     

Random reals and the relation 171-1171-1171-1

It is consistent that ₁(₁,(:n))² holds in any random extension for n finite and countable.     

The random-cluster model on the complete graph

Summary The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph onn vertices, then the associated processes are called mean-field. In this study of the mean-field random-cluster model with parametersp=/n andq, we show that its properties for any value ofq(0, ) may be derived from those of an Erds-Rényi random graph. In this way we calculate the critical point _c (q) of the model, and show that the associated phase transition is continuous if and only ifq2. Exact formulae are given for _C (q), the density of the largest component, the density of edges of the model, and the free energy. This work generalizes earlier results valid for the Potts model, whereq is an integer satisfyingq2. Equivalent results are obtained for a fixed edge-number random-cluster model. As a consequence of the results of this paper, one obtains large-deviation theorems for the number of components in the classical random-graph models (whereq=1).     

Generalized theorems of Liénard and Shepherd

The paper considers a real polynomial p(x)=₀+₁x+...+_nxⁿ(₀ > 0) for which there hold inequalities ₁>0, ₃>0, ... or ₂>0, ₄>0, ..., where ₁, ₂, ..., _jn are the Hurwitz determinants for polynomial p(x). It is proven that polynomial p(x) can have, in the right half-plane, only real roots, where the quantity of positive roots of polynomial p(x) equals the quantity of changes of sign in the system of coefficients a₀, a₂, ..., a_n–2, a_n, when n is even, and ₀, a₂,..., a_n–1, a_n, when n is odd. From the proven theorem, in particular, there follows the Liénard and Shepherd criterion of stability.Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 13–21, July, 1977.     

The Szlenk index and local ℓ<Subscript>1</Subscript>-indices

We introduce two new local ₁-indices of the same type as the Bourgain ₁-index; the ⁺₁-index and the ⁺₁-weakly null index. We show that the ⁺₁-weakly null index of a Banach space X is the same as the Szlenk index of X, provided X does not contain ₁. The ⁺₁-weakly null index has the same form as the Bourgain ₁-index: if it is countable it must take values for some <₁. The different ₁-indices are closely related and so knowing the Szlenk index of a Banach space helps us calculate its ₁-index, via the ⁺₁-weakly null index. We show that I(C(^{))=^1++1}.     

A functional inequality for real-analytic functions

Summary Forf ( C ⁿ() and 0 t x letJ _n (f, t, x) = (–1)ⁿ f(–x)f ⁽ⁿ⁾(t) +f(x)f ⁽ⁿ⁾ (–t). We prove that the only real-analytic functions satisfyingJ _n (f, t, x) 0 for alln = 0, 1, 2, are the exponential functionsf(x) = c e ^x,c, . Further we present a nontrivial class of real-analytic functions satisfying the inequalitiesJ ₀ (f, x, x) 0 and ₀ ^x (x – t)^{n – 1}J_n(f, t, x)dt 0 (n 1).     

Absolute values of the coefficients of the polynomials in Weierstrass's approximation theorem

The following problem, bound up with Weierstrass's classical approximation theorem, is solved definitively: to determine the sequence of positive numbersM _k such that, for anyf(z)c[0,1] and > 0 there exists the polynomial that f–P< and _k <M _k ,k=1, ...,n.Translated from Matematicheskii Zametki, Vol. 22, No. 2, pp. 269–276, August, 1977.     

Remarks on ergodicity of stationary irreducible transient Markov chains

Summary Consider a stationary process {X _n(), – < n < . If the measure of the process is finite (the measure of the whole sample space finite), it is well known that ergodicity of the process {X _n(), - < n < and of each of the subprocesses {X _n(), 0 n < , {X _n(), – < n 0 are equivalent (see [3]). We shall show that this is generally not true for stationary processes with a sigma-finite measure, specifically for stationary irreducible transient Markov chains. An example of a stationary irreducible transient Markov chain {X _n(), - < n <} with {itX_n(), 0 n < < ergodic but {X _n(), < n 0 nonergodic is given. That this can be the case has already been implicitly indicated in the literature [4]. Another example of a stationary irreducible transient Markov chain with both {X _n(), 0 n < and {itX _n(),-< < n 0} ergodic but {X _n(), - < n < nonergodic is presented. In fact, it is shown that all stationary irreducible transient Markov chains {X _n(), - < n < < are nonergodic.This research was supported in part by the Office of Naval Research.John Simon Guggenheim Memorial Fellow.     

Perturbation of the Laplacian by the Coulomb potential and a point interaction in L p (ℝ)3

Perturbations of -+/|x| (with >0) by a point interaction centered at zero are defined in L ^p(³). This is done for 3/20 (³{0}), such that the extension is the negative generator of an analytic semigroup on L ^p(³).     

Über einen Satz von Shl. Sternberg in der Theorie der analytischen Iterationen

Let X=X ₁,...,X _n be the ring of formal power series inn indeterminates over . LetF:XAX+B(X)=(F ⁽¹⁾(X),...,F ⁽ⁿ⁾(X))(X) ⁿ denote an automorphism of X and let ₁,..., _n be the eigenvalues of the linear partA ofF. We will say thatF has an analytic iteration (a. i.) if there exists a family (F _t (itX)) _t of automorphisms such thatF _t(X) has coefficients analytic int and such thatF ₀=X,F ₁=F,F _t+t=F_tF_t for allt,t. Let now a set=(ln₁,...,ln _n ) of determinations of the logarithms be given. We ask if there exists an a. i. ofF such that the eigenvalues of the linear partA(t) ofF _t(X) are . We will give necessary and sufficient conditions forF to have such an a. i., namely thatF is conjugate to a semicanonical formN=T ^–1FT such that inN ^(k)(X) there appear at most monomialsX ₁ ¹ ...X _n ⁿ . This generalizes a result of Shl.Sternberg.

---

---

Herrn Prof. Dr. E. Hlawka zum 60. Geburtstag gewidmet     

On feasible sets defined through Chebyshev approximation

LetZ be a compact set of the real space with at leastn + 2 points;f,h1,h2:Z continuous functions,h1,h2 strictly positive andP(x,z),x(x ₀,...,x _n ) ⁿ⁺¹,z , a polynomial of degree at mostn. Consider a feasible setM {x ⁿ⁺¹z Z, –h ₂(z) P(x, z)–f(z)h ₁(z)}. Here it is proved the null vector 0 of ⁿ⁺¹ belongs to the compact convex hull of the gradients ± (1,z,...,z ⁿ ), wherez Z are the index points in which the constraint functions are active for a givenx* M, if and only ifM is a singleton.This work was partially supported by CONACYT-MEXICO.     

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.     

Regularity of ∫Ω|∇u|2 + λ∫Ω|u−f{2 and some gap phenomenon

We study the regularity of the minimizer u for the functional F (u,f)=|u|² + |u–f{² over all maps uH ¹(, S ²). We prove that for some suitable functions f every minimizer u is smooth in if ₀ and for the same functions f, u has singularities when is large enough.

---

Résumé On étudie la régularité des minimiseurs u du problème de minimisation min_ueH ¹(,S²)(|u|² + |u–f{². On montre que pour certaines fonctions f, u est régulière lorsque ₀ et pour les mêmes f, si est assez grand, alors u possède des singularités.