ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa and bb be positive integers with a∣ba\mid b, and let SS be a finite gcd-closed set of positive integers. For each x∈Sx\in S, let GS(x)G_S(x) denote the set of greatest-type divisors of xx in SS. Two distinct greatest-type divisors y1,y2y_1,y_2 of xx satisfy condition G\mathcal G if [y1,y2]=x[y_1,y_2]=x and (y1,y2)∈GS(y1)∩GS(y2)(y_1,y_2)\in G_S(y_1)\cap G_S(y_2). The set SS satisfies condition G\mathcal G if every x∈Sx\in S either has ∣GS(x)∣≤1|G_S(x)|\leq 1, or has ∣GS(x)∣≥2|G_S(x)|\geq 2 and every two distinct greatest-type divisors of xx satisfy condition G\mathcal G. Let [Sa][S^a] and [Sb][S^b] denote the corresponding power LCM matrices, and let M∣S∣(Z)M_{|S|}(\mathbb Z) be the ring of ∣S∣×∣S∣|S|\times|S| integer matrices. Hong's conjecture. If SS is gcd-closed and satisfies condition G\mathcal G, then [Sa][S^a] divides [Sb][S^b] in M∣S∣(Z)M_{|S|}(\mathbb Z); equivalently, there is a matrix B∈M∣S∣(Z)B\in M_{|S|}(\mathbb Z) such that [Sb]=B[Sa][S^b]=B[S^a] or [Sb]=[Sa]B[S^b]=[S^a]B. Hong's conjecture extends the known result for FC sets, since every FC set is gcd-closed and satisfies condition G\mathcal G, but its general case remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.