Divisibility among power GCD and power LCM matrices on certain gcd-closed sets

Abstract

Let (x, y) and [x, y] denote the greatest common divisor and the least common multiple of the integers x and y respectively. We denote by |T| the number of elements of a finite set T. Let a,b and n be positive integers and let S=\x1, ..., xn\ be a set of n distinct positive integers. We denote by (Sa) (resp. [Sa]) the n× n matrix whose (i,j)-entry is the ath power of (xi,xj) (resp. [xi,xj]). For any x∈ S, define GS(x):=\d∈ S: d<x, d|x \ and \ (d|y|x, y∈ S)⇒ y∈ \d,x\\. In this paper, we show that if a|b and S is gcd closed (namely, (xi, xj)∈ S for all integers i and j with 1 i, j n) and x∈ S\|GS (x)|\=2 and the condition G being satisfied (i.e., any element x∈ S satisfies that either |GS(x)| 1, or GS(x)=\y1,y2\ satisfying that [y1,y2]=x and (y1,y2)∈ GS(y1) GS(y2)), then (Sa)|(Sb), (Sa)|[Sb] and [Sa]|[Sb] hold in the ring Mn( Z). Furthermore, we show the existences of gcd-closed sets S such that S does not satisfy the condition G and such factorizations are true. Our result extends the Feng-Hong-Zhao theorem gotten in 2009. This also partially confirms a conjecture raised by Hong in [S.F. Hong, Divisibility among power GCD matrices and power LCM matrices, Bull. Aust. Math. Soc., doi:10.1017/S0004972725100361].

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…