ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ℓ(n)\ell(n) be the least positive integer such that ℓ(n)⩾n\ell(n)\geqslant n and every Latin array of order nn with at least ℓ(n)\ell(n) distinct symbols contains a transversal. Akbari–Alipour's unbounded gap conjecture. For every integer cc, there exists a positive integer nn such that

ℓ(n)>n+c.\ell(n)>n+c.

This conjecture asserts that the number of distinct symbols needed to force a transversal can exceed the order by arbitrarily large amounts. The source gives no resolution, so its status 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.