Generalized LCM matrices

2011/08/30 by Antal Bege, Bege, Antal
Computer Science · Engineering · Mathematics · #11A25 #11C20 #15A36 #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Number Theory (math.NT) #graph theory and CDMA systems #math.NT #msc:11A25 #msc:11C20 #msc:15A36

paper · pdf · doi:10.48550/arxiv.1108.5802

6 pages

arxiv created 2011/08/30 · openalex publication_date 2011/08/30 · arxiv updated 2011/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let f be an arithmetical function. The matrix [f[i,j]]_{n× n} given by the value of f in least common multiple of [i,j], f([i,j]) as its i, j entry is called the least common multiple (LCM) matrix. We consider the generalization of this matrix where the elements are in the form f(n,[i,j]) and f(n,i,j,[i,j]).

Related

• On property of least common multiple to be a D-magic number
• The lcm(1,2,...,n) as a product of sine values sampled over the points in Farey sequences
• Nair's and Farhi's identities involving the least common multiple of binomial coefficients are equivalent
• On the distribution of lcm of k-tuples and related problems
• An identity involving the least common multiple of binomial coefficients and its application