Factors for ¦N,pn;δ¦k summability of Fourier series

In this paper two theorems on | N,p_n;δ|_k summability factors, which generalize the results of Bor [4] on | N,p_n|k summability factors, have been proved.     

A note on absolute summability factors

In this paper, by using an almost increasing and δ-quasi-monotone sequence, a general theorem on φ- | C, α | _k summability factors, which generalizes a result of Bor [3] on φ |C, 1| _k summability factors, has been proved under weaker and more general conditions.     

A general theorem characterizing some absolute summability methods

A general theorem is given which gives the necessary and sufficient conditions satisfied by a sequence (ε_n) in order to have the series Σa _n ε _n summable to |A| whenever Σa _n is summable to |A| for some summability methodA.     

Absolute summability of infinite series

It is shown in [4] that if a normal matrix,A satisfies some conditions then |C,1| _k summability implies |A| _k summability wherek≥1. In the present paper, we consider the converse implication.     

On absolute summability factors of infinite series

In this paper using δ-quasi-monotone sequences a theorem on summability factors of infinite series, which generalizes a theorem of Bor [4] on summability factors of infinite series, is proved. Also, in the special case this theorem includes a result of Mazhar [8] on |C, 1|_k summability factors.     

Improvement of one inequality for algebraic polynomials

We prove that the inequality ||g (·/ n ) ||_L1[-1,1] ||P_n+k||_L1[-1,1] ￡ 2 ||gP_n+k||_L1[-1,1]\vert\vert g (\cdot / n ) \vert\vert_{L_{1}[-1,1]} \vert\vert P_{n+k}\vert\vert_{L_{1}[-1,1]} \leq 2 \vert\vert gP_{n+k}\vert\vert_{L_{1}[-1,1]}, where g : [-1, 1]→ℝ is a monotone odd function and P _n+k is an algebraic polynomial of degree not higher than n + k, is true for all natural n for k = 0 and all natural n ≥ 2 for k = 1. We also propose some other new pairs (n, k) for which this inequality holds. Some conditions on the polynomial P _n+k under which this inequality turns into the equality are established. Some generalizations of this inequality are proposed.     

Generalized absolute Cesaro summability of a Fourier series

In an attempt to study the scope of a theorem due to Pati, the authors have established that φ(t) logK|t∈B _u V in (0,π)⟹ΣA _n (x) is |C, 0,β| forβ>1, at the pointt = x.     

On Enomoto’s problems in a bipartite graph

In this paper, we obtain the following result: Let k, n ₁ and n ₂ be three positive integers, and let G = (V ₁,V ₂;E) be a bipartite graph with |V1| = n ₁ and |V ₂| = n ₂ such that n ₁ ⩾ 2k + 1, n ₂ ⩾ 2k + 1 and |n ₁ − n ₂| ⩽ 1. If d(x) + d(y) ⩾ 2k + 2 for every x ∈ V ₁ and y ∈ V ₂ with xy $ \notin $ \notin E(G), then G contains k independent cycles. This result is a response to Enomoto’s problems on independent cycles in a bipartite graph.     

General absolute summability factor theorems involving quasi-power-increasing sequences

In this paper a general theorem concerning the |A,δ|_k summability methods has been proved, which generalizes two results of Şevli and Leindler [H. Şevli and L. Leindler, On the absolute summability factors of infinite series involving quasi-power-increasing sequences, Computers and Mathematics with Applications 57 (2009), 702–709]. We obtain sufficient conditions for ∑a_nλ_n to be summable |A,δ|_k, k1, 0δ<1/k, by using quasi-power-increasing sequences.     

Univalent functions without common values

In this paper we establish inequalities involving moduli of derivatives |f′ _k (0)| of functions f _k univalent in the unit disk |z| < 1 having no common values and translating zero into a point on the segment [−1, 1], k = 1, …, n. We estimate f _k by means of Schwarzian derivatives.     

Expanders obtained from affine transformations

A bipartite graphG=(U, V, E) is an (n, k, δ, α) expander if |U|=|V|=n, |E|≦kn, and for anyX⊆U with |X|≦αn, |Γ _G (X)|≧(1+δ(1−|X|/n)) |X|, whereΓ _G (X) is the set of nodes inV connected to nodes inX with edges inE. We show, using relatively elementary analysis in linear algebra, that the problem of estimating the coefficientδ of a bipartite graph is reduced to that of estimating the second largest eigenvalue of a matrix related to the graph. In particular, we consider the case where the bipartite graphs are defined from affine transformations, and obtain some general results on estimating the eigenvalues of the matrix by using the discrete Fourier transform. These results are then used to estimate the expanding coefficients of bipartite graphs obtained from two-dimensional affine transformations and those obtained from one-dimensional ones.     

On 2‐factors of a bipartite graph

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2‐factor with exactly k components? We will prove that if G = (V₁, V₂, E) is a bipartite graph with |V₁| = |V₂| = n ≥ 2k + 1 and δ (G) ≥ ⌈n/2⌉ + 1, then G contains a 2‐factor with exactly k components. We conjecture that if G = (V₁, V₂; E) is a bipartite graph such that |V₁| = |V₂| = n ≥ 2 and δ (G) ≥ ⌈n/2⌉ + 1, then, for any bipartite graph H = (U₁, U₂; F) with |U₁| ≤ n, |U₂| ≤ n and Δ (H) ≤ 2, G contains a subgraph isomorphic to H. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 101–106, 1999     

Teoremi merceriani relativi a trasformazioni regolari non negative e anche più generali

Sunto Ad una successione (complessa) |s_n| associamo la successione trasformata |t_n| mediante una matrice di sommazione regolare C; sono noti teoremi merceriani (per es.G. H. Hardy, E. R. Love) che dalla relazione s_n — qt_n → (1 — q)l deducono s_n → l, sotto la condizione che il moltiplicatore q sia interno a determinati campi In questa NOta si considera C regolare non negativa e, mediante l'introduzione di un' opportuna ? funzione di aderenza di un insieme in un altro ? e l'applicazione del classico teorema del ? nocciolo ? diK. Knopp, si determinano campi più ampi di quello circolare stabilito daE. R. Love; si estende il risultato anche a matrici C regolari più generali mediante teoremi più recenti diR. P. Agnew eA. Robinson; inoltre si perfeziona il classico teorema diJ. Mercer-G. H. Hardy.

---

Summary Let |t_n| be trasformed, by a regular summation matrix C, of a (complex) sequence |s_n|. Mercerian theorems (e. g. G. H. Hardy, E. R. Love theorems) deduce s_n → l from s_n — qt_n → (1 — q)l if q lies in a suitable domain. This paper is concerned with regular non-negative C. A suitable ? adherence-function of a set into another ? is introduced and theKnopp's ? Core theorem ? leads to wider domains thanE. R. Love circle. The result is extended to more general regular matrices C by means ofR. P. Agnew andA. Robinson theorems. The classicalJ. Mercer-G. H. Hardy theorem is also improved.

---

---

A Giovanni Sansone nel suo 70^mo compleanno.

---

Il presente lavoro è stato oggetto di una comunicazione al VI Congresso Nazionale della Unione Matematica Italiana (Napoli, 11–16 settembre 1959).     

Cesàro Asymptotics for Orthogonal Polynomials on the Unit Circle and Classes of Measures

The convergence in L²( ) of the even approximants of the Wall continued fractions is extended to the Cesàro–Nevai class CN, which is defined as the class of probability measures σ with lim_n→∞ ∑ⁿ⁻¹_k=0 |a_k|=0, {a_n}_n0 being the Geronimus parameters of σ. We show that CN contains universal measures, that is, probability measures for which the sequence {|_n|² dσ}_n0 is dense in the set of all probability measures equipped with the weak-* topology. We also consider the “opposite” Szeg class which consists of measures with ∑^∞_n=0 (1−|a_n|²)^1/2<∞ and describe it in terms of Hessenberg matrices.     

Generalization of the fricke theorem on entire functions of finite index

We prove that, for every sequence (a _k) of complex numbers satisfying the conditions Σ(1/|a _k |) < ∞ and |a _k+1| − |a _k | ↗ ∞ (k → ∞), there exists a continuous functionl decreasing to 0 on [0, + ∞] and such thatf(z) = Π(1 −z/|a _k |) is an entire function of finitel-index.     

Functions of bounded boundary rotation

Classes of functionsU _k, which generalize starlike functions in the same manner that the classV _k of functions with boundary rotation bounded bykπ generalizes convex functions, are defined. The radius of univalence and starlikeness is determined. The behavior off _α(z) = ∫ ₀ ^z [f'(t)]^α dt is determined for various classes of functions. It is shown that the image of |z|<1 underV _kfunctions contains the disc of radius 1/k centered at the origin, andV _k functions are continuous in |z|≦1 with the exception of at most [k/2+1] points on |z|=1.     

A note on absolute weighted mean summability factors

In this paper we have proved a main theorem concerning the | $\bar N$ , p _n; δ |_k summability methods, which generalizes a result of Bor and Özarslan [3].     

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.     

Moment inequalities and weak convergence for negatively associated sequences

A probability inequality for S_n and somepth moment (p⩾2) inequalities for |S_n| and max 1⩽k⩽n | S_k| are established. Here S_n is the partial sum of a negatively associated sequence. Based on these inequalities, a weak invariance principle for strictly stationary negatively associated sequences is proved under some general conditions. Project supported by the National Natural Science Foundation of China, the Doctoral Program Foundation of the State Education Commission of China and the High Eductional Natural Science Foundation of Guangdong Province.     

Spanning k-Trees of n-Connected Graphs

A tree is called a k-tree if the maximum degree is at most k. We prove the following theorem, by which a closure concept for spanning k-trees of n-connected graphs can be defined. Let k ≥ 2 and n ≥ 1 be integers, and let u and v be a pair of nonadjacent vertices of an n-connected graph G such that deg _G (u) + deg _G (v) ≥ |G| − 1 − (k − 2)n, where |G| denotes the order of G. Then G has a spanning k-tree if and only if G + uv has a spanning k-tree.