Using the notion of quantum integers associated with a complex number q 6= 0, we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q-Jacobi polynomials when |q| < 1, and for the special value q = (1 − √ 5)/(1 + √ 5) they are closely related to Hankel matrices of reciprocal Fibonacci numbers called Filbert matrices. We find a formu...

We study asymptotic spectral properties of the generalized Hilbert -matrix for large order . First, general , we deduce distribution eigenvalues outside origin. Second, formulas small are derived. Third, in classical case also prove In particular, obtain an expansion improving Wilf’s formula best constant truncated Hardy’s inequality.

Using the notion of quantum integers associated with a complex number q 6= 0, we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q-Jacobi polynomials when |q| < 1, and for the special value q = (1 − √ 5)/(1 + √ 5) they are closely related to Hankel matrices of reciprocal Fibonacci numbers called Filbert matrices. We find a formu...

An iterative algorithm is described, based on the replication process of the Hilbert matrix, for encoding and decoding the Hilbert order. The time complexity of the proposed algorithm is smaller than those published previously, and the space complexity is bounded by a constant. Moreover, the new algorithm has a wider applicability when compared with existing algorithms for certain machine-word ...