The aim of this paper is to study multidimensional continued fraction algorithm over the field of formal power series. In the case of the Brun algorithm by using its homogenous version, we prove that it converges.

No abstract

The aim of this article is to prove the irreducibility of the polynomialWe discuss in particular connections between the irreducible polynomials and the number of Pisot elements in the case of formal power series.

In this paper, we obtain a generalization of [6,8]. Firstly, we consider the so-called r−circulant matrices with generalized Fibonacci numbers and then found lower and upper bounds for the Euclidean and spectral norms of these matrices. Afterwards, we present some bounds for the spectral norms of Hadamard and Kronecker product of these matrices.2010 MSC: 15B05, 15A60, 65F35