Description of Hyperinvariant Subspaces of a Contraction in Terms of Its Characteristic Function

If T is a completely nonunitary contraction on a Hilbert space and L is its invariant subspace corresponding to a regular factorization of its characteristic function = , then L is hyperinvariant if and only if the following two conditions are fulfilled: (1) supp _* supp is of Lebesgue measure zero; (2) for every pair A H (E E) and A _* H (E _* E _*) intertwining by , i.e., such that A =A _*, there exists a function A _F H (F F) intertwining with A by and with A _* by , i.e., such that A = A _F and A _F = A _*. Bibliography: 4 titles.     

The existence of probability measures with specified projections

Let X and Y be locally compact-compact topological spaces, F X×Y is closed, and P(F) is the set of all Borel probability measures on F. For us to find, for the pair of probability measures (_x, _y P (X)×P(Y), a probability measure P(F) such that _X = _X ^–1 , _Y = _Y ^–1 it is necessary and sufficient that, for any pair of Borel sets A X, B Y for which (A× B) F=Ø, the condition _XA+ _YB 1 holds.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 573–576, October, 1973.     

On the domain of attraction of an operator between supremum and sum

Summary Between the operations which produce partial maxima and partial sums of a sequenceY ₁,Y ₂, ..., lies the inductive operation:X _n =X _n-1(X _n-1+Y _n ),n1, for 0<<1. If theY _n are independent random variables with common distributionF, we show that the limiting behavior of normed sequences formed from {X _n ,n1}, is, for 0<<1, parallel to the extreme value case =0. ForFD() we give a full proof of the convergence, whereas forFD()D(), we only succeeded in proving tightness of the involved sequence. The processX _n is interesting for some applied probability models.     

On the complexity of four polyhedral set containment problems

A nonempty closed convex polyhedronX can be represented either asX = {x: Ax b}, where (A, b) are given, in which caseX is called anH-cell, or in the formX = {x: x = U + V, _j = 1, 0, 0}, where (U, V) are given, in which caseX is called aW-cell. This note discusses the computational complexity of certain set containment problems. The problems of determining if , where (i)X is anH-cell andY is a closed solid ball, (ii)X is anH-cell andY is aW-cell, or (iii)X is a closed solid ball andY is aW-cell, are all shown to be NP-complete, essentially verifying a conjecture of Eaves and Freund. Furthermore, the problem of determining whether there exists an integer point in aW-cell is shown to be NP-complete, demonstrating that regardless of the representation ofX as anH-cell orW-cell, this integer containment problem is NP-complete.     

Doubly stochastic measures with prescribed support

Summary Denote the set of doubly stochastic measures on the unit square X ×X that are supported on the graphs of measurable maps L,HXX by (L, H). Conditions are given that imply that (L, H) is a singleton. Since (L, H) is in any event a (possibly empty) extremal subset of the set of all doubly stochastic measures on X×X, our results are intimately related to the problem of describing the supports of the extreme points of .     

Functional Approach of Large Deviations in General Spaces

Let X be a topological space, ( ) a net of Borel probability measures on X, and (t) a net in ]0,[ converging to 0. Let be a set of continuous functions such that for all x X that can be suitably distinguished by some continuous functions from any closed set not containing contains such a distinguishing function. Assuming that exists for all , we give a sufficient condition in order that ( ₎ satisfies a large deviation principle with powers (t₎ and not necessary tight rate function. When X is completely regular (not necessary Hausdorff), this condition is also necessary, and so strictly weaker than exponential tightness; this allows us to strengthen Brycs theorem in various ways. We give the general form of a rate function in terms of . A Prohorov-type theorem with a weaker notion than exponential tightness is obtained, which improves known results.     

Multi-Faithful Spanning Trees of Infinite Graphs

For an end and a tree T of a graph G we denote respectively by m() and m _T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m _T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m _T () = f() for every end of G.     

Аппроксимация субга рмонических функций

The following statement is proved. Letu be a subharmonic function in the region and _u the associated measure. Then there exists a functionf holomorphic in and such that if _f is the associated measure of the function in ¦f¦, then ¦u(z)–ln¦f(z)¦ A¦ln s¦+B¦ln diam¦+ s(¦lns¦+1)+C. hold at every point z for which the setsD(z, t)={w: ¦w–z¦},t(0,s) lie in and satisfy(D(z, t))t both for= _u and for= _f . In the case where is an unbounded region, In diam should be replaced by ln ¦z¦. The constants, , do not depend on andu.

---

---

. . .     

An algorithm for nondifferentiable optimization

In this paper, we give an implementable algorithm for minimizing a locally Lipschitz function without constraints, and prove the global convergence under the -acute angle condition.     

Logarithms and imaginary powers of closed linear operators

The imaginary powersA ^it of a closed linear operatorA, with inverse, in a Banach spaceX are considered as aC ₀-group {exp(itlogA);t R} of bounded linear operators onX, with generatori logA. Here logA is defined as the closure of log(1+A) – log(1+A ^–1). LetA be a linearm-sectorial operator of typeS(tan ), 0(/2), in a Hilbert spaceX. That is, |Im(Au, u)| (tan )Re(Au, u) foru D(A). Then ±ilog(1+A) ism-accretive inX andilog(1+A) is the generator of aC ₀-group {(1+A) ^it ;t R} of bounded imaginary powers, satisfying the estimate (1+A) ^it exp(|t|),t R. In particular, ifA is invertible, then ±ilogA ism-accretive inX, where logA is exactly given by logA=log(1+A)–log(1+A ^–1), and {A ^it;t R} forms aC ₀-group onX, with the estimate A ^it exp(|t|),t R. This yields a slight improvement of the Heinz-Kato inequality.     

A Distortion Theorem for Univalent Gap Series

We prove a distortion theorem for conformal mappings of the unit disk for which log f is representable as the Hadamard gap series. This theorem implies in particular that such conformal mapping is almost bounded, i.e., for every >0, there is a positive constant C such that |f,(z)|C (1–|z|) ^–.     

On Bahadur asymptotic efficiency in a semiparametric regression model

ＯＮＢＡＨＡＤＵＲＡＳＹＭＰＴＯＴＩＣＥＦＦＩＣＩＥＮＣＹＩＮＡＳＥＭＩＰＡＲＡＭＥＴＲＩＣＲＥＧＲＥＳＳＩＯＮＭＯＤＥＬＬＩＡＮＧＨＵＡ（梁华）;ＣＨＥＮＧＰＩＮＧ（成平）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ,ｔｈｅＣｈｉｎｅｓｅＡ...     

The free loop space and the algebraic k-theory of spaces

Let A(X) be the space defined by Waldhausen whose homotopy groups define the algebraic K-groups of the space X and let . Here (X) denotes the free loop space of X and Q denotes the functor . For X = Y, the suspension of a connected space Y, we shall prove that the homotopy fibers Ã(X), B(X) of the maps A(X) A (point), B(X) B (point) are equivalent as infinite loop spaces.     

Distribution of the supremum of sums of independent variables with negative drift

Let {_n} be a sequence of identically distributed independent random variables,M₁=<0,M ₁ ² <;S ₀=0,S _n =₁+₂,+...+ _{n, n}1;¯ S=sup {S _n n=0.} The asymptotic behavior ofP(¯ St) as t is studied. If _t ^P (₁x dx=0((t)), thenP(¯ St)– 1/¦¦ _t P (₁x dx=0((t)) (t) is a positive function, having regular behavior at infinity.Translated from Matematicheskie Zametki, Vol. 22, No. 5, pp. 763–770, November, 1977.The author thanks B. A. Rogozin for the formulation of the problem and valuable remarks.     

Noncommutative Valuation Rings of the Quotient Artinian Ring of a Skew Polynomial Ring

Let R be a Dubrovin valuation ring of a simple Artinian ring Q and let Q[X,] be the skew polynomial ring over Q in an indeterminate X, where is an automorphism of Q. Consider the natural map from Q[X,]_XQ[X,] to Q, where Q[X,]_XQ[X,] is the localization of Q[X,] at the maximal ideal XQ[X,] and set , the complete inverse image of R by . It is shown that is a Dubrovin valuation ring of Q(X,) (the quotient ring of Q[X,]) and it is characterized in terms of X and Q. In the case where R is an invariant valuation ring, the given automorphism is classified into five types, in order to study the structure of (the value group of ). It is shown that there is a commutative valuation ring R with automorphism which belongs to each type and which makes Abelian or non-Abelian. Furthermore, some examples are used to show that several ideal-theoretic properties of a Dubrovin valuation ring of Q with finite dimension over its center, do not necessarily hold in the case where Q is infinite-dimensional. Presented by A. VerschorenMathematics Subject Classifications (2000) 16L99, 16S36, 16W60.     

A free convenient vector space for holomorphic spaces

In this paper we show that there exists a free convenient vector space for the case of holomorphic spaces and holomorphic maps. This means that for every spaceX with a holomorphic structure, there exists an appropriately complete locally convex vector space X and a holomorphic mapl _X:XX, such that for any vector space of the same kind the map (l _X )^*:L(X,E)(X,E) is a bijection. Analogously to the smooth case treated in [2, 5.1.1] the free convenient vector space X can be obtained as the Mackey closure of the linear subspace spanned by the image of the canonical mapX(X).In the second part of the paper we prove that in the case whereX is a Riemann surface, one hasX=(X,).     

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.     

Speed of convergence as a function of given accuracy for random search methods

The essence of this article lies in a demonstration of the fact that for some random search methods (r.s.m.) of global optimization, the number of the objective function evaluations required to reach a given accuracy may have very slow (logarithmic) growth to infinity as the accuracy tends to zero. Several inequalities of this kind are derived for some typical Markovian monotone r.s.m. in metric spaces including thed-dimensional Euclidean space ^d and its compact subsets. In the compact case, one of the main results may be briefly outlined as a constructive theorem of existence: if is a first moment of approaching a good subset of-neighbourhood ofx ₀=arg maxf by some random search sequence (r.s.s.), then we may choose parameters of this r.s.s. in such a way that E c(f) In² . Certainly, some restrictions on metric space and functionf are required.     

Quadratic-Cycloidal Curves

Interesting curves can be represented in the space Q=span{1,t,t ²,cost,sint}, t[0,] (0<<2). In this paper we introduce quadratic-cycloidal B-splines associated to equally spaced knots and the properties of the generated curves for 0<<. It is proved that, when 0, the limit of a QC-B-spline curve approaches a B-spline curve of degree 4.     

The Maximum Box Problem and its Application to Data Analysis

Given two finite sets of points X ⁺ and X ^– in ⁿ , the maximum box problem consists of finding an interval (box) B = {x : l x u} such that B X ^– = , and the cardinality of B X ⁺ is maximized. A simple generalization can be obtained by instead maximizing a weighted sum of the elements of B X ⁺. While polynomial for any fixed n, the maximum box problem is -hard in general. We construct an efficient branch-and-bound algorithm for this problem and apply it to a standard problem in data analysis. We test this method on nine data sets, seven of which are drawn from the UCI standard machine learning repository.