On the additive complexity of GCD and LCM matricesстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 19 декабря 2016 г.
Аннотация:In the paper, the additive complexity of matrices formed by positive integer powers of greatest common divisors and least common multiples of the indices of the rows and columns is considered. It is proved that the complexity of the n x n matrix formed by the numbers GCD (r) (i, k) over the basis {x + y} is asymptotically equal to rn log(2) n as n -> a, and the complexity of the n x n matrix formed by the numbers LCM (r) (i, k) over the basis {x + y,-x} is asymptotically equal to 2rn log(2) n as n -> a.