Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part II: Clenshaw-Lord type approximants

Laurent-Padé (Chebyshev) rational approximantsP _m (w, w ⁻¹)/Q _n (w, w ⁻¹) of Clenshaw-Lord type [2,1] are defined, such that the Laurent series ofP _m /Q _n matches that of a given functionf(w, w ⁻¹) up to terms of orderw ^±(m+n) , based only on knowledge of the Laurent series coefficients off up to terms inw ^±(m+n) . This contrasts with the Maehly-type approximants [4,5] defined and computed in part I of this paper [6], where the Laurent series ofP _m matches that ofQ _n f up to terms of orderw ^±(m+n ), but based on knowledge of the series coefficients off up to terms inw ^±(m+2n). The Clenshaw-Lord method is here extended to be applicable to Chebyshev polynomials of the 1st, 2nd, 3rd and 4th kinds and corresponding rational approximants and Laurent series, and efficient systems of linear equations for the determination of the Padé-Chebyshev coefficients are obtained in each case. Using the Laurent approach of Gragg and Johnson [4], approximations are obtainable for allm≥0,n≥0. Numerical results are obtained for all four kinds of Chebyshev polynomials and Padé-Chebyshev approximants. Remarkably similar results of formidable accuracy are obtained by both Maehly-type and Clenshaw-Lord type methods, thus validating the use of either.     

On classification of immersions ofn-manifolds in (2n−1)-manifolds

Under the assumption of (f, M ⁿ ,N ²ⁿ⁻¹) being trivial, the classification of immersions homotopic tof: M ⁿ →N ²ⁿ⁻¹ is obtained in many cases. The triviality of (f, M ⁿ ,P ²ⁿ⁻¹) is proved for anyM ⁿ andf. LetM, N be differentiable manifolds of dimensionn and2n−1 respectively. For a mapf: M → N, denote byI[M, N] _f the set of regular homotopy classes of immersions homotopic tof. It has been proved in [1] that, whenn>1,I[M, N] _f is nonempty for anyf. In this paper we will determine the setI[M, N] _f in some cases. For example, ifN=P ²ⁿ⁻¹ or more generally, the lens spacesS _m ²ⁿ⁻¹ =Z _m /S ²ⁿ⁻¹,M is any orientablen-manifold or nonorientable butn≡0, 1, 3 mod 4, then, for anyf, theI[M, N] _f is determined completely. WhenN=R ²ⁿ⁻¹, the setI[M, N] of regular homotopy classes of all immersions has been enumerated by James and Thomas in [2] and McClendon in [3] forn>3. Applying our results toN=R ²ⁿ⁻¹ we obtain their results again, except for the casen≡2 mod 4 andM nonorientable. Whenn=3, McClendon's results cannot be used. Our results include the casesn=3,M orientable or not (for orientableM, I[M, R⁵] is known by Wu [4]).     

The braid group B4 is linear

We study a linear representation ρ:B _n ? GL _m (Z[q ^±1,t ^±1]) with m=n(n-1)/2. We will show that for n=4, this representation is faithful. We prove a relation with the new Charney length function. We formulate a conjecture implying that ρ is faithful for all n. Oblatum 15-VI-1999 & 24-II-2000?Published online: 18 September 2000     

Sign changes in rational L w 1 -approximation

Let f ∈ L _w ¹ [−1, 1], let r _n,m(f) be the best rational L _w ¹ -approximation for f with respect to real rational functions of degree at most n in the numerator and of degree at most m in the denominator, let m = m(n), and let lim _{n → ∞} (n-m(n)) = ∞. In this case, we show that the counting measures of certain subsets of sign changes of f-r _n,m (f) converge weakly to the equilibrium measure on [−1, 1] as n → ∞. Moreover, we prove estimates for discrepancy between these counting measures and the equilibrium measure. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 2, pp. 283–287, February, 2006.     

The nearness problems for symmetric centrosymmetric with a special submatrix constraint

We say that X=[x_ij]_i,j=1ⁿX=[x_{ij}]_{i,j=1}^n is symmetric centrosymmetric if x _ij  = x _ji and x _{n − j + 1,n − i + 1}, 1 ≤ i,j ≤ n. In this paper we present an efficient algorithm for minimizing ||AXA ^T  − B|| where ||·|| is the Frobenius norm, A ∈ ℝ ^m×n , B ∈ ℝ ^m×m and X ∈ ℝ ^n×n is symmetric centrosymmetric with a specified central submatrix [x _ij ] _{p ≤ i,j ≤ n − p} . Our algorithm produces a suitable X such that AXA ^T  = B in finitely many steps, if such an X exists. We show that the algorithm is stable any case, and we give results of numerical experiments that support this claim.     

P4k?1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k − 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k−1-factorization of λK _m,n is (1) (2k − 1)m ⩽ 2kn, (2) (2k − 1)n ⩽ 2km, (3) m + n ≡ 0 (mod 4k − 1), (4) λ(4k − 1)mn/[2(2k − 1)(m + n)] is an integer.     

Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that

Divisibility properties of certain recurrent sequences

Let g and m be two positive integers, and let F be a polynomial with integer coefficients. We show that the recurrent sequence x₀ = g, x_n = x _n−1 ⁿ + F(n), n = 1, 2, 3,…, is periodic modulo m. Then a special case, with F(z) = 1 and with m = p > 2 being a prime number, is considered. We show, for instance, that the sequence x₀ = 2, x_n = x _n−1 ⁿ + 1, n = 1, 2, 3, …, has infinitely many elements divisible by every prime number p which is less than or equal to 211 except for three prime numbers p = 23, 47, 167 that do not divide x_n. These recurrent sequences are related to the construction of transcendental numbers ζ for which the sequences [ζ^n!], n = 1, 2, 3, …, have some nice divisibility properties. Bibliography: 18 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 322, 2005, pp. 76–82.     

I sottogruppi del gruppo modulare con coefficienti del corpo di Jacobi-Eisenstein e un teorema sui gruppi finiti

Sommario Introduzione — § 1 – 1. L'indice μ(n) dei sottogruppi Г_μ(n) del gruppo Γ di sostituzioni lineari unimodulari con coefficienti del campo diJacobi-Eisenstein — 2. Il poliedro fondamentale del sottogruppo Г_μ(1−ε) — § 2 – 3. I campi fondamentali dei gruppi Г_μ(n) — 4. Impossibilità di limitare con un numero finito di piani e sfere di riflessione i poliedri fondamentali dei gruppi Г_μ(n), conn intero razionale pari, diverso da 2 — § 3 – 5. Relazioni fondamentali fra le sostituzioni generatrici del gruppo di sostituzioni lineari con coefficienti del corpo K_ε con determinante ±1 — § 4 – 6. Sulla indipendenza delle sostituzioniS,T,U, generatrici del gruppo finito G_2μ(n) e sulle loro relazioni caratteristiche nel gruppo G_2μ(n) — § 5 – 7. Dimostrazione del teorema fondamentale sui gruppi G_2μ(n). Lemmi preliminari — 8, Dimostrazione del teorema fondamentale nel caso di moduli primi con 2(1−ε) — § 6 – 9. Il teorema fondamentale per i modulim(1−ε), 3m, 2m, 2m(1−ε), 6m conm primo con 6 – 10. Immagine geometrica dei gruppi G_2μ(1−ε) — § 7 – 11. Il gruppo delle sostituzioni unimodulari , [c/1+4ma]=+1, e il caso eccezionale dei moduli 4m – 12. Il gruppo delle sostituzioni unimodulari [c/1+3m(1−ε)a]₃=+1 e il caso eccezionale dei moduli 3(1−ε)m.     

A counterexample to the dominating set conjecture

The metric polytope met _n is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities x _ij − x _ik − x _jk ≤ 0 and x _ij + x _ik + x _jk ≤ 2 for all triples i, j, k of {1,..., n}. In 1992 Monique Laurent and Svatopluk Poljak conjectured that every fractional vertex of the metric polytope is adjacent to some integral vertex. The conjecture holds for n ≤ 8 and, in particular, for the 1,550,825,600 vertices of met₈. While the overwhelming majority of the known vertices of met₉ satisfy the conjecture, we exhibit a fractional vertex not adjacent to any integral vertex.     

Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^k n ^-a, whereP _n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x ²) ^k f ^(2k)(x)∈C[−1,1] is established. A similar result is shown forE _n(f)= ‖f−P _n‖ _C[−1,1]. Rates other thann ^-a are also discussed. Supported by NSERC grant A4816 of Canada.     

Embedding ofl ∞ k in finite dimensional Banach spaces

Letx ₁,x ₂, ...,x _n ben unit vectors in a normed spaceX and defineM _n =Ave{‖Σ _i=1 ⁿ ε₁ x _i ‖:ε₁=±1}. We prove that there exists a setA⊂{1, ...,n} of cardinality such that {x _i } _i∈A is 16M _n -isomorphic to the natural basis ofl _∞ ^k . This result implies a significant improvement of the known results concerning embedding ofl _∞ ^k in finite dimensional Banach spaces. We also prove that for every ∈>0 there exists a constantC(∈) such that every normed spaceX _n of dimensionn either contains a (1+∈)-isomorphic copy ofl ₂ ^m for somem satisfying ln lnm≧1/2 ln lnn or contains a (1+∈)-isomorphic copy ofl _∞ ^k for somek satisfying ln lnk>1/2 ln lnn−C(∈). These results follow from some combinatorial properties of vectors with ±1 entries. The contribution of the first author to this paper forms part of his Ph.D. Thesis written under the supervision of Prof. M. A. Perles from the Hebrew University.     

Lower bound in the Bernstein inequality for the first derivative of algebraic polynomials

We prove that max |p′(x)|, where p runs over the set of all algebraic polynomials of degree not higher than n ≥ 3 bounded in modulus by 1 on [−1, 1], is not lower than ( n - 1 ) \mathord

Multidimensional analog of the Hardy condition for power series

In the middle of the 20th century Hardy obtained a condition which must be imposed on a formal power series f(x) with positive coefficients in order that the series f ⁻¹(x) = $ \sum\limits_{n = 0}^\infty {b_n x^n } $ \sum\limits_{n = 0}^\infty {b_n x^n } b _n x ⁿ be such that b ₀ > 0 and b _n ≤ 0, n ≥ 1. In this paper we find conditions which must be imposed on a multidimensional series f(x ₁, x ₂, …, x _m ) with positive coefficients in order that the series f ⁻¹(x ₁, x ₂, …, x _m ) = $ \sum i_1 ,i_2 , \ldots ,i_m \geqslant 0^b i_1 ,i_2 , \ldots ,i_m ^{x_1^{i_1 } x_2^{i_2 } \ldots x_m^{i_m } } $ \sum i_1 ,i_2 , \ldots ,i_m \geqslant 0^b i_1 ,i_2 , \ldots ,i_m ^{x_1^{i_1 } x_2^{i_2 } \ldots x_m^{i_m } } satisfies the property b _{0, …, 0} > 0, $ bi_1 ,i_2 , \ldots ,i_m $ bi_1 ,i_2 , \ldots ,i_m ≤ 0, i ₁² + i ₂² + … + i _m ² > 0, which is similar to the one-dimensional case.     

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

Symmetric block bases of sequences with large average growth

We show that if 0<ε≦1, 1≦p<2 andx ₁, …,x _n is a sequence of unit vectors in a normed spaceX such thatE ‖∑ _l ⁿ ε_i x _l‖≧n ^1/p, then one can find a block basisy ₁, …,y _m ofx ₁, …,x _n which is (1+ε)-symmetric and has cardinality at leastγn ^2/p-1(logn)⁻¹, where γ depends on ε only. Two examples are given which show that this bound is close to being best possible. The first is a sequencex ₁, …,x _n satisfying the above conditions with no 2-symmetric block basis of cardinality exceeding 2n ^2/p-1. This sequence is not linearly independent. The second example is a sequence which satisfies a lowerp-estimate but which has no 2-symmetric block basis of cardinality exceedingCn ^2/p-1(logn)^4/3, whereC is an absolute constant. This applies when 1≦p≦3/2. Finally, we obtain improvements of the lower bound when the spaceX containing the sequence satisfies certain type-condition. These results extend results of Amir and Milman in [1] and [2]. We include an appendix giving a simple counterexample to a question about norm-attaining operators.     

Inverting the Satake map for <Emphasis Type="Italic">Sp</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> and applications to Hecke operators

By compatibly grading the p-part of the Hecke algebra associated to Sp _n (ℤ) and the subring of ℚ[x ₀^±1,…,x _n ^±1] invariant under the associated Weyl group, we produce a matrix representation of the Satake isomorphism restricted to the corresponding finite dimensional components. In particular, using the elementary divisor theory of integral matrices, we show how to determine the entries of this matrix representation restricted to double cosets of a fixed similitude. The matrix representation is upper-triangular, and can be explicitly inverted. To address the specific question of characterizing families of Hecke operators whose generating series have “Euler” products, we define (n+1) families of polynomial Hecke operators t _k ⁿ (p ^ℓ ) (in ℚ[x ₀^±1,…,x _n ^±1]) for Sp _n whose generating series ∑t _k ⁿ (p ^ℓ )v ^ℓ are rational functions of the form q _k (v)⁻¹, where q _k is a polynomial in ℚ[x ₀^±1,…,x _n ^±1][v] of degree (2 ⁿ if k=0). For k=0 and k=1 the form of the polynomial is essentially that of the local factors in the spinor and standard zeta functions. For k>1, these appear to be new expressions. Taking advantage of the generating series and our ability to explicitly invert the Satake isomorphism, we explicitly compute the classical operators with the analogous properties in the case of genus 2. It is of interest to note that these operators lie in the full, but not generally the integral, Hecke algebra.      

Embeddings ofl p m intol ∞ n , 1≦p≦2

Isomorphic embeddings ofl _l ^m intol _∞ ⁿ are studied, and ford(n, k)=inf{‖T ‖ ‖T ⁻¹ ‖;T varies over all isomorphic embeddings ofl ₁ ^[klog2n] intol _∞ ⁿ we have that lim _n→∞ d(n, k)=γ(k)⁻¹,k>1, whereγ(k) is the solution of (1+γ)ln(1+γ)+(1 −γ)ln(1 −γ)=k ⁻¹ln4. Here [x] denotes the integer part of the real numberx.     

A family of counterexamples in ergodic theory

LetT _α be the translationx↦x+α (mod 1) of [0, 1), α irrational. LetT be the Lebesgue measure-preserving automorphism ofX=[0, 3/2) defined byTx = x + 1 forx∈[0, 1/2),Tx=T _α(x−1) forx∈[1,3/2) andTx = T _α x forx∈[1/2, 1), i.e.T isT _α with a tower of height one built over [0, 1/2). If α is poorly approximable by rationals (there does not exist {p _n /q _n } with |α−p _n /q _n |=o(q _n ⁻²)) and λ is a measure onX ^k all of whose one-dimensional marginals are Lebesgue and which is ⊗ _{i − 1} ^k T ¹ invariant and ergodic (l>0) then λ is a product of off-diagonal measures. This property suffices for many purposes of counterexample construction. A connection is established with the POD (proximal orbit dense) condition in topological dynamics. Research supported in part by NSF contract MCS-8003038.     

Notes on the Borwein-Choi conjecture of Littlewood cyclotomic polynomials

Borwein and Choi conjectured that a polynomial P（x） with coefficients ±1 of degree N - 1 is cyclotomic iff
P（x）=±Φp1（±x）ΦP2（±x^p1）…Φpr（±x^p1p2…pr-1）,
where N = P1P2 … pτ and the pi are primes, not necessarily distinct. Here Φ（x） ：= （x^p - 1）/（x - 1） is the p-th cyclotomic polynomial. They also proved the conjecture for N odd or a power of 2. In this paper we introduce a so-called E-transformation, by which we prove the conjecture for a wider variety of cases and present the key as well as a new approach to investigate the coniecture.