arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.5802math.NT
收藏

广义LCM矩阵

Generalized LCM matrices

Antal Bege

摘要:

设$f$为算术函数。由$f$的值以$[i,j]$的最小公倍数$f\big([i,j]\big)$作为其$i,\; j$条目给出的矩阵$[f[i,j]]_{n\times n}$被称为最小公倍数(LCM)矩阵。我们考虑这个矩阵的推广,其中元素的形式为$f\big(n,[i,j]\big)$和$f\big(n,i,j,[i,j]\big)$。

英文摘要:

Let $f$ be an arithmetical function. The matrix $[f[i,j]]_{n\times n}$ given by the value of $f$ in least common multiple of $[i,j]$, $f\big([i,j]\big)$ 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\big(n,[i,j]\big)$ and $f\big(n,i,j,[i,j]\big)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑