ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S=s1,…,snS=\\{s_1,\ldots,s_n\\} be an ordered set of distinct positive integers. Let T[S]\mathcal{T}_{[S]} denote the mmth-order, nn-dimensional GCD tensor on SS, and let Φ\Phi denote the arithmetic function appearing in its diagonal factorization. A set SS is factor-closed if every positive divisor of each element of SS also belongs to SS. Determinant lower-bound conjecture. One has

det⁡(T[S])≥∏i=1nΦ(si)(m−1)(n−1),\det(\mathcal{T}_{[S]})\geq \prod_{i=1}^{n}\Phi(s_i)^{(m-1)^{(n-1)}},

with equality if and only if SS is factor-closed. The conjecture extends the determinant formula proved for factor-closed sets to arbitrary sets of distinct positive integers; it is based on numerical evidence, and no resolution is supplied in the source.

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.