Limiting behavior of weighted central paths in linear programming

We study the limiting behavior of the weighted central paths{(x(), s())} > 0 in linear programming at both = 0 and = . We establish the existence of a partition (B ,N ) of the index set { 1, ,n } such thatx _i() ands _j () as fori B , andj N , andx _N (),s _B () converge to weighted analytic centers of certain polytopes. For allk 1, we show that thekth order derivativesx ^(k) () ands ^(k) () converge when 0 and . Consequently, the derivatives of each order are bounded in the interval (0, ). We calculate the limiting derivatives explicitly, and establish the surprising result that all higher order derivatives (k 2) converge to zero when .     

Inadmissibility and admissibility results for unbiased loss estimators based on gauss-markov estimators

LetY be distributed according to ann-variate normal distribution with a meanX and a nonsingular covariance matrix ² V, where bothX andV are known, R ^p is a parameter, > 0 is known or unknown. Denote and . Assume thatF is linearly estimable. When is known, it is proved that the unbiased loss estimator ²tr(F(XV ^–1 X)^– F) of is admissible for rank (F)=k4 and inadmissible fork 5 with the squared error loss . When is unknown and rank (X) <n, it is established that the loss estimatorcS ², wherec is any nonnegative constant, of is inadmissible and that the unbiased loss estimator tr(F(XV ^–1 X)^– F) of is admissible fork 4, and inadmissible fork 5 with squared error loss.This project is supported by the National Natural Science Foundation of China.     

G8 estimator of solutions of systems of linear algebraic equations

For linear forms of regularized solutions (x, c)=Re c' · Re[I + i)+A'A_n ^–1]^–1 A'_nb of systems of equations Ax=b, where A is an n×m matrix, x, c, b are vectors, and _n is a sequence of constants, we propose the estimator , where is any measurable solution of the equation ()Re[1+₁a(())]²+ (₁–₂)(1+₁(gq()))=, a(y)=n^–1 Sp[Iy+^–1Z_s'Z^s+ iI]^–1, , _i=n_n ²_n ^–1s_n ^–1, ⁿ=mI_n ²_n ^–1s_n ^–1, X_i are independent observations on the matrix A. Under certain conditions, it is proved that G₈ is a consistent estimator for n and 0.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 66, pp. 111–119, 1988.     

Steepest Descent with Curvature Dynamical System

Let H be a real Hilbert space and let <..,.> denote the corresponding scalar product. Given a function that is bounded from below, we consider the following dynamical system:

Nuclei of point sets of sizeq+1 contained in the union of two lines inPG(2,q)

We give a complete classification for pairs ( (),) where () is the set of all nuclei of a set ofq+1 not collinear points contained in the union of two lines in a desarguesian planePG(2,q) of orderq. We also obtain some new results concerning blocking sets of Rédei type and certain point-sets of type [0,1,m,n] inPG(2, q).     

Sur les Mesures Simultanement Invariantes Pour les Transformations x » {λx} ET x » {βx}

We show that for reasonable couples of Pisot number and , there is no measure simultaneously invariant by the two transformations of [0, 1], x {x} and x {x}, and Bernoulli (or weak Bernoulli) for one of the transformations.     

Kolmogorov-Type Inequalities for Periodic Functions Whose First Derivatives Have Bounded Variation

We obtain a new unimprovable Kolmogorov-type inequality for differentiable 2-periodic functions x with bounded variation of the derivative x, namely

On the circles of Apollonius associated with a triangle

Given a ratio , >>0, and a triangle ABC, on the sides and , using ratios , and , three circles of Apollonius are denned. In this paper, we will show that the three centers are collinear, the circles are coaxal and develop a necessary and sufficient condition that these circles intersect. J. A. Hoskins, W. D. Hoskins and R. G. Stanton obtained these results in a recent paper using algebraic computation. Our aim is to establish all these results using only results from elementary Euclidean geometry and thereby uncovering more geometric insights and avoid lengthy calculations.     

Feynman-Kac propagators and viscosity solutions

The aim of this paper is to study viscosity solutions to the following terminal value problem on [0, t] × E:

An Erdős-Révész type law of the iterated logarithm for stationary Gaussian processes

Summary Let {X(t),t 0} be a stationary Gaussian process withEX(t)=0,EX ²(t)=1 and covariance function satisfying (i)r(t) = 1 2212;C |t | + o (|t|)ast0 for someC>0, 0<2; (ii)r(t)=0(t ^–2) as t for some >0 and (iii) sup_ts|r(t)|<1 for eachs>0. Put (t)= sup {s:0 s t,X(s) (2logs)^1/2}. The law of the iterated logarithm implies a.s. This paper gives the lower bound of (t) and obtains an Erds-Rèvèsz type LIL, i.e., a.s. if 0<<2 and . Applications to infinite series of independent Ornstein-Uhlenbeck processes and to fractional Wiener processes are also given.Research supported by the Fok Yingtung Education Foundation of China and by Charles Phelps Taft Postdoctoral Fellowship of the University of Cincinnati     

On the Solvability and Asymptotics of Solutions of One Functional Differential Equation with Singularity

We prove the existence of continuously differentiable solutions with required asymptotic properties as t +0 and determine the number of solutions of the following Cauchy problem for a functional differential equation:

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

On sequences of Dirichlet polynomials uniformly bounded on half planes

Given and a sequence of Dirichlet polynomials estimates for the coefficientsa _n are proved if {_n} is uniformly bounded on a region containing a half plane. Thereby a result is obtained which is an analogue of a known result for polynomials, that is for theA-transforms of the geometric sequence; moreover a Jentzsch type theorem for {_n(z)} is derived.     

Theorems on Lower Semicontinuity and Relaxation for Integrands with Fast Growth

We prove theorems on the lower semicontinuity and integral representations of the lower semicontinuous envelopes of integral functionals with integrands L of fast growth: c ₁ G(|Du|) + c ₂ L c ₃ G(|Du|) + c ₄ with c ₃ c ₁ > 0 and G : [0, [ [0, [ is an increasing convex function such that vG (v)/G(v) as v and is increasing for large v. Repeating the results for the case of the standard growth (G() = ||^p) the quasiconvexity of integrands characterizes the lower semicontinuity of integral functionals and their quasiconvexifications yield the integral functionals that are lower semicontinuous envelopes.Original Russian Text Copyright © 2005 Sychev M. A.The author was supported by the Russian Foundation for Basic Research (Grant 03-01-00162).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 679–697, May–June, 2005.     

Order of the best spline approximations of some classes of functions

The rate of decrease of the upper bounds of the best spline approximations E_m,n(f)p with undetermined n nodes in the metric of the space L_p(0, 1) (1p) is studied in a class of functionsf(x) for which f ^m+1 (x)L_q(0, 1)1(1qt8) or var {f(m) (x); 0, 1}1 (m=1, 2, ..., the preceding derivative is assumed absolutely continuous). An exact order of decrease of the mentioned bounds is found as n , and asymptotic formulas are obtained for p= and 1q in the case of an approximation by broken lines (m=1). The simultaneous approximation of the function and its derivatives by spline functions and their appropriate derivatives is also studied.Translated from Matematicheskie Zametki, Vol. 7, No. 1, pp. 31–42, January, 1970.     

Nonnegative Hall Polynomials

The number of subgroups of type and cotype in a finite abelian p-group of type is a polynomialg with integral coefficients. We prove g has nonnegative coefficients for all partitions and if and only if no two parts of differ by more than one. Necessity follows from a few simple facts about Hall-Littlewood symmetric functions; sufficiency relies on properties of certain order-preserving surjections that associate to each subgroup a vector dominated componentwise by . The nonzero components of (H) are the parts of , the type of H; if no two parts of differ by more than one, the nonzero components of – (H) are the parts of , the cotype of H. In fact, we provide an order-theoretic characterization of those isomorphism types of finite abelian p-groups all of whose Hall polynomials have nonnegative coefficients.     

Estimation of a K-Functional of Higher Order in Terms of a K-Functional of Lower Order

Let U _j be a finite system of functionals of the form , and let be the subspace of the Sobolev space , 1 p +, that consists only of functions g such that U _j(g) = 0 for k _j < r. It is assumed that there exists at least one jump _j for every function _j , and if _j = _s for j s, then k _j k _s. For the K-functional

Resonance in Preisach Systems

This paper deals with the asymptotic behavior as t of solutions u to the forced Preisach oscillator equation where is a Preisach hysteresis operator, L (0, ) is a given function and t 0 is the time variable. We establish an explicit asymptotic relation between the Preisach measure and the function (or, in a more physical terminology, a balance condition between the hysteresis dissipation and the external forcing) which guarantees that every solution remains bounded for all times. Examples show that this condition is qualitatively optimal. Moreover, if the Preisach measure does not identically vanish in any neighbourhood of the origin in the Preisach half-plane and , then every bounded solution also asymptotically vanishes as t .     

Distribution of the number of nonappearing lengths of cycles in a random mapping

One-to-one random mappings of the set 1, 2,..., n onto itself are considered. Limit theorems are proved for the quantities _i, 0in, max _i, min _i, where _i is the number of 0in components of the vector ( ₁, ₂,..., _n) which are equal to i, 0< i< n, and ar is the number of components of dimension r of the random mapping.Translated from Matematicheskle Zametki, Vol. 23, No. 6, pp. 895–898, June, 1978.The author is grateful to V. P. Chistyakov and V. E. Stepanov for many useful remarks.     

The Boundary Equivalence for Rings and Matrix Rings over Them

We study into the question of whether some rings and their associated matrix rings have equal decidability boundaries in the scheme and scheme-alternative hierarchies. Let be a decidability boundary for an algebraic system A; w.r.t. the hierarchy H. For a ring R, denote by an algebra with universe . On this algebra, define the operations + and in such a way as to extend, if necessary, the initial matrices by suitably many zero rows and columns added to the underside and to the right of each matrix, followed by ordinary addition and multiplication of the matrices obtained. The main results are collected in Theorems 1-3. Theorem 1 holds that if R is a division or an integral ring, and R has zero or odd characteristic, then the equalities hold for any n1. And if R is an arbitrary associative ring with identity then for any n 1 and i,j { 1,..., n}, where e _ij is a matrix identity. Theorem 2 maintains that if R is an associative ring with identity then . Theorem 3 proves that for any n 1.