the aim of this paper is to prove a common fixed point theorem for nonexpansive type single valued mappings which include both continuous and discontinuous mappings by relaxing the condition of continuity by weak reciprocally continuous mapping. our result is generalize and extends the corresponding result of jhade et al. [p.k. jhade, a.s. saluja and r. kushwah, coincidence and fixed points of ...

Let S be a polynomial of degree 2n + 2, that is, positive on the real axis, and let w = 1/S on (−∞,∞). We present an explicit formula for the nth orthogonal polynomial and related quantities for the weight w. This is an analogue for the real line of the classical Bernstein-Szegő formula for (−1, 1). 1. The result The Bernstein-Szegő formula provides an explicit formula for orthogonal polynomial...

the reciprocal degree distance (rdd)‎, ‎defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances‎, ‎that is‎, ‎$rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u)‎ + ‎d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index‎, ‎just as the degree distance is a weight version of the wiener index‎. ‎in this paper‎, ‎we present exact formu...

This paper gives a sharp lower bound on the spectral radius ρ(A) of a reciprocal Perron–Frobenius matrix A ∈ M2g(Z), and shows in particular that ρ(A) ≥ (3 + √ 5)/2. This bound supports conjectures on the minimal entropy of pseudo-Anosov maps. The proof is based on a study of the curve complex of a directed graph.

this study investigated the effect of reciprocal teaching (rt) on efl learners’ reading comprehension. fifty intermediate learners participated in the study and were sampled as the experimental (n = 25) and control groups (n = 25). participants were male and ranged in age from 15 to 16. the reading section of key english test (ket, 2010) was used as the pretest to assess the participants’ entry...

We compute the rst N coeecients of the reciprocal r(x) of a given polynomial p(x), (r(x)p(x) = 1 mod x N , p(0) 6 = 0), by using, under the PRAM arithmetic models , O(h log N) time-steps and O((N=h)(1 + 2 ?h log (h) N)) processors, for any h, h = 1; 2; : : : ; log N, provided that O(log m) steps and m processors suuce to perform DFT on m points and that log (0)

Using the Stickelberger-Swan theorem, the parity of the number of irreducible factors of a self-reciprocal even-degree polynomial over a finite field will be hereby characterized. It will be shown that in the case of binary fields such a characterization can be presented in terms of the exponents of the monomials of the self-reciprocal polynomial.

Let Hm(z) be a sequence of polynomials whose generating function ∑∞ m=0 Hm(z)t m is the reciprocal of a bivariate polynomial D(t, z). We show that in the three cases D(t, z) = 1 + B(z)t + A(z)t, D(t, z) = 1 + B(z)t + A(z)t and D(t, z) = 1 + B(z)t + A(z)t, where A(z) and B(z) are any polynomials in z with complex coefficients, the roots of Hm(z) lie on a portion of a real algebraic curve whose e...