Distribution density of the norm of a stable vector

Let B be a Banach space,X be a stable B -valued random vector with exponentd(0,2), and P(·) be the distribution density of the norm of X. In this paper we study the question of the boundedness of P. In particular, we construct examples of a space B with a symmetric stable vector X with exponentd(1,2) with unbounded P and prove that if X is a nondegenerate strictly stable vector with exponentd(0,1), then P is bounded.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 158, pp. 105–114, 1987.The author is grateful to Yu. A. Davydov, V. I. Paulauskas, V. Yu. Bentkus, and D. Pap for stimulating discussions of the subject of this paper. When the paper was finished the author learned that similar results are found in [9].     

A perturbation result for the asymptotic behavior of matrix powers

We prove a perturbation result for the asymptotic behavior of the sequence (A ⁿ c) _nN , whereAG|(d), the space of invertibled×d matrices, andc ^d .     

Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations

Summary We introduce a class of n×n structured matrices which includes three well-known classes of generalized companion matrices: tridiagonal plus rank-one matrices (comrade matrices), diagonal plus rank-one matrices and arrowhead matrices. Relying on the structure properties of , we show that if A then A=RQ , where A=QR is the QR decomposition of A. This allows one to implement the QR iteration for computing the eigenvalues and the eigenvectors of any A with O(n) arithmetic operations per iteration and with O(n) memory storage. This iteration, applied to generalized companion matrices, provides new O(n²) flops algorithms for computing polynomial zeros and for solving the associated (rational) secular equations. Numerical experiments confirm the effectiveness and the robustness of our approach.The results of this paper were presented at the Workshop on Nonlinear Approximations in Numerical Analysis, June 22 – 25, 2003, Moscow, Russia, at the Workshop on Operator Theory and Applications (IWOTA), June 24 – 27, 2003, Cagliari, Italy, at the Workshop on Numerical Linear Algebra at Universidad Carlos III in Leganes, June 16 – 17, 2003, Leganes, Spain, at the SIAM Conference on Applied Linear Algebra, July 15 – 19, 2003, Williamsburg, VA and in the Technical Report [8]. This work was partially supported by MIUR, grant number 2002014121, and by GNCS-INDAM. This work was supported by NSF Grant CCR 9732206 and PSC CUNY Awards 66406-0033 and 65393-0034.     

Efficient construction of a small hitting set for combinatorial rectangles in high dimension

We describe a deterministic algorithm which, on input integersd, m and real number (0,1), produces a subset S of [m] ^d ={1,2,3,...,m} ^d that hits every combinatorial rectangle in [m] ^d of volume at least , i.e., every subset of [m] ^d the formR ₁×R ₂×...×R _d of size at least m ^d . The cardinality of S is polynomial inm(logd)/, and the time to construct it is polynomial inmd/. The construction of such sets has applications in derandomization methods based on small sample spaces for general multivalued random variables.A preliminary version of this paper appeared in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.Research partially done while visiting the International Computer Science Institute. Research supported in part by a grant from the Israel-USA Binational Science Foundation.A large portion of this research was done while still at the International Computer Science Institute in Berkeley, California. Research supported in part by National Science Foundation operating grants CCR-9304722 and NCR-9416101, and United States-Israel Binational Science Foundation grant No. 92-00226.Supported in part by NSF under grants CCR-8911388 and CCR-9215293 and by AFOSR grants AFOSR-89-0512 AFOSR-90-0008, and by DIMACS, which is supported by NSF grant STC-91-19999 and by the New Jersey Commission on Science and Technology. Research partially done while visiting the International Computer Science Institute.Partially supported by NSF NYI Grant No. CCR-9457799. Most of this research was done while the author was at MIT, partially supported by an NSF Postdoctoral Fellowship. Research partially done while visiting the International Computer Science Institute.     

Durchschnitte von Pjateckij-Shapiro-Folgen

The distribution of integers and prime numbers in sequences of the formF _c1F _c2 is investigated. HereF _c={[_n ^c]:n } withc>1.     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

A White Noise Approach to Stochastic Neumann Boundary-Value Problems

We illustrate the use of white noise analysis in the solution of stochastic partial differential equations by explicitly solving the stochastic Neumann boundary-value problem LU(x)–c(x)U(x)=0, xDR ^d ,(x)U(x)=–W(x), xD, where L is a uniformly elliptic linear partial differential operator and W(x), xR ^d , is d-parameter white noise.     

p-Frames in Separable Banach Spaces

Let X be a separable Banach space with dual X ^*. A countable family of elements {g _i }X ^* is a p-frame (1 p ) if the norm _X is equivalent to the ^p -norm of the sequence {g _i ()}. Without further assumptions, we prove that a p-frame allows every gX ^* to be represented as an unconditionally convergent series g=d _i g _i for coefficients {d _i } ^q , where 1/p+1/q=1. A p-frame {g _i } is not necessarily linear independent, so {g _i } is some kind of overcomplete basis for X ^*. We prove that a q-Riesz basis for X ^* is a p-frame for X and that the associated coefficient functionals {f _i } constitutes a p-Riesz basis allowing us to expand every fX (respectively gX ^*) as f=g _i (f)f _i (respectively g=g(f _i )g _i ). In the general case of a p-frame such expansions are only possible under extra assumptions.     

The Whitehead Group of the Novikov Ring

The Bass–Heller–Swan–Farrell–Hsiang–Siebenmann decomposition of the Whitehead group K ₁(A[z,z^-1]) of a twisted Laurent polynomial extension A[z,z^-1] of a ring A is generalized to a decomposition of the Whitehead group K ₁(A((z))) of a twisted Novikov ring of power series A((z))=A[[z]][z^-1]. The decomposition involves a summand W₁(A, ) which is an Abelian quotient of the multiplicative group W(A,) of Witt vectors 1+a₁z+a₂z²+ ··· A[[z]]. An example is constructed to show that in general the natural surjection W(A, )^ab W₁(A, ) is not an isomorphism.     

A Class of Iterative Algorithms and Solvability of Nonlinear Variational Inequalities Involving Multivalued Mappings

The solvability of the following class of nonlinear variational inequality (NVI) problems based on a class of iterative procedures, which possess an equivalence to a class of projection formulas, is presented.Determine an element x ^* K and u ^* T(x ^*) such that u ^*, x – x ^* 0 for all x K where T: K P(H) is a multivalued mapping from a real Hilbert space H into P(H), the power set of H, and K is a nonempty closed convex subset of H. The iterative procedure adopted here is represented by a nonlinear variational inequality: for arbitrarily chosen initial points x ⁰, y ⁰ K, u ⁰ T(y ⁰) and v ⁰ T(x ⁰), we have u ^k + x ^k+1 – y ^k , x – x ^k+1 0, x K, for u ^k T(y ^k ) and for k 0where v ^k + y ^k – x ^k , x – y ^k 0, x K and for v ^k T(x ^k ).     

On a Property of Subexponential Distributions

Let F be a distribution function (d.f.) on [0, ) with finite first moment m >0. We define the integrated tail distribution function F ₁ of F by F ₁(t)=m^-1 ₀ ^t (1- F(u))du, t0. In this paper, we obtain sufficient conditions under which implications FSF ₁S and F ₁S FS hold, where S is the class of subexponential distributions.     

Generalized sequencing problem “Towers of Hanoi”

ForpN certain integer-valued functionsA _p (x), defined forx N {0}, are studied. These functions occur in a functional equation system corresponding to a generalized version of the transportation game Towers of Hanoi and their values may be interpreted as minimum numbers of moves. An explicit representation ofA _p (x) is given and so-called minimum partitions ofx with respect top are determined for allx N. The minimum partitions ofx are of interest concerning the realisation of the minimum number of moves by optimal policies.

---

Zusammenfassung Es werden fürp N gewisse ganzzahlige für allex N {0} erklärte FunktionenA _p (x) untersucht, die bei einer Verallgemeinerung des unter dem Namen Türme zu Hanoi bekannten Transportspiels in einem entsprechenden Funktionalgleichungssystem auftreten und deren Funktionswerte sich als Mindestzugzahlen interpretieren. Es werden fürA _p (x) eine explizite Darstellung und sogenannte Minimalzerlegungen vonx bezüglichp für allex N bestimmt. Die Minimalzerlegungen vonx spielen eine besondere Rolle bei der Angabe von optimalen Strategien zur Realisierung der Mindestzugzahl.

     

Galerkin methods for parabolic equations with nonlinear boundary conditions

A variety of Galerkin methods are studied for the parabolic equationu _t =(a(x) u),x ⁿ ,t (O,T], subject to the nonlinear boundary conditionu _v =g(x,t,u),x,t (O,T] and the usual initial condition. Optimal order error estimates are derived both inL ² () andH ¹ () norms for all methods treated, including several that produce linear computational procedures.The authors were partially supported by The National Science Foundation during the preparation of this paper.     

On Gauss quadrature formulas with equal weights

Summary It is well known that the Chebyshev weight function (1–x ²)^–1/2 is the only weight function (up to a linear transformation) for which then point Gauss quadrature formula has equal weights for alln. In this paper we describe all weight functions for which thenm point Gauss quadrature formula has equal weights for alln, wherem is fixed.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

L p Spectral Independence of Elliptic Operators via Commutator Estimates

Let {T _p:q ₁ p q ₂} be a family of consistent C ₀ semigroups on L ^p(), with q ₁,q ₂ [1,) and open. We show that certain commutator conditions on T _p and on the resolvent of its generator A _p ensure the p independence of the spectrum of A _p for p [q ₁,q ₂.Applications include the case of Petrovskij correct systems with Hölder continuous coefficients, Schrödinger operators, and certain elliptic operators in divergence form with real, but not necessarily symmetric, or complex coefficients.     

RC *-fields

It is stated that if a Boolean family W of valuation rings of a field F satisfies the block approximation property (BAP) and a global analog of the Hensel-Rychlick property (THR), in which case F, W is called an RC^*-field, then F is regularly closed with respect to the family W (The-orem 1). It is proved that every pair F, W, where W is a weakly Boolean family of valuation rings of a field F, is embedded in the RC^*-field F₀, W₀ in such a manner that R₀ R₀ F, R₀ W₀ is a continuous map, W₀ is homeomorphic over W to a given Boolean space, and R₀ is a superstructure of R₀ F for every R₀ W₀ (Theorem 2).Translated fromAlgebra i Logika, Vol. 33, No. 4, pp. 367–386, July-August, 1994.     

The cross-section body, plane sections of convex bodies and approximation of convex bodies, I

For a convex body K ^d we investigate three associated bodies, its intersection body IK (for 0int K), cross-section body CK, and projection body IIK, which satisfy IKCKIIK. Conversely we prove CKconst₁(d)I(K–x) for some xint K, and IIKconst₂ (d)CK, for certain constants, the first constant being sharp. We estimate the maximal k-volume of sections of 1/2(K+(-K)) with k-planes parallel to a fixed k-plane by the analogous quantity for K; our inequality is, if only k is fixed, sharp. For L ^d a convex body, we take n random segments in L, and consider their Minkowski average D. We prove that, for V(L) fixed, the supremum of V(D) (with also nN arbitrary) is minimal for L an ellipsoid. This result implies the Petty projection inequality about max V((IIM)*), for M ^d a convex body, with V(M) fixed. We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, the volumes of sections of convex bodies and the volumes of sections of their circumscribed cylinders. For fixed n, the pth moments of V(D) (1p<) also are minimized, for V(L) fixed, by the ellipsoids. For k=2, the supremum (nN arbitrary) and the pth moment (n fixed) of V(D) are maximized for example by triangles, and, for L centrally symmetric, for example by parallelograms. Last we discuss some examples for cross-section bodies.Research (partially) supported by Hungarian National Foundation for Scientific Research, Grant No. 41.