Mass Points of Measures and Orthogonal Polynomials on the Unit Circle

Orthogonal polynomials on the unit circle are completely determined by their reflection coefficients through the Szeg recurrences. We assume that the reflection coefficients tend to some complex number a with 0<a<1. The orthogonality measure μ then lives essentially on the arc {e^it :αt2π−α} where sin with α(0,π). Under the certain rate of convergence it was proved in (Golinskii et al. (J. Approx. Theory96 (1999), 1–32)) that μ has no mass points inside this arc. We show that this result is sharp in a sense. We also examine the case of the whole unit circle and some examples of singular continuous measures given by their reflection coefficients.     

Classification Theorems for General Orthogonal Polynomials on the Unit Circle

The set of all probability measures σ on the unit circle splits into three disjoint subsets depending on properties of the derived set of {|_n|²dσ}_n0, denoted by Lim(σ). Here {_n}_n0 are orthogonal polynomials in L²(dσ). The first subset is the set of Rakhmanov measures, i.e., of σ with {m}=Lim(σ), m being the normalized (m( )=1) Lebesgue measure on . The second subset Mar( ) consists of Markoff measures, i.e., of σ with mLim(σ), and is in fact the subject of study for the present paper. A measure σ, belongs to Mar( ) iff there are >0 and l>0 such that sup{|a_n+j|:0jl}>, n=0,1,2,…,{a_n} is the Geronimus parameters (=reflectioncoefficients) of σ. We use this equivalence to describe the asymptotic behavior of the zeros of the corresponding orthogonal polynomials (see Theorem G). The third subset consists of σ with {m}Lim(σ). We show that σ is ratio asymptotic iff either σ is a Rakhmanov measure or σ satisfies the López condition (which implies σMar( )). Measures σ satisfying Lim(σ)={ν} (i.e., weakly asymptotic measures) are also classified. Either ν is the sum of equal point masses placed at the roots of zⁿ=λ, λ , n=1,2,…, or ν is the equilibrium measure (with respect to the logarithmic kernel) for the inverse image under an m-preserving endomorphism z→zⁿ, n=1,2,…, of a closed arc J (including J= ) with removed open concentric arc J₀ (including J₀=). Next, weakly asymptotic measures are completely described in terms of their Geronimus parameters. Finally, we obtain explicit formulae for the parameters of the equilibrium measures ν and show that these measures satisfy {ν}=Lim(ν).     

Renorming of and the fixed point property

For any , let P_k denote the natural projections on ℓ₁. Let |||||| be an equivalent norm of ℓ₁ that satisfies all of the following four conditions:

(1) There are α>4 and a positive (decreasing) sequence (α_n) in (0,1) such that for any normalized block basis {f_n} of (ℓ₁,||||||) and xℓ₁ with P_k−1(x)=x and |||x|||<α_k,

(2) There are two strictly decreasing sequences {β_k} and {γ_k} with

such that for any normalized block basis {f_n} of (ℓ₁,||||||) and x with (I−P_k)(x)=x,

(3) For any , I−P_k=1.

(4) The unit ball of (ℓ₁,||||||) is σ(ℓ₁,c₀)-closed.

In this article, we prove that the space (ℓ₁,||||||) has the fixed point property for the nonexpansive mapping. This improves a previous result of the author.

The eigenvalue problem for the Laplacian equations

This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω, u = 0, x ∈ (δ)Ω, where Ω (∩) Rn is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T.Yau et al.     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

A note on two fixed point problems

We extend the applicability of the Exterior Ellipsoid Algorithm for approximating n-dimensional fixed points of directionally nonexpanding functions. Such functions model many practical problems that cannot be formulated in the smaller class of globally nonexpanding functions. The upper bound 2n²ln(2/) on the number of function evaluations for finding -residual approximations to the fixed points remains the same for the larger class. We also present a modified version of a hybrid bisection-secant method for efficient approximation of univariate fixed point problems in combustion chemistry.     

A note on asymptotic behavior for negative drift random walk with dependent heavy-tailed steps and its application to risk theory

In this article, the dependent steps of a negative drift random walk are modelled as a two-sided linear process Xn =-μ ∞∑j=-∞ψn-jεj, where {ε, εn; -∞＜ n ＜ ∞}is a sequence of independent, identically distributed random variables with zero mean, μ＞0 is a constant and the coefficients {ψi;-∞＜ i ＜∞} satisfy 0 ＜∞∑j=-∞|jψj| ＜∞. Under the conditions that the distribution function of |ε| has dominated variation and ε satisfies certain tail balance conditions, the asymptotic behavior of P{supn≥0(-nμ ∞∑j=-∞εjβnj) ＞ x}is discussed. Then the result is applied to ultimate ruin probability.     

Theorems about the attractor for incompressible non-Newtonian flow driven by external forces that are rapidly oscillating in time but have a smooth average

This paper discusses the incompressible non-Newtonian fluid with rapidly oscillating external forces g(x,t)=g(x,t,t/) possessing the average g⁰(x,t) as →0⁺, where 0<₀<1. Firstly, with assumptions (A₁)–(A₅) on the functions g(x,t,ξ) and g⁰(x,t), we prove that the Hausdorff distance between the uniform attractors and in space H, corresponding to the oscillating equations and the averaged equation, respectively, is less than O() as →0⁺. Then we establish that the Hausdorff distance between the uniform attractors and in space V is also less than O() as →0⁺. Finally, we show for each [0,₀].     

The maximum asymptotic bias of S-estimates for regression over the neighborhoods defined by certain special capacities

The maximum asymptotic bias of an S-estimate for regression in the linear model is evaluated over the neighborhoods (called (c,γ)-neighborhoods) defined by certain special capacities, and its lower and upper bounds are derived. As special cases, the (c,γ)-neighborhoods include those in terms of -contamination, total variation distance and Rieder's (,δ)-contamination. It is shown that when the model distribution is normal and the (,δ)-contamination neighborhood is adopted, the lower and upper bounds of an S-estimate (including the LMS-estimate) based on a jump function coincide with the maximum asymptotic bias. The tables of the maximum asymptotic bias of the LMS-estimate are given. These results are an extension of the corresponding ones due to Martin et al. (Ann. Statist. 17 (1989) 1608), who used -contamination neighborhoods.     

Approximate range searching using binary space partitions

We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size for the segments themselves, such that the range-searching efficiency remains almost the same. We apply this technique to obtain a BSP tree of size O(nlogn) such that -approximate range searching queries with any constant-complexity convex query range can be answered in O(min_>0{(1/)+k}logn) time, where k is the number of segments intersecting the -extended range. The same result can be obtained for disjoint constant-complexity curves, if we allow the BSP to use splitting curves along the given curves.We also describe how to construct a linear-size BSP tree for low-density scenes consisting of n objects in such that -approximate range searching with any constant-complexity convex query range can be done in O(logn+min_>0{(1/^d−1)+k}) time.     

On the reducibility of a class of nonlinear quasi-periodic system with small perturbation parameter near zero equilibrium point

This work focuses on the reducibility of the following real nonlinear analytical quasiperiodic system:

where A is a real 2×2 constant matrix, and f(t,0,)=O() and ∂_xf(t,0,)=O() as →0. With some non-resonant conditions of the frequencies with the eigenvalues of A and without any nondegeneracy condition with respect to , by an affine analytic quasiperiodic transformation we change the system to a suitable norm form at the zero equilibrium for most of the sufficiently small perturbation parameter .     

A (2 + )-Approximation Scheme for Minimum Domination on Circle Graphs

The main result of this paper is a (2 + )-approximation scheme for the minimum dominating set problem on circle graphs. We first present an O(n²) time 8-approximation algorithm for this problem and then extend it to an time (2 + )-approximation scheme for this problem. Here n and m are the number of vertices and the number of edges of the circle graph. We then present simple modifications to this algorithm that yield (3 + )-approximation schemes for the minimum connected and the minimum total dominating set problems on circle graphs. Keil (1993, Discrete Appl. Math.42, 51–63) shows that these problems are NP-complete for circle graphs and leaves open the problem of devising approximation algorithms for them. These are the first O(1)-approximation algorithms for domination problems on circle graphs.     

Attractors of the reaction-diffusion systems with rapidly oscillating coefficients and their homogenization

The following reaction-diffusion system in spatially non-homogeneous almost-periodic media is considered in a bounded domain : (1)∂_tu=Au−f(u)+g, u|_∂Ω=0. Here u=(u¹,…,u^k) is an unknown vector-valued function, f is a given nonlinear interaction function and the second order elliptic operator A has the following structure: where a_ij^l(y) are given almost-periodic functions. We prove that, under natural assumptions on the nonlinear term f(u), the longtime behavior of solutions of (1) can be described in terms of the global attractor of the associated dynamical system and that the attractors  , 0<<₀1, converge to the attractor of the homogenized problem (1) as →0. Moreover, in the particular case of periodic media, we give explicit estimates for the distance between the non-homogenized and the homogenized attractors in terms of the parameter .     

Galerkin solution of a singular integral equation with constant coefficients

Galerkin methods are used to approximate the singular integral equation

with solution φ having weak singularity at the endpoint −1, where a, b≠0 are constants. In this case φ is decomposed as φ(x)=(1−x)^α(1+x)^βu(x), where β=−α, 0<α<1. Jacobi polynomials are used in the discussions. Under the conditions fH^μ[−1,1] and k(t,x)H^μ,μ[−1,1]×[−1,1], 0<μ<1, the error estimate under a weighted L² norm is O(n^−μ). Under the strengthened conditions f^″H^μ[−1,1] and , 2α−<μ<1, the error estimate under maximum norm is proved to be O(n^2α−−μ+), where , >0 is a small enough constant.     

Estimation of dimension functions of band-limited wavelets

The dimension function D_ψ of a band-limited wavelet ψ is bounded by n if its Fourier transform is supported in [−(2ⁿ⁺²/3)π,(2ⁿ⁺²/3)π]. For each and for each , 0<<δ=δ(n), we construct a wavelet ψ with supp

Full-size image

such that D_ψ>n on a set of positive measure, which proves that [−(2ⁿ⁺²/3)π,(2ⁿ⁺²/3)π] is the largest symmetric interval for estimating the dimension function by n. This construction also provides a family of (uncountably many) wavelet sets each consisting of infinite number of intervals.     

A nonlinear oblique derivative boundary value problem for the heat equation Part 2: Singular self-similar solutions

This paper continues the study started in [12]. In the upper half-plane, consider the elliptic equation

Full-size image

, submitted to the nonlinear oblique derivative boundary condition U_x = UU_z on the axis x = 0. The solution of this problem appears to be the self-similar solution of the heat equation with the same boundary condition. As goes to 0, the function U converges to the non trivial solution U of the corresponding degenerate problem. Moreover there exists z₀ > 0 such that U vanishes for z ≥ z₀, is C^∞ on ]0, z₀[× ₊, is continuous on the boundary x = 0 and is discontinuous on the half-axis {z = 0, x> 0}.     

A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Let G be an undirected graph with nonnegative edge lengths. Given two vertices as sources and all vertices as destinations, we investigated the problem how to construct a spanning tree of G such that the sum of distances from sources to destinations is minimum. In the paper, we show the NP-hardness of the problem and present a polynomial time approximation scheme. For any >0, the approximation scheme finds a (1+)-approximation solution in O(n^1/+1) time. We also generalize the approximation algorithm to the weighted case for distances that form a metric space.     

Maximal Inequalities and Lebesgue's Differentiation Theorem for Best Approximant by Constant over Balls

For fL_p( ⁿ), with 1p<∞, >0 and x ⁿ we denote by T(f)(x) the set of every best constant approximant to f in the ball B(x, ). In this paper we extend the operators T_p to the space L_p−1( ⁿ)+L_∞( ⁿ), where L₀ is the set of every measurable functions finite almost everywhere. Moreover we consider the maximal operators associated to the operators T_p and we prove maximal inequalities for them. As a consequence of these inequalities we obtain a generalization of Lebesgue's Differentiation Theorem.     

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets

Given a planar convex set C, we give sublinear approximation algorithms to determine approximations of the largest axially symmetric convex set S contained in C, and the smallest such set S^′ that contains C. More precisely, for any >0, we find an axially symmetric convex polygon QC with area |Q|>(1−)|S| and we find an axially symmetric convex polygon Q^′ containing C with area |Q^′|<(1+)|S^′|. We assume that C is given in a data structure that allows to answer the following two types of query in time T_C: given a direction u, find an extreme point of C in direction u, and given a line ℓ, find C∩ℓ. For instance, if C is a convex n-gon and its vertices are given in a sorted array, then T_C=O(logn). Then we can find Q and Q^′ in time O(^−1/2T_C+^−3/2). Using these techniques, we can also find approximations to the perimeter, area, diameter, width, smallest enclosing rectangle and smallest enclosing circle of C in time O(^−1/2T_C).     

Long time behaviour for generalized complex Ginzburg–Landau equation

In this paper, the two-dimensional generalized complex Ginzburg–Landau equation (CGL)

u_t=ρu−Δφ(u)−(1+iγ)Δu−νΔ²u−(1+iμ)|u|^2σu+αλ₁(|u|²u)+β(λ₂)|u|²