ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be a non-negative real number, and let

AN:={A∈⋃k∈N∖{0}Mk(R≥0) ∣ satisfying 1,2,3 above}.\mathcal{A}_N:=\left\{A\in\bigcup_{k\in\mathbb{N}\setminus\{0\}}M_k(\mathbb{R}_{\geq 0})~|~\text{satisfying } 1,2,3\text{ above}\right\}.

Here, conditions 1, 2, and 3 are respectively that AA is nilpotent, that the sum of all entries of AA is NN, and that every index has a positive sum of its outgoing and incoming entries. Also, [N][N] denotes the integer part of NN.

Adjacency-matrix supremum conjecture. For every k∈{1,…,[N]}k\in\{1,\ldots,[N]\},

sup⁡A∈AN{∑all i,j(Ak)ij}=(Nk)k.\sup_{A\in\mathcal{A}_N}\left\{\sum_{{\rm all}~i,j}\left(A^k\right)_{ij}\right\}=\left(\frac{N}{k}\right)^k.

This extends the preceding extremal statement from adjacency matrices of loopless graphs with an integral number of edges to nonnegative real matrices and a real total mass. The parser supplies no evidence that the conjecture has been resolved.

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.