On the approximation of continuous functions of two variables

It is shown that if P _m ^α,β (x) (α, β > ?1, m = 0, 1, 2, …) are the classical Jaboci polynomials, then the system of polynomials of two variables {Ψ _mn ^α,β (x, y)} _m,n=0 ^r = {P _m ^α,β (x)P _n ^α,β (y)} _{m, n=0} ^r (r = m + n ≤ N ? 1) is an orthogonal system on the set Ω _N×N = ?ub;(x _i , y _i ) _i,j=0 ^N , where x _i and y _i are the zeros of the Jacobi polynomial P _n ^α,β (x). Given an arbitrary continuous function f(x, y) on the square [?1, 1]², we construct the discrete partial Fourier-Jacobi sums of the rectangular type S _{m, n, N} ^α,β (f; x, y) by the orthogonal system introduced above. We prove that the order of the Lebesgue constants ∥S _{m, n, N} ^α,β ∥ of the discrete sums S _{m, n, N} ^α,β (f; x, y) for ?1/2 < α, β < 1/2, m + n ≤ N ? 1 is O((mn) ^{q + 1/2}), where q = max?ub;α,β?ub;. As a consequence of this result, several approximate properties of the discrete sums S _{m, n, N} ^α,β (f; x, y) are considered.     

On <Emphasis Type="Italic">s</Emphasis>-Elementary Super Frame Wavelets and Their Path-Connectedness

A super wavelet of length n is an n-tuple (ψ ₁,ψ ₂,…,ψ _n ) in the product space \(\prod_{j=1}^{n} L^{2}(\mathbb{R})\), such that the coordinated dilates of all its coordinated translates form an orthonormal basis for \(\prod_{j=1}^{n} L^{2} (\mathbb{R})\). This concept is generalized to the so-called super frame wavelets, super tight frame wavelets and super normalized tight frame wavelets (or super Parseval frame wavelets), namely an n-tuple (η ₁,η ₂,…,η _n ) in \(\prod_{j=1}^{n}L^{2} (\mathbb{R})\) such that the coordinated dilates of all its coordinated translates form a frame, a tight frame, or a normalized tight frame for \(\prod_{j=1}^{n} L^{2}(\mathbb{R})\). In this paper, we study the super frame wavelets and the super tight frame wavelets whose Fourier transforms are defined by set theoretical functions (called s-elementary frame wavelets). An m-tuple of sets (E ₁,E ₂,…,E _m ) is said to be τ-disjoint if the E _j ’s are pair-wise disjoint under the 2π-translations. We prove that a τ-disjoint m-tuple (E ₁,E ₂,…,E _m ) of frame sets (i.e., η _j defined by \(\widehat{\eta_{j}}=\frac{1}{\sqrt{2\pi}}\chi_{E_{j}}\) is a frame wavelet for L ²(?) for each j) lead to a super frame wavelet (η ₁,η ₂,…,η _m ) for \(\prod_{j=1}^{m} L^{2} (\mathbb{R})\) where \(\widehat{\eta_{j}}=\frac{1}{\sqrt{2\pi}}\chi_{E_{j}}\). In the case of super tight frame wavelets, we prove that (η ₁,η ₂,…,η _m ), defined by \(\widehat{\eta_{j}}=\frac{1}{\sqrt{2\pi}}\chi_{E_{j}}\), is a super tight frame wavelet for ∏_1≤j≤m L ²(?) with frame bound k ₀ if and only if each η _j is a tight frame wavelet for L ²(?) with frame bound k ₀ and that (E ₁,E ₂,…,E _m ) is τ-disjoint. Denote the set of all τ-disjoint s-elementary super frame wavelets for ∏_1≤j≤m L ²(?) by \(\mathfrak{S}(m)\) and the set of all s-elementary super tight frame wavelets (with the same frame bound k ₀) for ∏_1≤j≤m L ²(?) by \(\mathfrak{S}^{k_{0}}(m)\). We further prove that \(\mathfrak{S}(m)\) and \(\mathfrak{S}^{k_{0}}(m)\) are both path-connected under the ∏_1≤j≤m L ²(?) norm, for any given positive integers m and k ₀.     

On the Bessel Heat Equation Related to the Bessel Diamond Operator

In this article, we study the equation

$\frac{\partial }{\partial t}u(x,t)=c^{2}\Diamond _{B}^{k}u(x,t)$

with the initial condition u(x,0)=f(x) for x∈? _n ⁺ . The operator ? _B ^k is named to be Bessel diamond operator iterated k-times and is defined by

$\Diamond _{B}^{k}=\bigl[(B_{x_{1}}+B_{x_{2}}+\cdots +B_{x_{p}})^{2}-(B_{x_{p+1}}+\cdots +B_{x_{p+q}})^{2}\bigr]^{k},$

where k is a positive integer, p+q=n, \(B_{x_{i}}=\frac{\partial ^{2}}{\partial x_{i}^{2}}+\frac{2v_{i}}{x_{i}}\frac{\partial }{\partial x_{i}},\) 2v _i =2α _i +1,\(\;\alpha _{i}>-\frac{1}{2}\), x _i >0, i=1,2,…,n, and n is the dimension of the ? _n ⁺ , u(x,t) is an unknown function of the form (x,t)=(x ₁,…,x _n ,t)∈? _n ⁺ ×(0,∞), f(x) is a given generalized function and c is a positive constant (see Levitan, Usp. Mat. 6(2(42)):102–143, 1951; Y?ld?r?m, Ph.D. Thesis, 1995; Y?ld?r?m and Sar?kaya, J. Inst. Math. Comput. Sci. 14(3):217–224, 2001; Y?ld?r?m, et al., Proc. Indian Acad. Sci. (Math. Sci.) 114(4):375–387, 2004; Sar?kaya, Ph.D. Thesis, 2007; Sar?kaya and Y?ld?r?m, Nonlinear Anal. 68:430–442, 2008, and Appl. Math. Comput. 189:910–917, 2007). We obtain the solution of such equation, which is related to the spectrum and the kernel, which is so called Bessel diamond heat kernel. Moreover, such Bessel diamond heat kernel has interesting properties and also related to the kernel of an extension of the heat equation.

     

General Hausdorff functions,and the notion of one-sided measure and dimension

The main facts about Hausdorff and packing measures and dimensions of a Borel set E are revisited, using determining set functions \(\phi_\alpha\colon\mathcal{B}_E\to(0,\infty)\), where \(\mathcal{B}_E\) is the family of all balls centred on E and α is a real parameter. With mild assumptions on φ_α, we verify that the main density results hold, as well as the basic properties of the corresponding box dimension. Given a bounded open set V in ? ^D , these notions are used to introduce the interior and exterior measures and dimensions of any Borel subset of ?V. We stress that these dimensions depend on the choice of φ_α. Two determining functions are considered, φ_α(B)=Vol _D (B∩V)diam(B)^α-D and φ_α(B)=Vol _D (B∩V)^α/D , where Vol _D denotes the D-dimensional volume.     

Reducing subspaces of tensor products of weighted shifts

A unilateral weighted shift A is said to be simple if its weight sequence {α_n} satisfies ▽~3(α_n~2)≠0for all n≥2.We prove that if A and B are two simple unilateral weighted shifts,then AI+IB is reducible if and only if A and B are unitarily equivalent.We also study the reducing subspaces of A~kI+IB~l and give some examples.As an application,we study the reducing subspaces of multiplication operators Mzk+αωl on function spaces.     

Automorphisms of metacyclic groups

A metacyclic group H can be presented as 〈α,β: αⁿ = 1, β^m = α^t, βαβ^?1 = α^r〉 for some n, m, t, r. Each endomorphism σ of H is determined by \(\sigma(\alpha)=\alpha^{x_1}\beta^{y_1}, \sigma(\beta)=\alpha^{x_2}\beta^{y_2}\) for some integers x₁, x₂, y₁, y₂. We give sufficient and necessary conditions on x₁, x₂, y₁, y₂ for σ to be an automorphism.     

On the additive complexity of GCD and LCM matrices

In the paper, the additive complexity of matrices formed by positive integer powers of greatest common divisors and least common multiples of the indices of the rows and columns is considered. It is proved that the complexity of the n × n matrix formed by the numbers GCD^r(i, k) over the basis {x + y} is asymptotically equal to rn log²n as n→∞, and the complexity of the n × n matrix formed by the numbers LCM^r(i, k) over the basis {x + y,?x} is asymptotically equal to 2rn log₂n as n→∞.     

A relation between the Laplacian and signless Laplacian eigenvalues of a graph

Let G be a graph of order n such that \(\sum_{i=0}^{n}(-1)^{i}a_{i}\lambda^{n-i}\) and \(\sum_{i=0}^{n}(-1)^{i}b_{i}\lambda^{n-i}\) are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that a _i ≥b _i for i=0,1,…,n. As a consequence, we prove that for any α, 0<α≤1, if q ₁,…,q _n and μ ₁,…,μ _n are the signless Laplacian and the Laplacian eigenvalues of G, respectively, then \(q_{1}^{\alpha}+\cdots+q_{n}^{\alpha}\geq\mu_{1}^{\alpha}+\cdots+\mu _{n}^{\alpha}\).     

On a question of Sárközy on gaps of product sequences

Motivated by a question of Sárközy, we study the gaps in the product sequence B = A · A = {b ₁ < b ₂ < …} of all products a _i a _j with a _i , a _j ∈ A when A has upper Banach density α > 0. We prove that there are infinitely many gaps b _n+1 ? b _n ? α ^?3 and that for t ≥ 2 there are infinitely many t-gaps b _n+t ? b _n ? t ² α ^?4. Furthermore, we prove that these estimates are best possible.We also discuss a related question about the cardinality of the quotient set A/A = {a _i /a _j , a _i , a _j ∈ A} when A ? {1, …, N} and |A| = αN.     

Distance domination of generalized de Bruijn and Kautz digraphs

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G _B (n, d) and generalized Kautz digraphs G _K (n, d) are good candidates for interconnection networks. Denote Δ _k := (∑ _j=0 ^k d ^j )^?1. F. Tian and J. Xu showed that ?nΔ _k ? γ _k (G _B (n, d)) ≤?n/d ^k? and ?nΔ _k ? ≤ γ _k (G _K (n, d)) ≤ ?n/d ^k ?. In this paper, we prove that every generalized de Bruijn digraph G _B (n, d) has the distance k-domination number ?nΔ _k ? or ?nΔ _k ?+1, and the distance k-domination number of every generalized Kautz digraph G _K (n, d) bounded above by ?n/(d ^k?1+d ^k )?. Additionally, we present various sufficient conditions for γ _k (G _B (n, d)) = ?nΔ _k ? and γ _k (G _K (n, d)) = ?nΔ _k ?.     

Length-type parameters of finite groups with almost unipotent automorphisms

Let α be an automorphism of a finite group G. For a positive integer n, let E _G,n (α) be the subgroup generated by all commutators [...[[x,α],α],…,α] in the semidirect product G 〈α〉 over x ∈ G, where α is repeated n times. By Baer’s theorem, if E _G,n (α)=1, then the commutator subgroup [G,α] is nilpotent. We generalize this theorem in terms of certain length parameters of E _G,n (α). For soluble G we prove that if, for some n, the Fitting height of E _G,n (α) is equal to k, then the Fitting height of [G,α] is at most k + 1. For nonsoluble G the results are in terms of the nonsoluble length and generalized Fitting height. The generalized Fitting height h*(H) of a finite group H is the least number h such that F _h* (H) = H, where F ₀* (H) = 1, and F _i+1* (H) is the inverse image of the generalized Fitting subgroup F*(H/F _i *(H)). Let m be the number of prime factors of the order |α| counting multiplicities. It is proved that if, for some n, the generalized Fitting height E _G,n (α) of is equal to k, then the generalized Fitting height of [G,α] is bounded in terms of k and m. The nonsoluble length λ(H) of a finite group H is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if λE _G,n (α)= k, then the nonsoluble length of [G,α] is bounded in terms of k and m. We also state conjectures of stronger results independent of m and show that these conjectures reduce to a certain question about automorphisms of direct products of finite simple groups.     

Circular Law for Noncentral Random Matrices

Let (X _jk )_j,k≥1 be an infinite array of i.i.d. complex random variables with mean 0 and variance 1. Let λ _n,1,…,λ _n,n be the eigenvalues of \((\frac{1}{\sqrt{n}}X_{jk})_{1\leqslant j,k\leqslant n}\). The strong circular law theorem states that, with probability one, the empirical spectral distribution \(\frac{1}{n}(\delta _{\lambda _{n,1}}+\cdots+\delta _{\lambda _{n,n}})\) converges weakly as n→∞ to the uniform law over the unit disc {z∈?,|z|≤1}. In this short paper, we provide an elementary argument that allows us to add a deterministic matrix M to (X _jk )_{1≤ j,k ≤ n} provided that Tr(MM ^*)=O(n ²) and rank(M)=O(n ^α ) with α<1. Conveniently, the argument is similar to the one used for the noncentral version of the Wigner and Marchenko–Pastur theorems.     

Conditional exponential stability of a differential system with linear dichotomous Coppel-Conti approximation

We prove the conditional exponential stability of the zero solution of the nonlinear differential system

$$\dot y = A(t)y + f(t,y),{\mathbf{ }}y \in R^n ,{\mathbf{ }}t \geqslant 0,$$

with L ^p -dichotomous linear Coppel-Conti approximation .x = A(t)x whose principal solution matrix X _A (t), X _A (0) = E, satisfies the condition

$$\mathop \smallint \limits_0^t \left\| {X_A (t)P_1 X_A^{ - 1} (\tau )} \right\|^p d\tau + \mathop \smallint \limits_t^{ + \infty } \left\| {X_A (t)P_2 X_A^{ - 1} (\tau )} \right\|^p d\tau \leqslant C_p (A) < + \infty ,{\mathbf{ }}p \geqslant 1,{\mathbf{ }}t \geqslant 0,$$

where P ₁ and P ₂ are complementary projections of rank k ∈ {1, …, n ? 1} and rank n ? k, respectively, and with a higher-order infinitesimal perturbation f:[0, ∞) × U → R ⁿ that is piecewise continuous in t ≥ 0 and continuous in y in some neighborhood U of the origin.

     

On criteria of estimation of the errors of cubature formulas

The paper considers cubature formulas for calculating integrals of functions f(X), X = (x ₁, …, x _n ) which are defined on the n-dimensional unit hypercube K ⁿ = [0, 1] ⁿ and have integrable mixed derivatives of the kind \(\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)\), 0 ≤ α _j ≤ 2. We estimate the errors R[f] = \(\smallint _{K^n } \) f(X)dX ? Σ _{k = 1} ^N c _k f(X(k)) of cubature formulas (c _k > 0) as functions of the weights c _k of nodes X(k) and properties of integrable functions. The error is estimated in terms of the integrals of the derivatives of f over r-dimensional faces (r≤n) of the hypercube K ⁿ : |R(f)| ≤ \(\sum _{\alpha _j } \) G(α _j )\(\int_{K^r } {\left| {\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)} \right|} \) dX _r , where coefficients G(α _j ) are criteria which depend only on parameters c _k and X(k). We present an algorithm to calculate these criteria in the two- and n-dimensional cases. Examples are given. A particular case of the criteria is the discrepancy, and the algorithm proposed is a generalization of those used to compute the discrepancy. The results obtained can be used for optimization of cubature formulas as functions of c _k and X(k).     

Detailed error analysis for a fractional Adams method with graded meshes

We consider a fractional Adams method for solving the nonlinear fractional differential equation \(\,^{C}_{0}D^{\alpha }_{t} y(t) = f(t, y(t)), \, \alpha >0\), equipped with the initial conditions \(y^{(k)} (0) = y_{0}^{(k)}, k=0, 1, \dots , \lceil \alpha \rceil -1\). Here, α may be an arbitrary positive number and ?α? denotes the smallest integer no less than α and the differential operator is the Caputo derivative. Under the assumption \(\,^{C}_{0}D^{\alpha }_{t} y \in C^{2}[0, T]\), Diethelm et al. (Numer. Algor. 36, 31–52, 2004) introduced a fractional Adams method with the uniform meshes t _n = T(n/N),n = 0,1,2,…,N and proved that this method has the optimal convergence order uniformly in t _n , that is O(N ^?2) if α > 1 and O(N ^?1?α ) if α ≤ 1. They also showed that if \(\,^{C}_{0}D^{\alpha }_{t} y(t) \notin C^{2}[0, T]\), the optimal convergence order of this method cannot be obtained with the uniform meshes. However, it is well-known that for y ∈ C ^m [0,T] for some \(m \in \mathbb {N}\) and 0 < α < m, the Caputo fractional derivative \(\,^{C}_{0}D^{\alpha }_{t} y(t) \) takes the form “\(\,^{C}_{0}D^{\alpha }_{t} y(t) = c t^{\lceil \alpha \rceil -\alpha } + \text {smoother terms}\)” (Diethelm et al. Numer. Algor. 36, 31–52, 2004), which implies that \(\,^{C}_{0}D^{\alpha }_{t} y \) behaves as t ^?α??α which is not in C ²[0,T]. By using the graded meshes t _n = T(n/N) ^r ,n = 0,1,2,…,N with some suitable r > 1, we show that the optimal convergence order of this method can be recovered uniformly in t _n even if \(\,^{C}_{0}D^{\alpha }_{t} y\) behaves as t ^σ ,0 < σ < 1. Numerical examples are given to show that the numerical results are consistent with the theoretical results.     

Matrix polynomial generalizations of the sample variance-covariance matrix when <Emphasis Type="Italic">pn</Emphasis><Superscript>−1</Superscript> → <Emphasis Type="Italic">y</Emphasis> ∈ (0, ∞)

Let {Z _u = ((ε_{u, i, j}))_p×n} be random matrices where {ε_{u, i, j}} are independently distributed. Suppose {A _i }, {B _i } are non-random matrices of order p × p and n × n respectively. Consider all p × p random matrix polynomials \(P = \prod\nolimits_{i = 1}^{k_l } {\left( {n^{ - 1} A_{t_i } Z_{j_i } B_{s_i } Z_{j_i }^* } \right)A_{t_{k_l + 1} } }\). We show that under appropriate conditions on the above matrices, the elements of the non-commutative *-probability space Span {P} with state p^?1ETr converge. As a by-product, we also show that the limiting spectral distribution of any self-adjoint polynomial in Span{P} exists almost surely.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

Order of magnitude of multiple Fourier coefficients of functions of bounded <Emphasis Type="Italic">p</Emphasis>-variation

For a Lebesgue integrable complex-valued function f defined over the n-dimensional torus \(\mathbb{T}^n \):= [0, 2π) ⁿ , let \(\hat f\)(k) denote the Fourier coefficient of f, where k = (k ₁, … k _n ) ∈ ? ⁿ . In this paper, defining the notion of bounded p-variation (p ≧ 1) for a function from [0, 2π] ⁿ to ? in two diffierent ways, the order of magnitude of Fourier coefficients of such functions is studied. As far as the order of magnitude is concerned, our results with p = 1 give the results of Móricz [5] and Fülöp and Móricz [3].