On R-robustly entropy-expansive diffeomorphisms

For a homoclinic class H(p _f ) of f ?? Diff¹(M), f?OH(p _f ) is called R-robustly entropy-expansive if for g in a locally residual subset around f, the set ?? _? (x) = {y ?? M: dist(g ⁿ (x), g ⁿ (y)) ?? g3 (?n ?? ?)} has zero topological entropy for each x ?? H(p _g ). We prove that there exists an open and dense set around f such that for every g in it, H(p _g ) admits a dominated splitting of the form E ?? F ₁ ?? ... ?? F _k ?? G where all of F _i are one-dimensional and non-hyperbolic, which extends a result of Pacifico and Vieitez for robustly entropy-expansive diffeomorphisms. Some relevant consequences are also shown.     

Nonhomogeneous recursions and Generalised Continued Fractions

Consider the (n+1)st order nonhomogeneous recursionX _k+n+1=b _k X _k+n +a _k ⁽ⁿ⁾ X _k+n-1+...+a _k ⁽¹⁾ X _k +X _k .Leth be a particular solution, andf ⁽¹⁾,...,f ⁽ⁿ⁾,g independent solutions of the associated homogeneous equation. It is supposed thatg dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾ andh. If we want to calculate a solutiony which is dominated byg, but dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾, then forward and backward recursion are numerically unstable. A stable algorithm is derived if we use results constituting a link between Generalised Continued Fractions and Recursion Relations.     

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).     

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.     

On the structure of linear graphs

Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n ²/4]+1) contains a circuit ofl edges for every 3 ≦l<c ₂ n, also that everyG(n; [n ²/4]+1) contains ak _e(u _n, u_n) withu _n=[c ₁ logn] (for the definition ofk _e(u _n, u_n) see the introduction). Finally fort>t ₀ everyG(n; [tn ^3/2]) contains a circuit of 2l edges for 2≦l<c ₃ t ². This work was done while the author received support from the National Science Foundation, N.S.F. G.88.     

A Characterization of a Certain Class of Compact Metric Spaces

Compact metric spaces χ of such a kind, that ??_f =??(X), are characterized, ??(X) is the σ-field of BOREL sets and ??_f(X) is the field generated by all open subset of X. Our main result is Theorem 5: If χ is a compact metric space, then the following conditions are equivalent:

• 1 ??_f(X) =??(X).
• 2 card (X) ≦x₀ and there are k, m?N such that card (X^(k)) = m.
• 3 There are k, m?N such that χ is homeomorphic to ω^k · m + 1.

     

Multiple vertex coverings by specified induced subgraphs

Given graphs H₁,…, H_k, let f(H₁,…, H_k) be the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove constructively that f(H₁, H₂) ≤ 2(n(H₁) + n(H₂) − 2); equality holds when H₁ = H ₂ = K_n. We prove that f(H₁, K _n) = n + 2√δ(H₁)n + O(1) as n → ∞. We also determine f(K_{1, m −1}, K _n) exactly. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 180–190, 2000     

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.     

Graphs with unavoidable subgraphs with large degrees

Let ??(n, m) denote the class of simple graphs on n vertices and m edges and let G ∈ ?? (n, m). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a sufficient condition for G to contain a K_{k + 1} in terms of the number of edges in G. In this paper we prove that, for m = αn², α > (k - 1)/2k, G contains a K_{k + 1}, each vertex of which has degree at least f(α)n and determine the best possible f(α). For m = ?n²/4? + 1 we establish that G contains cycles whose vertices have certain minimum degrees. Further, for m = αn², α > 0 we establish that G contains a subgraph H with δ(H) ≥ f(α, n) and determine the best possible value of f(α, n).     

Polynomials and primitive roots in finite fields

The primitive elements of a finite field are those elements of the field that generate the multiplicative group of k. If f(x) is a polynomial over k of small degree compared to the size of k, then f(x) represents at least one primitive element of k. Also f(x) represents an lth power at a primitive element of k, if l is also small. As a consequence of this, the following results holds.Theorem. Let g(x) be a square-free polynomial with integer coefficients. For all but finitely many prime numbers p, there is an integer a such that g(a) is equivalent to a primitive element modulo p.Theorem. Let l be a fixed prime number and f(x) be a square-free polynomial with integer coefficients with a non-zero constant term. For all but finitely many primes p, there exist integers a and b such that a is a primitive element and f(a) ≡ b¹ modulo p.     

Norms of powers of absolutely convergent fourier series

Letf(t) = ∑a _k e ^ikt be infinitely differentiable on R, |f(t)|<1. It is known that under these assumptions ‖ⁿ‖ converges to a finite limitl asn → ∞ (l ² = sec(arga),a = (f′(0))² -f″(0)). We obtain here more precise results: (i) an asymptotic series (in powers ofn ^-1/2) for the Fourier coefficientsa _nk off ⁿ , which holds uniformly ink asn → ∞; (ii) an asymptotic series (this time only powers ofn ^-1 are present!) for ‖f ⁿ ‖; (iii) the fact that ifi ^j f ^(j)(0) is real forj = 1,2,..., 2h + 2 then ‖f ⁿ ‖ = l + o(n ^-h ),n → ∞. More generally, we obtain analogous finite asymptotic expansions whenf is assumed to be differentiable only finitely many times.     

On the Growth of Positive Definite Double Sequences Which Are not Moment Sequences

For every a > 1, there is a function f : N²₀ → R, which is positive semidefinite but not a moment sequence, such that |f(m, n)| ≥ m+ n^a(m+n) for all (m, n). The constant 1 is the best possible.     

On k-ordered Hamiltonian graphs

A Hamiltonian graph G of order n is k-ordered, 2 ≤ k ≤ n, if for every sequence v₁, v₂, …, v_k of k distinct vertices of G, there exists a Hamiltonian cycle that encounters v₁, v₂, …, v_k in this order. Define f(k, n) as the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this article, answering a question of Ng and Schultz, we determine f(k, n) if n is sufficiently large in terms of k. Let g(k, n) = − 1. More precisely, we show that f(k, n) = g(k, n) if n ≥ 11k − 3. Furthermore, we show that f(k, n) ≥ g(k, n) for any n ≥ 2k. Finally we show that f(k, n) > g(k, n) if 2k ≤ n ≤ 3k − 6. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 17–25, 1999     

Anti‐periodic solutions for evolution equations with mappings in the class (S+)

In this paper, we study the existence of anti‐periodic solutions for the first order evolution equation in a Hilbert space H, where G : H → ? is an even function such that ?G is a mapping of class (S₊) and f : ? → ? satisfies f(t + T) = –f(t) for any t ∈ ? with f(·) ∈ L²(0, T; H). (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Approximation by the Bernstein–Durrmeyer Operator on a Simplex

For the Jacobi-type Bernstein–Durrmeyer operator M _n,κ on the simplex T ^d of ℝ ^d , we proved that for f∈L ^p (W _κ ;T ^d ) with 1<p<∞,

Sequences of contractions on L1-spaces

Let T_n, n = 1,2,… be a sequence of linear contractions on the space where is a finite measure space. Let M be the subspace of L¹ for which T_ng → g weakly in L¹ for g?M. If T_n1 → 1 strongly, then T_nf → f strongly for all f in the closed vector sublattice in L¹ generated by M.This result can be applied to the determination of Korovkin sets and shadows in L¹. Given a set G ? L¹, its shadow S(G) is the set of all f?L¹ with the property that T_nf → f strongly for any sequence of contractions T_n, n = 1, 2,… which converges strongly to the identity on G; and G is said to be a Korovkin set if S(G) = L¹. For instance, if 1 ?G, then, where M is the linear hull of G and $\text{B}$_M is the sub-σ-algebra of $\text{B}$ generated by {x?X: g(x) > 0} for g?M. If the measure algebra is separable, has Korovkin sets consisting of two elements.     

On the Slowly Well Orderedness of εo

For α < ε₀, N_α denotes the number of occurrences of ω in the Cantor normal form of α with the base ω. For a binary number-theoretic function f let B(K; f) denote the length n of the longest descending chain (α₀, …, α_n–1) of ordinals <ε₀ such that for all i < n, Nα_i ≤ f (K, i). Simpson [2] called ε₀ as slowly well ordered when B (K; f) is totally defined for f (K; i) = K · (i+ 1). Let |n| denote the binary length of the natural number n, and |n|_k the k-times iterate of the logarithmic function |n|. For a unary function h let L(K; h) denote the function B (K; h₀(K; i)) with h₀(K, i) = K + |i| · |i|_h(i). In this note we show, inspired from Weiermann [4], that, under a reasonable condition on h, the functionL (K; h) is primitive recursive in the inverse h^–1 and vice versa.     

On a nontraditional method of approximation

We study the approximation of functions f(z) that are analytic in a neighborhood of zero by finite sums of the form H _n (z) = H _n (h, f, {λ _k }; z) = Σ _k=1 ⁿ λ _k h(λ _k z), where h is a fixed function that is analytic in the unit disk |z| < 1 and the numbers λ _k (which depend on h, f, and n) are calculated by a certain algorithm. An exact value of the radius of the convergence H _n (z) → f(z), n → ∞, and an order-sharp estimate for the rate of this convergence are obtained; an application to numerical analysis is given.     

On almost sure convergence of Cesaro averages of subsequences of vector-valued functions

A remarkable theorem proved by Komlòs [4] states that if {f_n} is a bounded sequence in L¹(R), then there exists a subsequence {f_nk} and f L¹(R) such that f_nk (as well as any further subsequence) converges Cesaro to f almost everywhere. A similar theorem due to Révész [6] states that if {f_n} is a bounded sequence in L²(R), then there is a subsequence {f_nk} and f L²(R) such that Σ_k=1^∞ a_k(f_nk − f) converges a.e. whenever Σ_k=1^∞ | a_k |² < ∞. In this paper, we generalize these two theorems to functions with values in a Hilbert space (Theorems 3.1 and 3.3).     

Rainbow Numbers for Cycles with Pendant Edges

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f (n, H) is the maximum number of colors in an edge-coloring of K _n with no rainbow copy of H. The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of K _n with rb(n, H) number of colors contains a rainbow copy of H. Certainly rb(n, H) = f(n, H) + 1. Anti-Ramsey numbers were introduced by Erdős et al. [4] and studied in numerous papers. We show that for n ≥ k + 1, where C _k ⁺ denotes a cycle C _k with a pendant edge.