Stieltjes- and Geronimus-type polynomials

This work is an extension to the formal case of a previous work by Monegato [5].A Stieltjes-type polynomial is a polynomial of degree (n + 1), E_n+1, orthogonal with respect to the functional \s{;c̃_i = c(P_n(x)xⁱ), i = 0, 1, 2,…\s}, where c is a functional defined by the series f(t) = ∑^∞_i=0c_itⁱ. E_n+1 is of important use in the estimation of the error in Padé approximation. An iteration of the construction of E_n+1 is attempted. (Sections 1, 2, 3, 4).In the last section, we study the properties of the polynomial S_n associated with E_n+1 with respect to another functional c̄. S_n is called a Geronimus-type polynomial. It is shown that S_n verifies the system c(P_nS_nG_k) = 0 for k = 1,…,n, where the G_k's are orthogonal with respect to c̄.     

Centralizers of generalized derivations on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2, with Utumi quotient ring U and extended centroid C, δ a nonzero derivation of R, G a nonzero generalized derivation of R, and f(x ₁, …, x _n ) a noncentral multilinear polynomial over C. If δ(G(f(r ₁, …, r _n ))f(r ₁, …, r _n )) = 0 for all r ₁, …, r _n ∈ R, then f(x ₁, …, x _n )² is central-valued on R. Moreover there exists a ∈ U such that G(x) = ax for all x ∈ R and δ is an inner derivation of R such that δ(a) = 0.     

The periods of the sequences generated by some symmetric shift registers

E_k(x₂,…, x_n) is defined by E_k(a₂,…, a_n) = 1 if and only if ∑_i=2ⁿa_i = k. We determine the periods of sequences generated by the shift registers with the feedback functions x₁ + E_k(x₂,…, x_n) and x₁ + E_k(x₂,…, x_n) + E_k+1(x₂,…, x_n) over the field GF(2).     

An even-order three-point boundary value problem on time scales

We study the even-order dynamic equation (−1)ⁿx^(Δ∇)n(t)=λh(t)f(x(t)), t∈[a,c] satisfying the boundary conditions x^(Δ∇)i(a)=0 and x^(Δ∇)i(c)=βx^(Δ∇)i(b) for 0?i?n−1. The three points a,b,c are from a time scale , where 0<β(b−a)<c−a for b∈(a,c), β>0, f is a positive function, and h is a nonnegative function that is allowed to vanish on some subintervals of [a,c] of the time scale.     

A symmetry relationship for a class of partitions

Let S(n, k, v) denote the number of vectors (a₀,…, a_n?1) with nonnegative integer components that satisfy a₀ + … + a_{n ? 1} = k and Σ_i=0^n?1ia_i ≡ v (mod n). Two proofs are given for the relation S(n, k, v) = S(k, n, v). The first proof is by algebraic enumeration while the second is by combinatorial construction.     

Interpolation by Integer-Valued Polynomials

LetRbe a Krull ring with quotient fieldKanda₁,…,a_ninR. If and only if thea_iare pairwise incongruent mod every height 1 prime ideal of infinite index inRdoes there exist for all valuesb₁,…,b_ninRan interpolating integer-valued polynomial, i.e., anf ∈ K[x] withf(a_i) = b_iandf(R) ⊆ R.IfSis an infinite subring of a discrete valuation ringR_vwith quotient fieldKanda₁,…,a_ninSare pairwise incongruent mod allM^k_v ∩ Sof infinite index inS, we also determine the minimald(depending on the distribution of thea_iamong residue classes of the idealsM^k_v ∩ S) such that for allb₁,…,b_n ∈ R_vthere exists a polynomialf ∈ K[x] of degree at mostdwithf(a_i) = b_iandf(S) ⊆ R_v.     

Interlacing properties and the Schur-Szegő composition

Each degree n polynomial in one variable of the form (x+1)(x ^n?1+c ₁ x ^n?2+???+c _n?1) is representable in a unique way as a Schur-Szeg? composition of n?1 polynomials of the form (x+1) ^n?1(x+a _i ), see Kostov (2003), Alkhatib and Kostov (2008) and Kostov (Mathematica Balkanica 22, 2008). Set $\sigma _{j}:=\sum _{1\leq i_{1}<\cdots <i_{j}\leq n-1}a_{i_{1}}\cdots a_{i_{j}}$ . The eigenvalues of the affine mapping (c ₁,…,c _n?1)?(σ ₁,…,σ _n?1) are positive rational numbers and its eigenvectors are defined by hyperbolic polynomials (i.e. with real roots only). In the present paper we prove interlacing properties of the roots of these polynomials.     

An Annihilator Condition with Generalized Derivations on Multilinear Polynomials

Let R be a non-commutative prime ring of characteristic different from 2, U its right Utumi quotient ring, C its extended centroid, F a generalized derivation on R, and f(x ₁,…, x _n ) a noncentral multilinear polynomial over C. If there exists a ∈ R such that, for all r ₁,…, r _n  ∈ R, a[F ²(f(r ₁,…, r _n )), f(r ₁,…, r _n )] = 0, then one of the following statements hold: 1. a = 0;

2. There exists λ ∈C such that F(x) = λx, for all x ∈ R;

3. There exists c ∈ U such that F(x) = cx, for all x ∈ R, with c ² ∈ C;

4. There exists c ∈ U such that F(x) = xc, for all x ∈ R, with c ² ∈ C.

     

A new inequality for symmetric functions

Let x_i ≥ 0, y_i ≥ 0 for i = 1,…, n; and let a_j(x) be the elementary symmetric function of n variables given by a_j(x) = ∑_{1 ≤ ii < … <ij ≤ n}x_ii … x_ij. Define the partical ordering x <y if a_j(x) ≤ a_j(y), j = 1,… n. We show that $\text{x}\text{\$}\text{?}\text{y ? x}{}^{\mathrm{\alpha }}\text{\$}\text{?}\text{y}{}^{\mathrm{\alpha }}\text{, 0}\text{\$}\text{?}\text{α ≤ 1}$, where {x^α}_i = x^α_i. We also give a necessary and sufficient condition on a function f(t) such that x <y ? f(x) <f(y). Both results depend crucially on the following: If x <y there exists a piecewise differentiable path z(t), with z_i(t) ≥ 0, such that z(0) = x, z(1) = y, and z(s) <z(t) if 0 ≤ s ≤ t ≤ 1.     

Affine and combinatorial binary m-spaces

Let V(n) denote the n-dimensional vector space over the 2-element field. Let a(m, r) (respectively, c(m, r)) denote the smallest positive integer such that if n ? a(m, r) (respectively, n ? c(m, r)), and V(n) is arbitrarily partitioned into r classes C_i, 1 ? i ? r, then some class C_i must contain an m-dimensional affine (respectively, combinatorial) subspace of V(n). Upper bounds for the functions a(m, r) and c(m, r) are investigated, as are upper bounds for the corresponding “density functions” $\text{a}\text{(m, ?)}$ and $\text{c}\text{(m, ?)}$.     

Divisibility properties of power GCD matrices and power LCM matrices

Let a,b and n be positive integers and the set S={x₁,…,x_n} of n distinct positive integers be a divisor chain (i.e. there exists a permutation σ on {1,…,n} such that x_σ(1)|…|x_σ(n)). In this paper, we show that if a|b, then the ath power GCD matrix (S^a) having the ath power (x_i,x_j)^a of the greatest common divisor of x_i and x_j as its i,j-entry divides the bth power GCD matrix (S^b) in the ring M_n(Z) of n×n matrices over integers. We show also that if a?b and n?2, then the ath power GCD matrix (S^a) does not divide the bth power GCD matrix (S^b) in the ring M_n(Z). Similar results are also established for the power LCM matrices.     

Existence of stable equilibrium point for dynamical systems of Volterra type

This paper presents sufficient conditions for the existence of a nonnegative and stable equilibrium point of a dynamical system of Volterra type, (1) $\text{(}\text{d}\text{dt}\text{) x}{}_{\mathrm{i}}\text{(t) = ?x}{}_{\mathrm{i}}\text{(t)[f}{}_{\mathrm{i}}\text{(x}{}_1\text{(t),…, x}{}_{\mathrm{n}}\text{(t)) ? q}{}_{\mathrm{i}}\text{], i = 1,…, n}$, for every q = (q₁,…, q_n)^T?Rⁿ. Results of a nonlinear complementarity problem are applied to obtain the conditions. System (1) has a nonnegative and stable equilibrium point if (i) f(x) = (f₁(x),…,f_n(x))^T is a continuous and differentiable M-function and it satisfies a certain surjectivity property, or (ii), f(x) is continuous and strongly monotone on R₊₀ⁿ.     

The probability that k positive integers are relatively r-prime

If r, k are positive integers, then $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ denotes the number of k-tuples of positive integers (x₁, x₂, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r = 1. An explicit formula for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ is derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}\text{n}{}^{\mathrm{k}}\text{=}\text{1}\text{ζ(rk)}$.If S = {p₁, p₂, …, p_a} is a finite set of primes, then 〈S〉 = {p₁^a₁p₂^a₂…p_s^a_s; p_i ∈ S and a_i ≥ 0 for all i} and $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ denotes the number of k-tuples (x₁, x₃, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r ∈ 〈S〉. Asymptotic formulas for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ are derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}\text{n}{}^{\mathrm{k}}\text{=}\text{(p}{}_1\text{… p}{}_{\mathrm{a}}\text{)}{}^{\mathrm{rk}}\text{ζ(rk)(p}{}_1{}^{\mathrm{rk}}\text{? 1) … (p}{}_{\mathrm{s}}{}^{\mathrm{rk}}\text{? 1)}$.     

On a characterization of irreducibility of a non-negative matrix

Let A denote an n×n matrix with all its elements real and non-negative, and let r_i be the sum of the elements in the ith row of A, i=1,…,n. Let B=A?D(r₁,…,r_n), where D(r₁,…,r_n) is the diagonal matrix with r_i at the position (i,i). Then it is proved that A is irreducible if and only if rank B=n?1 and the null space of B^T contains a vector d whose entries are all non-null.     

Prime interchange graphs of classes of matrices of zeros and ones

Let R = (r₁,…, r_m) and S = (s₁,…, s_n) be nonnegative integral vectors, and let $\text{U}$(R, S) denote the class of all m × n matrices of 0's and 1's having row sum vector R and column sum vector S. An invariant position of $\text{U}$(R, S) is a position whose entry is the same for all matrices in $\text{U}$(R, S). The interchange graph G(R, S) is the graph where the vertices are the matrices in $\text{U}$(R, S) and where two matrices are joined by an edge provided they differ by an interchange. We prove that when 1 ≤ r_i ≤ n ? 1 (i = 1,…, m) and 1 ≤ s_j ≤ m ? 1 (j = 1,…, n), G(R, S) is prime if and only if $\text{U}$(R, S) has no invariant positions.     

A new form of trigonometric orthogonality and Gaussian-type quadrature

Gauss's (2n+1)-point trigonometric interpolation formula, based upon f(x_i), i = 1(1)2n+1, gives a trigonometric sum of the n^th order, S_2n+1(x = a₀ + ∑_jⁿ = 1^(a_jcos jx + b_jsin jx), which may be integrated to provide formulas for either direct quadrature or stepwise integration of differential equations having periodic (or near-periodic) solutions. An “orthogonal” trigonometric sum S_2r+1(x) is one that satisfies

$\text{∫}{}_{\mathrm{a}}{}^{\mathrm{b}}\text{S}{}_{\mathrm{2r+1}}\text{(x)S}{}_{\mathrm{2r\prime +1}}\text{(x)dx=0, r′<r}$

and two other arbitrarily imposable conditions needed to make S_2r1(x) unique. Two proofs are given of a fundamental factor theorem for any S_2n+1(x) (somewhat different from that for polynomials) from which we derive 2r-point Gaussian-type quadrature formulas, r = [n/2] + 1, which are exact for any S_4r?1(x). We have

$\text{∫}{}_{\mathrm{a}}{}^{\mathrm{b}}\text{S}{}_{\mathrm{4r?1(x)}}\text{dx=∑}{}_{\mathrm{j=1}}{}^{\mathrm{2r}}\text{A}{}_{\mathrm{j}}\text{S}{}_{\mathrm{4r?1}}\text{(x}{}_{\mathrm{j}}\text{)}$

where the nodes x_j, j = 1(1)2r, are the zeros of the orthogonal S_2r+1(x). It is proven that A_j > 0 and that 2r-1 of the nodes must lie within the interval [a,b], and the remaining node (which may or may not be in [a,b]) must be real. Unlike Legendre polynomials, any [a′,b′] other than a translation of [a,b], requires different and unrelated sets of nodes and weights. Gaussian-type quadrature formulas are applicable to the numerical integration of the Gauss (2n+1)-point interpolation formulas, with extra efficiency when the latter are expressed in barycentric form. S_2r+1(x), x_jandA_j, j = 1(1)2r, were calculated for [a,b] = [0, π/4], 2r = 2 and 4, to single-precision accuracy.     

On monotone functions of tree structures

Let T be a rooted tree structure with n nodes a₁,…,a_n. A function f: {a₁,…,a_n} into {1 < ? < k} is called monotone if whenever a_i is a son of a_j, then f(a_i) ≥ f(a_j). The average number of monotone bijections is determined for several classes of tree structures. If k is fixed, for the average number of monotone functions asymptotic equivalents of the form c · ?^?nn^{?$\text{3}\text{2}$} (n → ∞) are obtained for several classes of tree structures.     

Permanence and Positive Periodic Solutions for Kolmogorov Competing Species Systems

We prove the existence of periodic solutions in a compact attractor of (R⁺)ⁿ for the Kolmogorov system x′_i = x_if_i(t, x₁, …, x_n), i = l, …, n in the competitive case. Extension to differential delay equations are con- sidered too. Applications are given to Lotka-Volterra systems with periodic coefficients.     

Some explicit formulae in simultaneous padé approximation

Using old results on the explicit calculation of determinants, formulae are given for the coefficients of P₀(z) and P₀(z)f_i(z) ? P_i(z), where P_i(z) are polynomials of degree σ ? ρ_i (i=0,1,…,n), P₀(z)f_i(z) ? P_i(z) are power series in which the terms with z^k, 0?k?σ, vanish (i=1,2,…,n), (ρ₀,ρ₁,…,ρ_n) is an (n+1)-tuple of nonnegative integers, σ=ρ₀+ρ₁+?+ρ_n, and {f_i}ⁿ_i=1 is the set of hypergeometric functions {₁F₁(1;c_i;z)}ⁿ_i=1$\text{(c}{}_{\mathrm{i}}\text{?}\text{Z}\text{z.drule;}\text{N}\text{, c}{}_{\mathrm{i}}\text{? c}{}_{\mathrm{j}}\text{?}\text{Z}\text{)}$ or {₂F₀(a_i,1;z)}ⁿ_i=1$\text{(a}{}_{\mathrm{i}}\text{?}\text{Z}\text{?}\text{N}\text{, a}{}_{\mathrm{i}}\text{? a}{}_{\mathrm{j}}\text{?}\text{Z}\text{)}$ under the condition ρ₀?ρ_i ? 1 (i=1,2,…,n).