Harmonic analysis of fractal measures

We consider affine systems inR ⁿ constructed from a given integral invertible and expansive matrixR, and a finite setB of translates,σ _bx:=R^–1x+b; the corresponding measure μ onR ⁿ is a probability measure fixed by the self-similarity $\mu = \left| B \right|^{ - 1} \sum\nolimits_{b \in B} {\mu o\sigma _b^{ - 1} } $ . There are twoa priori candidates for an associated orthogonal harmonic analysis: (i) the existence of some subset Λ inR ⁿ such that the exponentials {e^iλ·x}Λ form anorthogonal basis forL ²(μ); and (ii) the existence of a certaindual pair of representations of theC ^*-algebraO _N wheren is the cardinality of the setB. (For eachN, theC ^*-algebraO _N is known to be simple; it is also called the Cuntz algebra.) We show that, in the “typical” fractal case, the naive version (i) must be rejected; typically the orthogonal exponentials inL ²(μ) fail to span a dense subspace. Instead we show that theC ^*-algebraic version of an orthogonal harmonic analysis, namely (ii), is a natural substitute. It turns out that this version is still based on exponentialse ^iλ·x, but in a more indirect way. (See details in Section 5 below.) Our main result concerns the intrinsic geometric features of affine systems, based onR andB, such that μ has theC ^*-algebra property (ii). Specifically, we show that μ has an orthogonal harmonic analysis (in the sense (ii)) if the system (R, B) satisfies some specific symmetry conditions (which are geometric in nature). Our conditions for (ii) are stated in terms of two pieces of data: (a) aunitary generalized Hadamard matrix, and (b) a certainsystem of lattices which must exist and, at the same time, be compatible with the Hadamard matrix. A partial converse to this result is also given. Several examples are calculated, and a new maximality condition for exponentials is identified.     

Chain sequences and symmetric generalized orthogonal polynomials

In this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K_n^(λ,M,k) associated with the probability measure dφ(λ,M,k;x), which is the Gegenbauer measure of parameter λ+1 with two additional mass points at ±k. When k=1 we obtain information on the polynomials K_n^(λ,M) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K_n^(λ,M,k) in relation to M and k are also given.     

Some Estimates for the Norm of the Bergman Projection on Besov Spaces

In this paper we obtain an estimate of the norm of the Bergman projection from L ^p (D, dλ) onto the Besov space B _p , 1 < p < + ∞. The result is asymptotically sharp when p → + ∞. Further for the case P : L ¹(D, dλ) → B ₁, we consider some weak type inequalities with the corresponding spaces.     

Approximation of functions of finite variation by superpositions of a Sigmoidal function

The aim of this note is to generalize a result of Barron [1] concerning the approximation of functions, which can be expressed in terms of the Fourier transform, by superpositions of a fixed sigmoidal function. In particular, we consider functions of the type h(x) = ∫ℝ^d ƒ (〈t, x〉)dμ(t), where μ is a finite Radon measure on ℝ^d and ƒ : ℝ → ℂ is a continuous function with bounded variation in ℝ We show (Theorem 2.6) that these functions can be approximated in L₂-norm by elements of the set G_n = {Σ_i=0^staggeredn c_ig(〈a_i, x〉 + b_i) : a_iℝ^d, b_i, c_iℝ}, where g is a fixed sigmoidal function, with the error estimated by C/n^1/2, where C is a positive constant depending only on f. The same result holds true (Theorem 2.9) for f : ℝ → ℂ satisfying the Lipschitz condition under an additional assumption that ∫ℝ^d6t6e^d|u(t)| > ∞     

Lower-semicontinuity result for the two-scale convergence

Let (m, n) ∈ ℕ², Ω an open bounded domain in ℝ^m , Y = [0, 1]^m ; u^ε in (L²(Ω))ⁿ which is two-scale converges to some u in (L²(Ω × Y))ⁿ . Let φ: Ω × ℝ^m × ℝⁿ → ℝ such that: φ(x, ·, ·) is continuous a.e. x ∈ Ω φ(·, y, z) is measurable for all (y, z) in ℝ^m × ℝⁿ , φ(x, ·, z) is 1-periodic in y, φ(x, y, ·) is convex in z. Assume that there exist a constant C₁ > 0 and a function C₂ ∈ L²(Ω) such that

     

On the risk of estimates for block decreasing densities

A density f=f(x₁,…,x_d) on [0,∞)^d is block decreasing if for each j∈{1,…,d}, it is a decreasing function of x_j, when all other components are held fixed. Let us consider the class of all block decreasing densities on [0,1]^d bounded by B. We shall study the minimax risk over this class using n i.i.d. observations, the loss being measured by the L₁ distance between the estimate and the true density. We prove that if S=log(1+B), lower bounds for the risk are of the form C(S^d/n)^1/(d+2), where C is a function of d only. We also prove that a suitable histogram with unequal bin widths as well as a variable kernel estimate achieve the optimal multivariate rate. We present a procedure for choosing all parameters in the kernel estimate automatically without loosing the minimax optimality, even if B and the support of f are unknown.     

Tranchage et cône tangent des courants localement normaux

Let T be a locally normal current on an open set Ω of ℝ″ = ℝ x ℝ″⁻¹ and let π: ℝⁿ → ℝ denote the projection π(x₁, x″) = x₁. We define the current 〈T, π, 0〉 (called slice of T at 0 by π) as the limit, as ɛ → 0, of the family ɛ⁻¹TΛπ ^* (ψ(x¹ /ɛ)dx¹), where ψ is a C^∞ function on ℝ with compact support such that ∝ψ(x¹)dx¹ = 1, provided the limit exists and doesn't depend on the choice of ψ. We first prove that the limit lim_R→+∞(h_R)_#T exists, where h_R(x₁,x″) = (Rx¹,x″). We apply this result to the study of the existence of the tangent cone at 0 associated to a locally normal current, and especially associated to a subanalytic chain. We finally give a necessary and sufficient condition relative to T for the existence of the slice 〈T, π, 0〉.     

Vanishing exponential integrability for functions whose gradients belong to L(log(e+L))

If the gradient of u(x) is nth power locally integrable on Euclidean n-space, then the integral average over a ball B of the exponential of a constant multiple of |u(x)−u_B|^n/(n−1), u_B=average of u over B, tends to 1 as the radius of B shrinks to zero—for quasi almost all center points. This refines a result of N. Trudinger (1967). We prove here a similar result for the class of gradients in Lⁿ(log(e+L))^α, 0?α?n−1. The results depend on a capacitary strong-type inequality for these spaces.     

Distance sets that are a shift of the integers and Fourier basis for planar convex sets

The aim of this paper is to prove that if a planar set A has a difference set Δ(A) satisfying Δ(A) ? ?⁺ + s for suitable s then A has at most 3 elements. This result is motivated by the conjecture that the disk has no more than 3 orthogonal exponentials. Further, we prove that if A is a set of exponentials mutually orthogonal with respect to any symmetric convex set K in the plane with a smooth boundary and everywhere non-vanishing curvature, then #(A ∩ [?q, q]²) ≦ C(K) _q where C(K) is a constant depending only on K. This extends and clarifies in the plane the result of Iosevich and Rudnev. As a corollary, we obtain the result from [8] and [9] that if K is a centrally symmetric convex body with a smooth boundary and non-vanishing curvature, then L ²(K) does not possess an orthogonal basis of exponentials.     

Tensor-Structured Preconditioners and Approximate Inverse of Elliptic Operators in ℝ d

In the present paper we analyze a class of tensor-structured preconditioners for the multidimensional second-order elliptic operators in ? ^d , d≥2. For equations in a bounded domain, the construction is based on the rank-R tensor-product approximation of the elliptic resolvent ? _R ≈(??λ I)^?1, where ? is the sum of univariate elliptic operators. We prove the explicit estimate on the tensor rank R that ensures the spectral equivalence. For equations in an unbounded domain, one can utilize the tensor-structured approximation of Green’s kernel for the shifted Laplacian in ? ^d , which is well developed in the case of nonoscillatory potentials. For the oscillating kernels e ^{?i κ‖x‖}/‖x‖, x∈? ^d , κ∈?₊, we give constructive proof of the rank-O(κ) separable approximation. This leads to the tensor representation for the discretized 3D Helmholtz kernel on an n×n×n grid that requires only O(κ?|log?ε|²? n) reals for storage. Such representations can be applied to both the 3D volume and boundary calculations with sublinear cost O(n ²), even in the case κ=O(n). Numerical illustrations demonstrate the efficiency of low tensor-rank approximation for Green’s kernels e ^?λ‖x‖/‖x‖, x∈?³, in the case of Newton (λ=0), Yukawa (λ∈?₊), and Helmholtz (λ=i κ,?κ∈?₊) potentials, as well as for the kernel functions 1/‖x‖ and 1/‖x‖ ^d?2, x∈? ^d , in higher dimensions d>3. We present numerical results on the iterative calculation of the minimal eigenvalue for the d-dimensional finite difference Laplacian by the power method with the rank truncation and based on the approximate inverse ? _R ≈(?Δ)^?1, with 3≤d≤50.     

The Exponent of Discrepancy Is at Least 1.0669

LetP⊂[0, 1]^dbe ann-point set and letw: P→[0, ∞) be a weight function withw(P)=∑_z∈P w(z)=1. TheL₂-discrepancy of the weighted set (P, w) is defined as theL₂-average ofD(x)=vol(B_x)−w(P∩B_x) overx∈[0, 1]^d, where vol(B_x) is the volume of thed-dimensional intervalB_x=∏^d_k=1 [0, x_k). The exponent of discrepancyp* is defined as the infimum of numberspsuch that for all dimensionsd⩾1 and allε>0 there exists a weighted set of at mostKε^−ppoints in [0, 1]^dwithL₂-discrepancy at mostε, whereK=K(p) is a suitable number independent ofεandd. Wasilkowski and Woźniakowski proved thatp*⩽1.4779, by combining known bounds for the error of numerical integration and using their relation toL₂-discrepancy. In this note we observe that a careful treatment of a classical lower- bound proof of Roth yieldsp*⩾1.04882, and by a slight modification of the proof we getp*⩾1.0669. Determiningp* exactly seems to be quite a difficult problem.     

Elliptic equation with a singular potential in a domain with a conic point

This paper deals with the behavior of the nonnegative solutions of the problem $$- \Delta u = V(x)u, \left. u \right|\partial \Omega = \varphi (x)$$ in a conical domain Ω ? ? ⁿ , n ≥ 3, where 0 ≤ V (x) ∈ L₁(Ω), 0 ≤ ?(x) ∈ L₁(?Ω) and ?(x) is continuous on the boundary ?Ω. It is proved that there exists a constant C _*(n) = (n ? 2)²/4 such that if V ₀(x) = (c + λ ₁)|x|^?2, then, for 0 ≤ c ≤ C _*(n) and V(x) ≤ V ₀(x) in the domain Ω, this problem has a nonnegative solution for any nonnegative boundary function ?(x) ∈ L ₁(?Ω); for c > C _*(n) and V(x) ≥ V ₀(x) in Ω, this problem has no nonnegative solutions if ?(x) > 0.     

A note on Stewart's theorem for definite matrix pairs

Let A and B be n×n Hermitian matrices. The matrix pair (A, B) is called definite pair and the corresponding eigenvalue problem βAx = αBx is definite if c(A, B) ≡ inf_{6x6= 1}{|^H(A+iB)x|} > 0. In this note we develop a uniform upper bound for differences of corresponding eigenvalues of two definite pairs and so improve a result which is obtained by G.W. Stewart [2]. Moreover, we prove that this upper bound is a projective metric in the set of n × n definite pairs.     

Friedrichs extensions of Schrödinger operators with singular potentials

The Friedrichs extension for the generalized spiked harmonic oscillator given by the singular differential operator −d²/dx²+Bx²+Ax⁻²+λx^−α (B>0, A?0) in L₂(0,∞) is studied. We look at two different domains of definition for each of these differential operators in L₂(0,∞), namely C₀^∞(0,∞) and D(T_2,F)∩D(M_λ,α), where the latter is a subspace of the Sobolev space W_2,2(0,∞). Adjoints of these differential operators on C₀^∞(0,∞) exist as result of the null-space properties of functionals. For the other domain, convolutions and Jensen and Minkowski integral inequalities, density of C₀^∞(0,∞) in D(T_2,F)∩D(M_λ,α) in L₂(0,∞) lead to the other adjoints. Further density properties C₀^∞(0,∞) in D(T_2,F)∩D(M_λ,α) yield the Friedrichs extension of these differential operators with domains of definition D(T_2,F)∩D(M_λ,α).     

Ordering connected graphs having small degree distances

The concept of degree distance of a connected graph G is a variation of the well-known Wiener index, in which the degrees of vertices are also involved. It is defined by D^′(G)=∑_x∈V(G)d(x)∑_y∈V(G)d(x,y), where d(x) and d(x,y) are the degree of x and the distance between x and y, respectively. In this paper it is proved that connected graphs of order n≥4 having the smallest degree distances are K_1,n−1,BS(n−3,1) and K_1,n−1+e (in this order), where BS(n−3,1) denotes the bistar consisting of vertex disjoint stars K_1,n−3 and K_1,1 with central vertices joined by an edge.     

On solutions to the Degasperis-Procesi equation

In this paper we consider a new integrable equation (the Degasperis-Procesi equation) derived recently by Degasperis and Procesi (1999) [3]. Analogous to the Camassa-Holm equation, this new equation admits blow-up phenomenon and infinite propagation speed. First, we give a proof for the blow-up criterion established by Zhou (2004) in [12]. Then, infinite propagation speed for the Degasperis-Procesi equation is proved in the following sense: the corresponding solution u(x,t) with compactly supported initial datum u₀(x) does not have compact x-support any longer in its lifespan. Moreover, we show that for any fixed time t>0 in its lifespan, the corresponding solution u(x,t) behaves as: u(x,t)=L(t)e−x for x?1, and u(x,t)=l(t)ex for x?−1, with a strictly increasing function L(t)>0 and a strictly decreasing function l(t)<0 respectively.     

Indecomposable triple systems

A t-design (λ, t, d, n) is a system $\text{B}$ of sets of size d from an n-set S, such that each t subset of S is contained in exactly λ elements of $\text{B}$. A t-design is indecomposable (written IND(λ, t, d, n)) if there does not exist a subset $\text{B}$ ? $\text{B}$ such that $\text{B}$ is a (λ, t, d, n) for some λ, 1 ? λ < λ. A triple system is a (λ; 2, 3, n). Recursive and constructive methods (several due to Hanani) are employed to show that: (1) an IND(2; 2, 3, n) exists for n ≡ 0, 1 (mod 3), n ? 4 and n ≡ 7 (designs of Bhattacharya are used here), (2) an IND(3; 2, 3, n) exists for n odd, n ? 5, (3) if an IND(λ, 2, 3, n) exists, n odd, then there exists an infinite number of indecomposable triple systems with that λ.     

On island sequences of labelings with a condition at distance two

An L(2,1)-labeling of a graph G is a function f from the vertex set of G to the set of nonnegative integers such that |f(x)−f(y)|≥2 if d(x,y)=1, and |f(x)−f(y)|≥1 if d(x,y)=2, where d(x,y) denotes the distance between the pair of vertices x,y. The lambda number of G, denoted λ(G), is the minimum range of labels used over all L(2,1)-labelings of G. An L(2,1)-labeling of G which achieves the range λ(G) is referred to as a λ-labeling. A hole of an L(2,1)-labeling is an unused integer within the range of integers used. The hole index of G, denoted ρ(G), is the minimum number of holes taken over all its λ-labelings. An island of a given λ-labeling of G with ρ(G) holes is a maximal set of consecutive integers used by the labeling. Georges and Mauro [J.P. Georges, D.W. Mauro, On the structure of graphs with non-surjective L(2,1)-labelings, SIAM J. Discrete Math. 19 (2005) 208-223] inquired about the existence of a connected graph G with ρ(G)≥1 possessing two λ-labelings with different ordered sequences of island cardinalities. This paper provides an infinite family of such graphs together with their lambda numbers and hole indices. Key to our discussion is the determination of the path covering number of certain 2-sparse graphs, that is, graphs containing no pair of adjacent vertices of degree greater than 2.     

Quadratic matrix polynomials with a parameter

In this paper we examine matrix polynomials of the form L(λ) = Aλ² + εBλ + C in which ε is a parameter and A, B, C are positive definite. This arises in a natural way in the study of damped vibrating systems. The main results are concerned with the generic case in which det L(λ) has at least 2n − 1 distinct zeros for all ε ϵ [0, ∞). The values of ε at which there is a multiple zero of det L(λ) are of major interest in this analysis. The dependence of first degree factors of L(λ) on ε is also discussed.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.