On the Denseness of Rational Systems

This note characterizes the denseness of rational systems

Full-size image

in C[−1, 1], where the nonreal poles in {a_k}^∞_k=1 \[−1, 1] are paired by complex conjugation. This extends an Achiezer's result.     

On constants in some inequalities for intermediate derivatives on a finite interval

Let L_q (1q<∞) be the space of functions f measurable on I=[−1,1] and integrable to the power q, with normL_∞ is the space of functions measurable on I with normWe denote by AC the set of all functions absolutely continuous on I. For nN, q[1,∞] we setW_n,q={f:f⁽ⁿ⁻¹⁾AC, f⁽ⁿ⁾L_q}.In this paper, we consider the problem of accuracy of constants A, B in the inequalities (1)|| f^(m)||_qA|| f||_p+B|| f^(m+k+1)||_r, mN, kW; p,q,r[1,∞], fW_m+k+1,r.     

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.     

Local Accuracy for Radial Basis Function Interpolation on Finite Uniform Grids

We consider interpolation on a finite uniform grid by means of one of the radial basis functions (RBF) φ(r)=r^γ for γ>0, γ2 or φ(r)=r^γ ln r for γ2 ₊. For each positive integer N, let h=N⁻¹ and let {x_i: i =1, 2, …, (N+1)^d} be the set of vertices of the uniform grid of mesh-size h on the unit d-dimensional cube [0, 1]^d. Given f: [0, 1]^d→ , let s_h be its unique RBF interpolant at the grid vertices: s_h(x_i)=f(x_i), i=1, 2, …, (N+1)^d. For h→0, we show that the uniform norm of the error f−s_h on a compact subset K of the interior of [0, 1]^d enjoys the same rate of convergence to zero as the error of RBF interpolation on the infinite uniform grid h ^d, provided that f is a data function whose partial derivatives in the interior of [0, 1]^d up to a certain order can be extended to Lipschitz functions on [0, 1]^d.     

A pointwise convergence for Sobolev space functions

Let 1<p<∞, and k,m be positive integers such that 0(k−2m)pn. Suppose ΩRⁿ is an open set, and Δ is the Laplacian operator. We will show that there is a sequence of positive constants c_j such that for every f in the Sobolev space W^k,p(Ω), for all xΩ except on a set whose Bessel capacity B_k−2m,p is zero.     

Strong bias of group generators: an obstacle to the “product replacement algorithm”

Let G be a finite group. Efficient generation of nearly uniformly distributed random elements in G, starting from a given set of generators of G, is a central problem in computational group theory. In this paper we demonstrate a weakness in the popular “product replacement algorithm,” widely used for this purpose. The main results are the following. Let be the set of generating k-tuples of elements of G. Consider the distribution of the first components of the k-tuples in induced by the uniform distribution over  . We show that there exist infinite sequences of groups G such that this distribution is very far from uniform in two different senses: (1) its variation distance from uniform is >1−ε; and (2) there exists a short word (of length (loglog|G|)^O(k)) which separates the two distributions with probability 1−ε. The class of groups we analyze is direct powers of alternating groups. The methods used include statistical analysis of permutation groups, the theory of random walks, the AKS sorting network, and a randomized simulation of monotone Boolean operations by group operations, inspired by Barrington's work on bounded-width branching programs. The problem is motivated by the product replacement algorithm which was introduced in [Comm. Algebra 23 (1995) 4931–4948] and is widely used. Our results show that for certain groups the probability distribution obtained by the product replacement algorithm has a bias which can be detected by a short straight line program.     

Zeros of orthogonal polynomials on the real line

Let p_n(x) be the orthonormal polynomials associated to a measure dμ of compact support in . If Esupp(dμ), we show there is a δ>0 so that for all n, either p_n or p_n+1 has no zeros in (E−δ,E+δ). If E is an isolated point of supp(μ), we show there is a δ so that for all n, either p_n or p_n+1 has at most one zero in (E−δ,E+δ). We provide an example where the zeros of p_n are dense in a gap of supp(dμ).     

Julia Sets of Certain Exponential Functions

We characterize the Julia sets of certain exponential functions. We show that the Julia sets J(F_λn) of F_λn(z) = λ_ne^zn where λ_n > 0 is the whole plane , provided that lim_k → ∞ F^k_λn(0) = ∞. In particular, this is true when λ_n are real numbers such that . On the other hand, if , then J(F_λn) is nowhere dense in and is the complement of the basin of attraction of the unique real attractive fixed point of F_λn. We then prove similar results for the functions[formula] where λ_i    − {0}, 1 ≤ i ≤ n + 1, a_j > 1, 1 ≤ j ≤ n, and m, n ≥ 1.     

Bergman-Type Reproducing Kernels, Contractive Divisors, and Dilations

Let Ω be a region in the complex plane. In this paper we introduce a class of sesquianalytic reproducing kernels on Ω that we call B-kernels. When Ω is the open unit disk and certain natural additional hypotheses are added we call such kernels k Bergman-type kernels. In this case the associated reproducing kernel Hilbert space (k) shares certain properties with the classical Bergman space L²_α of the unit disk. For example, the weighted Bergman kernels k^β_w(z)=(1−wz)^−β, 1β2 are Bergman-type kernels. Furthermore, for any Bergman-type kernel k one has H² (k)L²_a, where the inclusion maps are contractive, and M_ζ, the operator of multiplication with the identity function ζ, defines a contraction operator on (k). Our main results about Bergman-type kernels k are the following two: First, once properly normalized, the reproducing kernel for any nontrivial zero based invariant subspace of (k) is a Bergman-type kernel as well. For the weighted Bergman kernels k^β this result even holds for all _ζ-invariant subspace of index 1, i.e., whenever the dimension of /ζ is one. Second, if is any multiplier invariant subspace of (k), and if we set *= z , then M_ζ is unitarily equivalent to M_ζ acting on a space of *-valued analytic functions with an operator-valued reproducing kernel of the type

Full-size image

where V is a contractive analytic function V :  → ( ,  *), for some auxiliary Hilbert space . Parts of these theorems hold in more generality. Corollaries include contractive divisor, wandering subspace, and dilation theorems for all Bergman-type reproducing kernel Hilbert spaces. When restricted to index one invariant subspaces of (k^β), 1β2, our approach yields new proofs of the contractive divisor property, the strong contractive divisor property, and the wandering subspace theorems and inner–outer factorization. Our proofs are based on the properties of reproducing kernels, and they do not involve the use of biharmonic Green functions as had some of the earlier proofs.     

Some two color, four variable Rado numbers

There exists a minimum integer N such that any 2-coloring of {1,2,…,N} admits a monochromatic solution to x+y+kz=ℓw for , where N depends on k and ℓ. We determine N when ℓ−k{0,1,2,3,4,5}, for all k,ℓ for which , as well as for arbitrary k when ℓ=2.     

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.     

On Generalized Hermite–Fejér Interpolation of Lagrange Type on the Chebyshev Nodes

For fC[−1, 1], let H_m, n(f, x) denote the (0, 1, …,anbsp;m) Hermite–Fejér (HF) interpolation polynomial of f based on the Chebyshev nodes. That is, H_m, n(f, x) is the polynomial of least degree which interpolates f(x) and has its first m derivatives vanish at each of the zeros of the nth Chebyshev polynomial of the first kind. In this paper a precise pointwise estimate for the approximation error |H_2m, n(f, x)−f(x)| is developed, and an equiconvergence result for Lagrange and (0, 1, …, 2m) HF interpolation on the Chebyshev nodes is obtained. This equiconvergence result is then used to show that a rational interpolatory process, obtained by combining the divergent Lagrange and (0, 1, …, 2m) HF interpolation methods on the Chebyshev nodes, is convergent for all fC[−1, 1].     

Discrepancy in generalized arithmetic progressions

Estimating the discrepancy of the set of all arithmetic progressions in the first N natural numbers was one of the famous open problems in combinatorial discrepancy theory for a long time, successfully solved by K. Roth (lower bound) and Beck (upper bound). They proved that D(N)=min_χmax_A|∑_xAχ(x)|=Θ(N^1/4), where the minimum is taken over all colorings χ:[N]→{−1,1} and the maximum over all arithmetic progressions in [N]={0,…,N−1}.Sumsets of k arithmetic progressions, A₁++A_k, are called k-arithmetic progressions and they are important objects in additive combinatorics. We define D_k(N) as the discrepancy of the set {P∩[N]:P is a k-arithmetic progression}. The second author proved that D_k(N)=Ω(N^k/(2k+2)) and Přívětivý improved it to Ω(N^1/2) for all k≥3. Since the probabilistic argument gives D_k(N)=O((NlogN)^1/2) for all fixed k, the case k=2 remained the only case with a large gap between the known upper and lower bounds. We bridge this gap (up to a logarithmic factor) by proving that D_k(N)=Ω(N^1/2) for all k≥2.Indeed we prove the multicolor version of this result.     

Density of Gabor Frames

A Gabor system is a set of time-frequency shifts S(g, Λ) ={e^{2 π ibx}g(x − a)}_{(a, b) Λ} of a function g L²(R^d). We prove that if a finite union of Gabor systems _{k = 1}^rS(g_k, Λ_k) forms a frame for L²(R^d) then the lower and upper Beurling densities of Λ = _{k = 1}^r Λ_k satisfy D⁻(Λ) ≥ 1 and D ⁺ (Λ) < ∞. This extends recent work of Ramanathan and Steger. Additionally, we prove the conjecture that no collection _{k = 1}^r{g_k(x − a)}_{a Γk} of pure translates can form a frame for L²(R^d).     

Uniqueness and stability of regional blow-up in a porous-medium equation

We study the blow-up phenomenon for the porous-medium equation in R^N, N1, u_t=Δu^m+u^m, m>1, for nonnegative, compactly supported initial data. A solution u(x,t) to this problem blows-up at a finite time . Our main result asserts that there is a finite number of points x₁,…,x_kR^N, with |x_i−x_j|2R^* for i≠j, such that Here w_*(|x|) is the unique nontrivial, nonnegative compactly supported, radially symmetric solution of the equation in R^N and R^* is the radius of its support. Moreover u(x,t) remains uniformly bounded up to its blow-up time on compact subsets of . The question becomes reduced to that of proving that the ω-limit set in the problem consists of a single point when its initial condition is nonnegative and compactly supported.     

Analytic eigendistributions and applications to homogeneous trees

An analytic distribution on is an element, ν, of the dual of the space of analytic functions on K. In particular, ν defines a linear functional on the polynomial ring . In this work, we study the converse problem: given a linear functional on , try to find a minimal set K such that ν extends to an analytic distribution on K. This study was motivated by the desire to generalize a result that allows the representation of functions on a homogeneous tree as integrals of z-harmonic functions oven a certain interval. A function f on a homogeneous tree T of degree q+1 is said to be z-harmonic, if μ₁f=zf, where μ₁ is the nearest neighbor averaging operator. It was proved in [Cohen, Colonna, Adv. Appl. Math. 20 (1998) 253–274] that if |f(v)|MC^|v| for constants M>0 and , then there exist z-harmonic functions k_z such that where I is the interval with endpoints . In the present paper, we study the case when the above exponential growth condition holds with , which necessitates replacing k_z(v) dz with an analytic distribution ν_v satisfying the z-harmonicity condition μ₁ν=zν. We show that to each function on the tree satisfying the above exponential growth condition there corresponds an eigendistribution on an elliptical region containing I as the interval between its foci.     

EXISTENCE OF GLOBAL ATTRACTORS FOR A NONLINEAR EVOLUTION EQUATION IN SOBOLEV SPACE Hk

In this paper we prove that the initial-boundary value problem for the nonlinear evolution equation ut = △u ＋ λu - u^3 possesses a global attractor in Sobolev space H^k for all k≥0, which attracts any bounded domain of H^k（Ω） in the H^k-norm. This result is established by using an iteration technique and regularity estimates for linear semigroup of operator, which extends the classical result from the case k ∈ [0, 1] to the case k∈ [0, ∞）.     

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 .     

On the Positivity of the Fundamental Polynomials for Generalized Hermite–Fejér Interpolation on the Chebyshev Nodes

It is shown that the fundamental polynomials for (0, 1, …, 2m+1) Hermite–Fejér interpolation on the zeros of the Chebyshev polynomials of the first kind are non-negative for −1x1, thereby generalising a well-known property of the original Hermite–Fejér interpolation method. As an application of the result, Korovkin's 10theorem on monotone operators is used to present a new proof that the (0, 1, …, 2m+1) Hermite–Fejér interpolation polynomials offC[−1, 1], based onnChebyshev nodes, converge uniformly tofasn→∞.     

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.