Inertia, positive definiteness and p norm of GCD and LCM matrices and their unitary analogs

Abstract

Let S=\x1,x2,…,xn\ be a set of distinct positive integers, and let f be an arithmetical function. The GCD matrix (S)f on S associated with f is defined as the n× n matrix having f evaluated at the greatest common divisor of xi and xj as its ij entry. The LCM matrix [S]f is defined similarly. We consider inertia, positive definiteness and p norm of GCD and LCM matrices and their unitary analogs. Proofs are based on matrix factorizations and convolutions of arithmetical functions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…