On the metric theory of the nearest integer continued fraction expansion

Supposek _n denotes either (n) or (p _n) (n=1,2,...) where the polynomial maps the natural numbers to themselves andp _k denotes thek ^th rationals prime. Also let denote the sequence of convergents to a real numberx and letc _n(x)) _n=1 be the corresponding sequence of partial quotients for the nearest integer continued fraction expansion. Define the sequence of approximation constants _n(x)) _n=1 by

On the entropic regularization method for solving min-max problems with applications

Consider a min-max problem in the form of min _xX max_1im {f _i (x)}. It is well-known that the non-differentiability of the max functionF(x) max_1im {f _i (x)} presents difficulty in finding an optimal solution. An entropic regularization procedure provides a smooth approximationF _p(x) that uniformly converges toF(x) overX with a difference bounded by ln(m)/p, forp > 0. In this way, withp being sufficiently large, minimizing the smooth functionF _p(x) overX provides a very accurate solution to the min-max problem. The same procedure can be applied to solve systems of inequalities, linear programming problems, and constrained min-max problems.This research work was supported in part by the 1995 NCSC-Cray Research Grant and the National Textile Center Research Grant S95-2.     

Solvability of a problem on the plane motion of a viscous incompressible fluid with a free noncompact boundary

One considers the problem of the plane motion of a viscous incompressible fluid which fills partially a container V, bounded by the straight line ₁ = {x:x ₂ = 0} and the contour (V₁), consisting of two semilines ⁽¹⁾ = {x:x ₁<–1,x ₂ = h₀} ⁽²⁾ = {x:x ₁ = 0,x ₂h₀+1} joined by a smooth curvel ⁽³⁾. One assumes that the motion is due to a nonzero flow and by the motion of the lower wall ₁ with a constant velocity R0. The unique solvability of this problem is proved for small R and .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 110, pp. 174–179, 1981.In conclusion, the author expresses his deep gratitude to V. A. Solonnikov for his guidance.     

Representation of numbers by integral isotropic quadratic forms

Under certain assumptions, we prove that the integral points (x₁,x₂,x₃) ³ with g.c.d. (x₁,x₂,x₃)=1 are asymptotically uniformly distributed on the surface of the two-sheeted hyperboloid t(x₁,x₂,x₃)=m, where f is an isotropic quadratic form over , for given modulus g. This is a generalization of the results of Linnik [3] and Pachev [4].Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 151, pp. 66–67, 1986.I would like to thank A. V. Malyshev for suggesting the problem and for his support.     

Similar regions in the problem of comparing the location parameters of two exponential distributions with unknown variances

Let and be two independent repeated samples from distributions with densities and where p(x)=0 for x<0, and p(x)=e^–x for x0. The problem of similar regions for testing the null hypothesis H₀a₁=a₂ is studied on the assumption that the positive parameters and are unknown.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 43, pp. 6–14, 1974.     

On bounds for the range of ordered variates II

Letx ₁, ,x _n be real numbers with ₁ ⁿ x _j =0, |x ₁ ||x ₂ ||x _n |, and ₁ ⁿ f(|x _i |)=A>0, wheref is a continuous, strictly increasing function on [0, ) withf(0)=0. Using a generalized Chebycheff inequality (or directly) it is easy to see that an upper bound for |x _m | isf ^–1 (A/(n–m+1)). If (n–m+1) is even, this bound is best possible, but not otherwise. Best upper bounds are obtained in case (n–m+1) is odd provided either (i)f is strictly convex on [0, ), or (ii)f is strictly concave on [0, ). Explicit best bounds are given as examples of (i) and (ii), namely the casesf(x)=x ^p forp>1 and 0<p<1 respectively.     

Extended iterative methods for the solution of operator equations

Summary Given an iterative methodM ₀, characterized byx ^(k+1=G ₀(x( ^k )) (k0) (x(⁰) prescribed) for the solution of the operator equationF(x)=0, whereF:XX is a given operator andX is a Banach space, it is shown how to obtain a family of methodsM _p characterized byx ^(k+1=G _p (x( ^k )) (k0) (x(⁰) prescribed) with order of convergence higher than that ofM _o. The infinite dimensional multipoint methods of Bosarge and Falb [2] are a special case, in whichM ₀ is Newton's method.Analogues of Theorems 2.3 and 2.36 of [2] are proved for the methodsM _p, which are referred to as extensions ofM ₀. A number of methods with order of convergence greater than two are discussed and existence-convergence theorems for some of them are proved.Finally some computational results are presented which illustrate the behaviour of the methods and their extensions when used to solve systems of nonlinear algebraic equations, and some applications currently being investigated are mentioned.     

Complete asymptotic expansions for the two-sample problem

Let x₁, x₂,...,x_n and y₁, y₂,...,y_n be the results of two series of independent observations. Let us denote by F_{R 1} (x) and G_{R 2} (y) the empirical distribution functions constructed on the basis of the first and the second sample, respectively. Let us write This paper deals with a complete asymptotic expansion, for the case n₁=n, n₂=np, n of the probability in a power series 1/n, where p1 is a fixed integer, and ₁>0 and ₂> 0 are fixed positive numbers.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 53, pp. 4–53, 1975.     

Optimization of a convex program with a polynomial perturbation

We consider the problem of minimizing a convex function plus a polynomial p over a convex body K. We give an algorithm that outputs a solution x whose value is within range_K(p) of the optimum value, where range_K(p)=sup_xKp(x)−inf_xKp(x). When p depends only on a constant number of variables, the algorithm runs in time polynomial in 1/, the degree of p, the time to round K and the time to solve the convex program that results by setting p=0.     

Toeplitz operators with symbols from in the spaces

It is shown that the algebra of the multipliers of the space ^p (1<<) contains the closed subalgebra C_p+H _p , which coincides with the Douglas algebra C + H for =2. It is proved that a Toeplitz operator with symbol from C_p+H _p is Fredholm on ^p if and only if its symbol is invertible in C_p+H _p .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 157, pp. 124–128, 1987.The authors are grateful to V. I. Vasyunin for assistance.     

Complexity of the realization of a linear function in the class of II-circuits

It is proved that the linear function gn(x₁,..., x_n) = x₁ + ... + x_nmod 2 is realized in the class of II-circuits with complexity L(g_n) n². Combination of this result with S. V. Yablonskii's upper bound yields L(g_n) n².Translated from Matematicheskie Zametki, Vol. 9, No. 1, pp. 35–40, January, 1971.     

Compressing Mappings on Primitive Sequences over Z/(2) and Its Galois Extension

Let f(x) be a strongly primitive polynomial of degree n over Z/(2^e), η(x₀,x₁,…,x_e−2) a Boolean function of e−1 variables and (x₀,x₁,…,x_e−1)=x_e−1+η(x₀,x₁,…,x_e−2)G (f(x),Z/(2^e)) denotes the set of all sequences over Z/(2^e) generated by f(x), F₂^∞ the set of all sequences over the binary field F₂, then the compressing mapping

Full-size image

is injective, that is, for , G(f(x),Z/(2^e)), = if and only if Φ( )=Φ( ), i.e., ( ₀,…, _e−1)=( ₀,…, _e−1) mod 2. In the second part of the paper, we generalize the above result over the Galois rings.     

Arithmetic Interpretability Types of Varieties and Some Additive Problems with Primes

We deal with varieties with one basic operation f(x₁,...,x_n) and one defining identity f(x₁,..., x_n) = f(x_π(1),...,x_π(n)), where π is a permutation whose cyclic set consists of distinct primes p₁,...,p_r, with the sum p₁+...+p_r = n. Their interpretability types, together with the greatest element 1 in a lattice ^int, are said to be arithmetic. It is proved that the arithmetic types constitute a distributive lattice _ar, which is dual to a lattice Sub _fΠ of finite subsets of the set Π of all primes. It is shown that for n ⩾ 2, the poset _ar( _n) of arithmetic types defined by permutations in _n, for n fixed, is a lattice iff n = 2, 3, 4, 6, 8, 9, 11. __________ Translated from Algebra i Logika, Vol. 44, No. 5, pp. 622–630, September–October, 2005.     

Ein konvergentes Iterationsverfahren zur Bestimmung der Nullstellen eines Polynoms

Summary In order to determine the roots of a polynomialp, a sequence of numbers {x _k} is constructed such that the associated sequence {|p(x _k)|} decreases monotonically. To determine a new iteration pointx _k+1 such that |p(x _k+1)|<-|p(x _k)| ( is a positive real constant, <1, depending only on the degree ofp), we determine a circleK aroundx _k which contains no root ofp and compute the values ofp atN points which are distributed equally on the circumference ofK (N again depends only on the degree ofp); at least one of theN points is shown to satisfy the given condition. Computing the function values by means of Fourier synthesis according to Cooley-Tukey [2] and combining our iteration step with the normal step of the method of Nickel [1], we obtain a numerically safe and fast algorithm for determining the roots of arbitrary polynomials.     

On the parity of the partition function

Let N be the set of all positive integers and D a subset of N. Let p(D,n) be the number of partitions of n with parts in D and let |D(x)| denote the number of elements of D not exceeding x. It is proved that if D is an infinite subset of N such that p(D,n) is even for all n?n₀, then |D(x)|?logx/log2−logn₀/log2. Moreover, if D is an infinite subset of N such that p(D,n) is odd for all n?n₀ and , then |D(x)|?logx/log2−logn₀/log2. These lower bounds are essentially the best possible.     

On the period five trichotomy of all positive solutions of xn+1=(p+xn−2)/xn

We study the behavior of all positive solutions of the difference equation in the title, where p is a positive real parameter and the initial conditions x₋₂,x₋₁,x₀ are positive real numbers. For all the values of the positive parameter p there exists a unique positive equilibrium x? which satisfies the equation

     

Monotone method for singular BVP in the presence of upper and lower solutions

In this paper we examine existence of monotone approximations of solutions of singular boundary value problem -(p(x)y^′(x))^′=q(x)f(x,y,py^′) for 0<x?b and lim_x→0⁺p(x)y^′(x)=0,α₁y(b)+β₁p(b)y^′(b)=γ₁. Under quite general conditions on f(x,y,py^′) we show that solution of the singular two point boundary value problem is unique. Here is allowed to have integrable singularity at x=0 and we do not assume .     

On types of distributions of sums of one class of random power series with independent identically distributed coefficients

By using the method of characteristic functions, we obtain sufficient conditions for the singularity of a random variable.

Contingent Derivatives of Implicit (Multi-) Functions and Stationary Points

For an implicit multifunction (p) defined by the generally nonsmooth equation F(x,p)=0, contingent derivative formulas are derived, being similar to the formula =–F _x ^–1 F _p in the standard implicit function theorem for smooth F and . This will be applied to the projection X(p)={xy: (x,y)(p)} of the solution set (p) of the system F(x,y,p)=0 onto the x-space. In particular settings, X(p) may be interpreted as stationary solution sets. We discuss in detail the situation in which X(p) arises from the Karush–Kuhn–Tucker system of a nonlinear program.     

The Logarithmic Frequency of Values of Additive Functions

We consider the weak convergence of distribution functions (_mx 1/ m)^-1 _{m x},f_x(m)x is a set (x 2) of strongly additive functions such that f_x(p){0,1} for each prime number p.