Blumenthal''s Theorem for Laurent Orthogonal Polynomials

We investigate polynomials satisfying a three-term recurrence relation of the form B_n(x)=(x−β_n)B_n−1(x)−α_nxB_n−2(x), with positive recurrence coefficients α_n+1,β_n (n=1,2,…). We show that the zeros are eigenvalues of a structured Hessenberg matrix and give the left and right eigenvectors of this matrix, from which we deduce Laurent orthogonality and the Gaussian quadrature formula. We analyse in more detail the case where α_n→α and β_n→β and show that the zeros of B_n are dense on an interval and that the support of the Laurent orthogonality measure is equal to this interval and a set which is at most denumerable with accumulation points (if any) at the endpoints of the interval. This result is the Laurent version of Blumenthal's theorem for orthogonal polynomials.     

Minimum degree of minimal defect -extendable bipartite graphs

A near perfect matching is a matching saturating all but one vertex in a graph. If G is a connected graph and any n independent edges in G are contained in a near perfect matching, then G is said to be defect n-extendable. If for any edge e in a defect n-extendable graph G, G−e is not defect n-extendable, then G is minimal defect n-extendable. The minimum degree and the connectivity of a graph G are denoted by δ(G) and κ(G) respectively. In this paper, we study the minimum degree of minimal defect n-extendable bipartite graphs. We prove that a minimal defect 1-extendable bipartite graph G has δ(G)=1. Consider a minimal defect n-extendable bipartite graph G with n≥2, we show that if κ(G)=1, then δ(G)≤n+1 and if κ(G)≥2, then 2≤δ(G)=κ(G)≤n+1. In addition, graphs are also constructed showing that, in all cases but one, there exist graphs with minimum degree that satisfies the established bounds.     

On strongly α-preinvex functions

In this paper, by means of a series of counterexamples, we study in a systematic way the relationships among (pseudo, quasi) α-preinvexity, (strict, strong, pseudo, quasi) α-invexity and (strict, strong, pseudo, quasi) αη-monotonicity. Results obtained in this paper can be viewed as a refinement and improvement of the results of Noor and Noor [M.A. Noor, K.I. Noor, Some characterizations of strongly preinvex functions, J. Math. Anal. Appl. 316 (2006) 697–706].     

On optimal simultaneous rational approximation to with being some kind of cubic algebraic function

It is shown that each rational approximant to (ω,ω²)^τ given by the Jacobi–Perron algorithm (JPA) or modified Jacobi–Perron algorithm (MJPA) is optimal, where ω is an algebraic function (a formal Laurent series over a finite field) satisfying ω³+kω-1=0 or ω³+kdω-d=0. A result similar to the main result of Ito et al. [On simultaneous approximation to (α,α²) with α³+kα-1=0, J. Number Theory 99 (2003) 255–283] is obtained.     

Distributions of class Lα

L_α (0 α 1) is a class of infinitely divisible distributions defined by restricting the measure in the Levy-Khinchin formula to a special form. When α = 1, L_α is just the classical class L. Several properties for L_α classes, which are similar to the most important properties for the class L, are established. Also, a conjecture of Wolfe about unimodality of some L_α distributions is disproved by giving a counterexample.     

The asymptotic behavior of quadratic forms in -mixing random variables

Let {Z_i,i≥1} be a linear process defined by with {d_j,j≥0} being a regular varying sequence of real numbers and {ξ_t,−∞<t<∞} being a sequence of -mixing random variables. The present paper studies the asymptotic behavior of the quadratic form under some mild assumptions on d_j and ξ_t. Meanwhile, the similar results of α-mixing random variables are presented.     

Continuous mappings on subspaces of products with the κ-box topology

Much of General Topology addresses this issue: Given a function fC(Y,Z) with YY^′ and ZZ^′, find , or at least , such that ; sometimes Z=Z^′ is demanded. In this spirit the authors prove several quite general theorems in the context Y^′=(X_I)_κ=∏_iIX_i in the κ-box topology (that is, with basic open sets of the form ∏_iIU_i with U_i open in X_i and with U_i≠X_i for <κ-many iI). A representative sample result, extending to the κ-box topology some results of Comfort and Negrepontis, of Noble and Ulmer, and of Hušek, is this. Theorem Let ωκα (that means: κ<α, and [β<α and λ<κ]β^λ<α) with α regular, be a set of non-empty spaces with each d(X_i)<α, π[Y]=X_J for each non-empty JI such that |J|<α, and the diagonal in Z be the intersection of <α-many regular-closed subsets of Z×Z. Then (a) Y is pseudo-(α,α)-compact, (b) for every fC(Y,Z) there is J[I]^<α such that f(x)=f(y) whenever x_J=y_J, and (c) every such f extends to .     

A generalized mixed vector variational-like inequality problem

In this paper, we introduce relaxed η-α-P-monotone mapping, and by utilizing KKM technique and Nadler’s Lemma we establish some existence results for the generalized mixed vector variational-like inequality problem. Further, we give the concepts of η-complete semicontinuity and η-strong semicontinuity and prove the solvability for generalized mixed vector variational-like inequality problem without monotonicity assumption by applying the Brouwer’s fixed point theorem. The results presented in this paper are extensions and improvements of some earlier and recent results in the literature.     

Busy period analysis of queue: Lattice path approach

In this paper, we find the busy period density of queues in explicit computational form, through lattice path (LP) approach. Both the arrival and service time distributions are approximated by 2-phase Cox distribution C₂, which has a Markovian property enabling us to use LP combinatorics. Since any distribution with rational Laplace–Stieltjes transform (LST) and square coefficient of variation (CV²) lying in [1/2,∞) can be approximated by a C₂([M. Agarwal, K. Sen, B. Borkakaty, Busy period density of queueing system C₃/M/1, Journal of Combinatorics, Information and Systems Sciences 31 (1–4) (2006) 127–161]), the results obtained would be applicable to a very wide class of distributions occurring in real life.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part II: Clenshaw–Lord Type Approximants

Laurent–Padé (Chebyshev) rational approximants P _m (w,w ^–1)/Q _n (w,w ^–1) of Clenshaw–Lord type [2,1] are defined, such that the Laurent series of P _m /Q _n matches that of a given function f(w,w ^–1) up to terms of order w ^±(m+n), based only on knowledge of the Laurent series coefficients of f up to terms in w ^±(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 of P _m matches that of Q _n f up to terms of order w ^±(m+n), but based on knowledge of the series coefficients of f up to terms in w ^±(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 all m0, n0. 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.     

A countable Fréchet–Urysohn space of uncountable character

We shall construct a countable Fréchet–Urysohn α₄ not α₃ space X such that all finite powers of X are Fréchet–Urysohn.     

Free <Emphasis Type="Italic">G</Emphasis>-spaces and maximal equivariant compactifications

For a compact Lie group G we prove that every free (resp., semifree) G-space admits a based-free (resp., semifree) G-compactification. Examples of finite- and infinite-dimensional G-spaces are presented that do not admit a free or based-free G-compactification. We give several characterizations of the maximal G-compactification β_GX that are further applied to prove the formula (β_GX)/H=β_G/H(X/H) for arbitrary closed normal subgroup H⊂G. Mathematics Subject Classification (2000) 54H15, 54D35     

Onα-Symmetric Multivariate Characteristic Functions

Ann-dimensional random vector is said to have anα-symmetric distribution,α>0, if its characteristic function is of the form((|u₁|^α+…+|u_n|^α)^1/α). We study the classesΦ_n(α) of all admissible functions: [0, ∞)→ . It is known that members ofΦ_n(2) andΦ_n(1) are scale mixtures of certain primitivesΩ_nandω_n, respectively, and we show thatω_nis obtained fromΩ_2n−1byn−1 successive integrations. Consequently, curious relations between 1- and 2- (or spherically) symmetric distributions arise. An analogue of Askey's criterion gives a partial solution to a question of D. St. P. Richards: If(0)=1,is continuous, lim_t→∞ (t)=0, and⁽²ⁿ⁻²⁾(t) is convex, thenΦ_n(1). The paper closes with various criteria for the unimodality of anα-symmetric distribution.     

Minimal Lp projections by Fourier, Taylor, and Laurent series

In appropriate function space settings, it is proved that the Fourier, Taylor, and Laurent series projections are minimal in all L_p norms (1 p ∞). This result unifies and extends known results for the Fourier, Taylor, and Laurent projections in L_∞ and for the Fourier projection in L₁. The proof is based on a generalisation of a kernel summation formula due to Berman.     

Generalized Hodges-Lehmann estimators for the analysis of variance

For X_i, …, X_n a random sample and K(·, ·) a symmetric kernel this paper considers large sample properties of location estimator satisfying , . Asymptotic normality of is obtained and two forms of interval estimators for parameter θ satisfying EK(X₁ − θ, X₂ − θ) = 0, are discussed. Consistent estimation of the variance parameters is obtained which permits the construction of asymptotically distribution free procedures. The p-variate and multigroup extension is accomplished to provide generalized one-way MANOVA. Monte Carlo results are included.     

Strong converse inequalities for Baskakov operators

We give a strong converse inequality of type B in terms of unified K-functional K_λ^α( f,t²)(0λ1, 0<α<2) for Baskakov operators.     

Discrete Fourier–Neumann series

Let J_μ denote the Bessel function of order μ. The systemwith n=0,1,…,α>−1, and where p_s denotes the sth positive zero of J_α(ax), is orthonormal in . In this paper, we study the mean convergence of the Fourier series with respect to this system. Also, we describe the space in which the span of the system is dense.     

Summability of orthogonal expansions of several variables

Summability of spherical h-harmonic expansions with respect to the weight function ∏_j=1^d |x_j|^2κ_j (κ_j0) on the unit sphere S^d−1 is studied. The main result characterizes the critical index of summability of the Cesàro (C,δ) means of the h-harmonic expansion; it is proved that the (C,δ) means of any continuous function converge uniformly in the norm of C(S^d−1) if and only if δ>(d−2)/2+∑_j=1^d κ_j−min_1jd κ_j. Moreover, it is shown that for each point not on the great circles defined by the intersection of the coordinate planes and S^d−1, the (C,δ) means of the h-harmonic expansion of a continuous function f converges pointwisely to f if δ>(d−2)/2. Similar results are established for the orthogonal expansions with respect to the weight functions ∏_j=1^d |x_j|^2κ_j(1−|x|²)^μ−1/2 on the unit ball B^d and ∏_j=1^d x_j^κ_j−1/2(1−|x|₁)^μ−1/2 on the simplex T^d. As a related result, the Cesàro summability of the generalized Gegenbauer expansions associated to the weight function |t|^2μ(1−t²)^λ−1/2 on [−1,1] is studied, which is of interest in itself.     

Implicit vector equilibrium problems with applications

Let X and Y be Hausdorff topological vector spaces, K a nonempty, closed, and convex subset of X, C : K → 2^Y a point-to-set mapping such that for any χ ε K, C(χ) is a pointed, closed, and convex cone in Y and int C(χ) ≠ 0. Given a mapping g : K → K and a vector valued bifunction f : K × K → Y, we consider the implicit vector equilibrium problem (IVEP) of finding χ^* ε K such that f g(χ^*), y) -int C(χ) for all y ε K. This problem generalizes the (scalar) implicit equilibrium problem and implicit variational inequality problem. We propose the dual of the implicit vector equilibrium problem (DIVEP) and establish the equivalence between (IVEP) and (DIVEP) under certain assumptions. Also, we give characterizations of the set of solutions for (IVP) in case of nonmonotonicity, weak C-pseudomonotonicity, C-pseudomonotonicity, and strict C-pseudomonotonicity, respectively. Under these assumptions, we conclude that the sets of solutions are nonempty, closed, and convex. Finally, we give some applications of (IVEP) to vector variational inequality problems and vector optimization problems.