ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Open questions in higher-dimensional combinatorics include: can the asymptotic bounds for the number L_n of n x n Latin squares be improved; what are the corresponding higher-dimensional counting problems; are there higher-dimensional analogues of the Gamma function; and what is the largest rank of an n x n x n real tensor? The report conjectures that the latter maximum is (1+o(1)) n^2/2.

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.