Two-pattern strings II—frequency of occurrence and substring complexity

The previous paper in this series introduced a class of infinite binary strings, called two-pattern strings, that constitute a significant generalization of, and include, the much-studied Sturmian strings. The class of two-pattern strings is a union of a sequence of increasing (with respect to inclusion) subclasses T_λ of two-pattern strings of scope λ, λ=1,2,…. Prefixes of two-pattern strings are interesting from the algorithmic point of view (their recognition, generation, and computation of repetitions and near-repetitions) and since they include prefixes of the Fibonacci and the Sturmian strings, they merit investigation of how many finite two-pattern strings of a given size there are among all binary strings of the same length. In this paper we first consider the frequency f_λ(n) of occurrence of two-pattern strings of length n and scope λ among all strings of length n on {a,b}: we show that lim_n→∞f_λ(n)=0, but that for strings of lengths n2λ, two-pattern strings of scope λ constitute more than one-quarter of all strings. Since the class of Sturmian strings is a subset of two-pattern strings of scope 1, it was natural to focus the study of the substring complexity of two-pattern strings to those of scope 1. Though preserving the aperiodicity of the Sturmian strings, the generalization to two-pattern strings greatly relaxes the constrained substring complexity (the number of distinct substrings of the same length) of the Sturmian strings. We derive upper and lower bounds on C₁(k) (the number of distinct substring of length k) of two-pattern strings of scope 1, and we show that it can be considerably greater than that of a Sturmian string. In fact, we describe circumstances in which lim_k→∞(C₁(k)−k)=∞.     

On Hilbert''s Integral Inequality

In this paper, we generalize Hilbert's integral inequality and its equivalent form by introducing three parameterst,a, andb.Iff, g L²[0, ∞), then[formula]where π is the best value. The inequality (1) is well known as Hilbert's integral inequality, and its equivalent form is[formula]where π²is also the best value (cf. [[1], Chap. 9]). Recently, Hu Ke made the following improvement of (1) by introducing a real functionc(x),[formula]wherek(x) = 2/π∫^∞₀(c(t²x)/(1 + t²)) dt − c(x), 1 − c(x) + c(y) ≥ 0, andf, g ≥ 0 (cf. [[2]]). In this paper, some generalizations of (1) and (2) are given in the following theorems, which are other than those in [ [2]].     

Markov-Type Inequalities for Products of Müntz Polynomials

Let Λ(λ_j)^∞_j=0 be a sequence of distinct real numbers. The span of {x^λ₀, x^λ₁, …, x^λ_n} over is denoted by M_n(Λ)span{x^λ₀, x^λ₁, …, x^λ_n}. Elements of M_n(Λ) are called Müntz polynomials. The principal result of this paper is the following Markov-type inequality for products of Müntz polynomials. T 2.1. LetΛ(λ_j)^∞_j=0andΓ(γ_j)^∞_j=0be increasing sequences of nonnegative real numbers. Let

Full-size image

Then

Full-size image

18(n+m+1)(λ_n+γ_m).In particular ,

Full-size image

Under some necessary extra assumptions, an analog of the above Markov-type inequality is extended to the cases when the factor x is dropped, and when the interval [0, 1] is replaced by [a, b](0, ∞).     

On the convergence of averaging Hermite interpolators

We investigate two sequences of polynomial operators, H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x), of degrees 2n − 2 and 2n − 3, respectively, defined by interpolatory conditions similar to those of the classical Hermite-Féjer interpolators H_{2n − 1}(f, x). If H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x) are based on the zeros of the jacobi polynomials P_n^(α,β)(x), their convergence behaviour is similar to that of H_{2n − 1}(f;, x). If they are based on the zeros of (1 − x²)T_{n − 2}(x), their convergence behaviour is better, in some sense, than that of H_{2n − 1}(f, x).     

Sharp inequalities for convolution-type operators

Let μ be a probability measure on [− a, a], a > 0, and let x₀ε[− a, a], f ε Cⁿ([−2a, 2a]), n 0 even. Using moment methods we derive best upper bounds to ¦∫_−a^a ([f(x₀ + y) + f(x₀ − y)]/2) μ(dy) − f(x₀)¦, leading to sharp inequalities that are attainable and involve the second modulus of continuity of f⁽ⁿ⁾ or an upper bound of it.     

Algebraic Approaches to Periodic Arithmetical Maps

A residue class a + n with weight λ is denoted by λ, a, n. For a finite system = {λ_s, a_s, n_s}^k_{s = 1} of such triples, the periodic map w (x) = ∑_{ns|x − as} λ_s is called the covering map of . Some interesting identities for those with a fixed covering map have been known; in this paper we mainly determine all those functions f : Ω → such that ∑^k_{s = 1} λ_sf(a_s + n_s ) depends only on w where Ω denotes the family of all residue classes. We also study algebraic structures related to such maps f, and periods of arithmetical functions ψ(x) = ∑^k_{s = 1} λ_se^2πia_sx/n_s and ω(x) = |{1 ≤ s ≤ k : (x + a_s, n_s) = 1}|.     

Uniform Estimates for a Class of Evolution Equations

L^∞ estimates are derived for the oscillatory integral ∫⁺₀^∞e^{−i(xλ + (1/m) tλm)}a(λ) dλ, where 2 ≤ m and (x, t) × ₊. The amplitude a(λ) can be oscillatory, e.g., a(λ) = e^{it (λ)} with (λ) a polynomial of degree ≤ m − 1, or it can be of polynomial type, e.g., a(λ) = (1 + λ)^k with 0 ≤ k ≤ (m − 2). The estimates are applied to the study of solutions of certain linear pseudodifferential equations, of the generalized Schrödinger or Airy type, and of associated semilinear equations.     

Estimates for the first and second derivatives of the Stieltjes polynomials

Let w_λ(x)(1−x²)^λ−1/2 and P_n^(λ) be the ultraspherical polynomials with respect to w_λ(x). Then we denote E_n+1^(λ) the Stieltjes polynomials with respect to w_λ(x) satisfyingIn this paper, we give estimates for the first and second derivatives of the Stieltjes polynomials E_n+1^(λ) and the product E_n+1^(λ)P_n^(λ) by obtaining the asymptotic differential relations. Moreover, using these differential relations we estimate the second derivatives of E_n+1^(λ)(x) and E_n+1^(λ)(x)P_n^(λ)(x) at the zeros of E_n+1^(λ)(x) and the product E_n+1^(λ)(x)P_n^(λ)(x), respectively.     

Boundary effects on convergence rates for Tikhonov regularization

We consider the Tikhonov regularizer f_λ of a smooth function f ε H^2m[0, 1], defined as the solution (see [1]) to We prove that if f^(j)(0) = f^(j)(1) = 0, J = m, …, k < 2m − 1, then ¦f − f_λ¦_j² Rλ^{(2k − 2j + 3)/2m}, J = 0, …, m. A detailed analysis is given of the effect of the boundary on convergence rates.     

Error bounds for least squares approximation by polynomials

Let f ε Cⁿ⁺¹[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial approximation to f with respect to the orthonormal polynomials q_k associated with a distribution dα on [−1, 1]. It is shown that if q_n+1/q_n max(q_n+1(1)/q_n(1), −q_n+1(−1)/q_n(−1)), then f − H[f] f^{n + 1} · q_n+1/q_{n + 1}^{(n + 1)}, where · denotes the supremum norm. Furthermore, it is shown that in the case of Jacobi polynomials with distribution (1 − t)^α (1 + t)^β dt, α, β > −1, the condition on q_n+1/q_n is satisfied when either max(α,β) −1/2 or −1 < α = β < −1/2.     

On an infinite series of Abel occurring in the theory of interpolation

The purpose of this paper is to show that for a certain class of functions f which are analytic in the complex plane possibly minus (−∞, −1], the Abel series f(0) + Σ_{n = 1}^∞ f⁽ⁿ⁾(nβ) z(z − nβ)^{n − 1}/n! is convergent for all β>0. Its sum is an entire function of exponential type and can be evaluated in terms of f. Furthermore, it is shown that the Abel series of f for small β>0 approximates f uniformly in half-planes of the form Re(z) − 1 + δ, δ>0. At the end of the paper some special cases are discussed.     

Estimates of Freud-Christoffel functions for some weights with the whole real line as support

Upper and lower bounds for generalized Christoffel functions, called Freud-Christoffel functions, are obtained. These have the form λ_n,p(W,j,x) = infPW_Lp(R)/|P^(j)(X)| where the infimum is taken over all polynomials P(x) of degree at most n − 1. The upper and lower bounds for λ_n,p(W,j,x) are obtained for all 0 < p ∞ and J = 0, 1, 2, 3,… for weights W(x) = exp(−Q(x)), where, among other things, Q(x) is bounded in [− A, A], and Q″ is continuous in β(−A, A) for some A > 0. For p = ∞, the lower bounds give a simple proof of local and global Markov-Bernstein inequalities. For p = 2, the results remove some restrictions on Q in Freud's work. The weights considered include W(x) = exp(− ¦x¦^α/2), α > 0, and W(x) = exp(− exp(¦x¦)), > 0.     

Representations for the first associated q-classical orthogonal polynomials

Let {p_k(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation D_q(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {p_k⁽¹⁾(x;q)} be associated polynomials of the polynomials {p_k(x; q)}. Explicit forms of the coefficients b_n,k and c_n,k in the expansions

are given in terms of basic hypergeometric functions. Here _k(x) equals x^k if σ⁺(0)=0, or (x;q)_k if σ⁺(1)=0, where σ⁺(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by p_n−1⁽¹⁾(x;q) in a special form, recurrence relations (in k) for b_n,k and c_n,k are obtained in terms of σ and τ.     

On the evaluation of the Eigenvalues of a banded toeplitz block matrix

Let A = (a_ij) be an n × n Toeplitz matrix with bandwidth k + 1, K = r + s, that is, a_ij = a_j−i, i, J = 1,… ,n, a_i = 0 if i > s and if i < -r. We compute p(λ)= det(A - λI), as well as p(λ)/p′(λ), where p′(λ) is the first derivative of p(λ), by using O(k log k log n) arithmetic operations. Moreover, if a_i are m × m matrices, so that A is a banded Toeplitz block matrix, then we compute p(λ), as well as p(λ)/p′(λ), by using O(m³k(log² k + log n) + m²k log k log n) arithmetic operations. The algorithms can be extended to the computation of det(A − λB) and of its first derivative, where both A and B are banded Toeplitz matrices. The algorithms may be used as a basis for iterative solution of the eigenvalue problem for the matrix A and of the generalized eigenvalue problem for A and B.     

Characterization of generalized convex functions by their best approximation in sign-monotone norms

Let {u₀, u₁,… u_{n − 1}} and {u₀, u₁,…, u_n} be Tchebycheff-systems of continuous functions on [a, b] and let f ε C[a, b] be generalized convex with respect to {u₀, u₁,…, u_{n − 1}}. In a series of papers ([1], [2], [3]) D. Amir and Z. Ziegler discuss some properties of elements of best approximation to f from the linear spans of {u₀, u₁,…, u_{n − 1}} and {u₀, u₁,…, u_n} in the L_p-norms, 1 p ∞, and show (under different conditions for different values of p) that these properties, when valid for all subintervals of [a, b], can characterize generalized convex functions. Their methods of proof rely on characterizations of elements of best approximation in the L_p-norms, specific for each value of p. This work extends the above results to approximation in a wider class of norms, called “sign-monotone,” [6], which can be defined by the property: ¦ f(x)¦ ¦ g(x)¦,f(x)g(x) 0, a x b, imply f g . For sign-monotone norms in general, there is neither uniqueness of an element of best approximation, nor theorems characterizing it. Nevertheless, it is possible to derive many common properties of best approximants to generalized convex functions in these norms, by means of the necessary condition proved in [6]. For {u₀, u₁,…, u_n} an Extended-Complete Tchebycheff-system and f ε C⁽ⁿ⁾[a, b] it is shown that the validity of any of these properties on all subintervals of [a, b], implies that f is generalized convex. In the special case of f monotone with respect to a positive function u₀(x), a converse theorem is proved under less restrictive assumptions.     

The Lebesgue Constant for Higher Order Hermite-Fejér Interpolation on the Chebyshev Nodes

For a fixed integer m ≥ 0, and for n = 1, 2, 3, ..., let λ_{2m, n}(x) denote the Lebesgue function associated with (0, 1,..., 2m) Hermite-Fejér polynomial interpolation at the Chebyshev nodes {cos[(2k−1) π/(2n)]: k=1, 2, ..., n}. We examine the Lebesgue constant Λ_{2m, n} max{λ_{2m, n}(x): −1 ≤ x ≤ 1}, and show that Λ_{2m, n} = λ_{m, n}(1), thereby generalising a result of H. Ehlich and K. Zeller for Lagrange interpolation on the Chebyshev nodes. As well, the infinite term in the asymptotic expansion of Λ_{2m, n)} as n → ∞ is obtained, and this result is extended to give a complete asymptotic expansion for Λ_{2, n}.     

Mappings of finite distortion: the degree of regularity

This paper investigates the self-improving integrability properties of the so-called mappings of finite distortion. Let K(x)1 be a measurable function defined on a domain ΩRⁿ, n2, and such that exp(βK(x))L_loc¹(Ω), β>0. We show that there exist two universal constants c₁(n),c₂(n) with the following property: Let f be a mapping in W_loc^1,1(Ω,Rⁿ) with |Df(x)|ⁿK(x)J(x,f) for a.e. xΩ and such that the Jacobian determinant J(x,f) is locally in L¹ log^−c₁(n)βL. Then automatically J(x,f) is locally in L¹ log^c₂(n)βL(Ω). This result constitutes the appropriate analog for the self-improving regularity of quasiregular mappings and clarifies many other interesting properties of mappings of finite distortion. Namely, we obtain novel results on the size of removable singularities for bounded mappings of finite distortion, and on the area distortion under this class of mappings.     

An extremal property of Hermite polynomials

Let H_n be the nth Hermite polynomial, i.e., the nth orthogonal on polynomial with respect to the weight w(x)=exp(−x²). We prove the following: If f is an arbitrary polynomial of degree at most n, such that |f||H_n| at the zeros of H_n+1, then for k=1,…,n we have f^(k)H_n^(k), where · is the norm. This result can be viewed as an inequality of the Duffin and Schaeffer type. As corollaries, we obtain a Markov-type inequality in the norm, and estimates for the expansion coefficients in the basis of Hermite polynomials.     

Matrices dont deux lignes quelconque coïncident dans un nombre donne de positions communes

Le nombre maximal de lignes de matrices seront désignées par:

1. (a) R(k, λ) si chaque ligne est une permutation de nombres 1, 2,…, k et si chaque deux lignes différentes coïncide selon λ positions;

2. (b) S⁰(k, λ) si le nombre de colonnes est k et si chaque deux lignes différentes coïncide selon λ positions et si, en plus, il existe une colonne avec les éléments y₁, y₂, y₃, ou y₁ = y₂ ≠ y₃;

3. (c) T⁰(k, λ) si c'est une (0, 1)-matrice et si chaque ligne contient k unités et si chaque deux lignes différentes contient les unités selon λ positions et si, en plus, il existe une colonne avec les éléments 1, 1, 0.

La fonction T⁰(k, λ) était introduite par Chvátal et dans les articles de Deza, Mullin, van Lint, Vanstone, on montrait que T⁰(k, λ) max(λ + 2, (k − λ)² + k − λ + 1). La fonction S⁰(k, λ) est introduite ici et dans le Théorème 1 elle est étudiée analogiquement; dans les remarques 4, 5, 6, 7 on donne les généralisations de problèmes concernant T⁰(k, λ), S⁰(k, λ), dans la remarque 9 on généralise le problème concernant R(k, λ). La fonction R(k, λ) était introduite et étudiée par Bolton. Ci-après, on montre que R(k, λ) S⁰(k, λ) T⁰(k, λ) d'où découle en particulier: R(k, λ) λ + 2 pour λ k + 1 − (k + 2)^1/2; R(k, λ) = 0(k²) pour k − λ = 0(k); R(k, λ) (k − 1)² − (k + 2) pour k 1191.     

On Rado numbers for

For all integers m3 and all natural numbers a₁,a₂,…,a_m−1, let n=R(a₁,a₂,…,a_m−1) represent the least integer such that for every 2-coloring of the set {1,2,…,n} there exists a monochromatic solution to

a₁x₁+a₂x₂++a_m−1x_m−1=x_m.