Identities involving generalized Fibonacci-type polynomials

In this paper we consider a family of generalized Fibonacci-type polynomials. These polynomials have a lot of similar properties to the generalized Jacobsthal-type polynomials. As an extension of the work of Djordjevi? [G.B. Djordjevi?, Mixed convolutions of the Jacobsthal type, Appl. Math. Comput. 186 (2007) 646-651], we give some recurrence relations and identities involving the generalized Fibonacci-type polynomials.     

A class of inequalities for non-negative sequences

В работе для неотрица тельных последовате льностей (...,a _?1 ⁱ ), aa ₀ ⁱ ),a ₁ ⁱ ), ...), удовлетв оряющих условию \(0< \mathop {\sup }\limits_k a_k^{(i)}< \infty\) (i=1,...,т), доказ а но неравенство (1) $$\begin{gathered} \mathop \sum \limits_{k = - \infty }^\infty \mathop {\sup }\limits_{k \leqq k_1 + \ldots + k_m \leqq k + l} (a_{k_1 }^{(1)} \ldots a_{k_m }^{(m)} ) \geqq \hfill \\ \geqq \mathop \prod \limits_{i = 1}^m (\mathop {\sup }\limits_{ - \infty< k< \infty } a_k^{(i)} )\left[ {\mathop \sum \limits_{i = 1}^m \frac{{\mathop \sum \limits_{k = - \infty }^\infty (a_k^{(i)} )^{p_i } }}{{(\mathop {\sup }\limits_{ - \infty< k< \infty } a_k^{(i)} )^{p_i } }} + l - m + 1} \right], \hfill \\ \end{gathered}$$ гдеl произвольное не отрицательное целое число, 1≦p ₁, ...,p _m ≦∞ и \(\mathop \sum \limits_{i = 1}^m p_i^{ - 1} = 1\) . Это неравенство явля ется обобщением и уто чнением неравенств А. Прекопа, Ш. Данча и Л. Лейндлера. Доказано также, что ес ли все последователь ности содержат только коне чное число ненулевых членов, то н еобходимым условием для равенства в (1) является существование такого числа α>0, чтоa _k( ⁱ )=а илиa _k( ⁱ )=0 для всехi=1,...,m;?∞<k<∞.     

On a class of Riesz-Fischer sequences

In this note, we give necessary and sufficient conditions for a system of complex exponentials to form a Riesz-Fischer sequence in for every positive number . The result provides a significant strengthening of the sufficient conditions recently stated by R. M. Reid (1995).

     

A class of square-free monomial ideals associated to two integer sequences

Given two finite sequences of positive integers α and β, we associate a square-free monomial ideal I_α,β in a ring of polynomials S, and we recursively compute the algebraic invariants of S∕I_α,β. Also, we give precise formulas in special cases.     

Fibonacci-type polynomial as a trajectory of a discrete dynamical system

Families of polynomials which obey the Fibonacci recursion relation can be generated by repeated iterations of a 2×2 matrix,Q ₂, acting on an initial value matrix,R ₂. One matrix fixes the recursion relation, while the other one distinguishes between the different polynomial families. Each family of polynomials can be considered as a single trajectory of a discrete dynamical system whose dynamics are determined byQ ₂. The starting point for each trajectory is fixed byR ₂(x). The forms of these matrices are studied, and some consequences for the properties of the corresponding polynomials are obtained. The main results generalize to the so-calledr-Bonacci polynomials.     

On a class of relatively prime sequences

For each natural number n, let a₀(n) = n, and if a₀(n),…,a_i(n) have already been defined, let a_i+1(n) > a_i(n) be minimal with (a_i+1(n), a₀(n) … a_i(n)) = 1. Let g(n) be the largest a_i(n) not a prime or the square of a prime. We show that g(n) ～ n and that $\text{g(n) > n + cn}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{log}\text{(n)}$ for some c > 0. The true order of magnitude of g(n) ? n seems to be connected with the fine distribution of prime numbers. We also show that “most” a_i(n) that are not primes or squares of primes are products of two distinct primes. A result of independent interest comes of one of our proofs: For every sufficiently large n there is a prime $\text{p < n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ with [$\text{n}\text{p}$] composite.     

On the limits of a class of sequences

The matrix diagonalization method is used to solve a limit problem.     

Renewal theorem for a class of stationary sequences

Summary A renewal theorem is obtained for stationary sequences of the form _n=(...,X _n-1,X _n,X _n+1...), whereX _n, , are i.i.d. r.v.s. valued in a Polish space. This class of processes is sufficiently broad to encompass functionals of recurrent Markov chains, functionals of stationary Gaussian processes, and functionals of one-dimensional Gibbs states. The theorem is proved by a new coupling construction.Research supported by the National Science Foundation     

A dominant subset of V-shaped sequences for a class of single machine sequencing problems

In this note we define a subset of V-shaped sequences, ‘V-shaped about T’, which generalize ‘V-shaped about d’ sequences. We derive a condition under which this subset contains an optimal sequence for a class of single machine sequencing problems. Cost functions from the literature are used to illustrate our results.     

A newer class of numerical sequences and its applications to sine and cosine series

We prove three theorems for sequences of γ group bounded variation, which are analogues of the theorems proved earlier for monotone, or quasi-monotone sequences, or sequences of rest bounded variation.     

A new class of numerical sequences and its applications to sine and cosine series

First, it is proved that the class of classical quasi-monotone sequences is not comparable to the newly defined class of sequences of rest bounded variation. Considering this result, we prove three sample theorems for sequences of rest bounded variation, being analogues of the theorems proved earlier for monotone or quasi-monotone sequences. One of them gives a partial answer to a question raised by R. P. Boas Jr.     

Transfinite sequences of continuous and Baire class 1 functions

The set of continuous or Baire class 1 functions defined on a metric space is endowed with the natural pointwise partial order. We investigate how the possible lengths of well-ordered monotone sequences (with respect to this order) depend on the space .

     

Stability of the notion of approximating class of sequences and applications

Given an approximating class of sequences {{B_n,m}_n}_m for {A_n}_n, we prove that (X⁺ being the pseudo-inverse of Moore–Penrose) is an approximating class of sequences for , where {A_n}_n is a sparsely vanishing sequence of matrices A_n of size d_n with d_k>d_q for k>q,k,qN. As a consequence, we extend distributional spectral results on the algebra generated by Toeplitz sequences, by including the (pseudo) inversion operation, in the case where the sequences that are (pseudo) inverted are distributed as sparsely vanishing symbols. Applications to preconditioning and a potential use in image/signal restoration problems are presented.