Displaying 401 – 420 of 941

Showing per page

Lower bounds for the largest eigenvalue of the gcd matrix on { 1 , 2 , , n }

Jorma K. Merikoski (2016)

Czechoslovak Mathematical Journal

Consider the n × n matrix with ( i , j ) ’th entry gcd ( i , j ) . Its largest eigenvalue λ n and sum of entries s n satisfy λ n > s n / n . Because s n cannot be expressed algebraically as a function of n , we underestimate it in several ways. In examples, we compare the bounds so obtained with one another and with a bound from S. Hong, R. Loewy (2004). We also conjecture that λ n > 6 π - 2 n log n for all n . If n is large enough, this follows from F. Balatoni (1969).

Matrix problems and stable homotopy types of polyhedra

Yuriy Drozd (2004)

Open Mathematics

This is a survey of the results on stable homotopy types of polyhedra of small dimensions, mainly obtained by H.-J. Baues and the author [3, 5, 6]. The proofs are based on the technique of matrix problems (bimodule categories).

Matrix-Variate Statistical Distributions and Fractional Calculus

Mathai, A., Haubold, H. (2011)

Fractional Calculus and Applied Analysis

MSC 2010: 15A15, 15A52, 33C60, 33E12, 44A20, 62E15 Dedicated to Professor R. Gorenflo on the occasion of his 80th birthdayA connection between fractional calculus and statistical distribution theory has been established by the authors recently. Some extensions of the results to matrix-variate functions were also considered. In the present article, more results on matrix-variate statistical densities and their connections to fractional calculus will be established. When considering solutions of fractional...

Currently displaying 401 – 420 of 941