The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 2 of 2

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).

Currently displaying 1 – 2 of 2

Page 1