Determinants of matrices associated with arithmetic functions on finitely many quasi-coprime divisor chains

Shuangnian Hu, Shaofang Hong and Jianrong Zhao

Applied Mathematics and Computation, 2015, vol. 258, issue C, 502-508

Abstract: Let S={x1,…,xn} be a set of n distinct positive integers and f be an arithmetic function. We use f(S)=f(xi,xj) (resp. f[S]=f[xi,xj]) to denote the n×n matrix having f evaluated at the greatest common divisor (resp. the least common multiple) of xi and xj as its i,j-entry. The set S is called a divisor chain if there is a permutation σ of {1,…,n} such that xσ(1)|…|xσ(n). If S can be partitioned as S=⋃i=1kSi with all Si(1⩽i⩽k) being divisor chains and (max(Si), max(Sj))=gcd(S) for 1⩽i≠j⩽k, then we say that S consists of finitely many quasi-coprime divisor chains. In this paper, we introduce a new method to give the formulas for the determinants of the matrices (f(S)) and (f[S]) on finitely many quasi-coprime divisor chains S. We show also that det(f(S))|det(f[S]) holds under some natural conditions. These extend the results obtained by Tan and Lin (2010) and Tan et al. (2013), respectively.

Keywords: Arithmetic function; Finitely many quasi-coprime divisor chains; Determinant (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315001058
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:258:y:2015:i:c:p:502-508

DOI: 10.1016/j.amc.2015.01.073

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().