ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F\mathbb{F} be a field of zero characteristics. For positive integers k,nk,n, let Mk,n(F)M_{k,n}(\mathbb{F}) be the set of kk-by-nn matrices over F\mathbb{F}, and let Mk,n(±1)M_{k,n}(\pm 1) be the subset whose entries are ±1\pm 1. Write Mn=Mn,nM_n=M_{n,n}, let rk⁡A\operatorname{rk} A denote the rank of AA, and let per⁡A\operatorname{per} A denote its permanent. For 0≤l≤k≤n0\leq l\leq k\leq n, define D(n,k,l)=(dij)∈Mk,n(±1)D_{(n,k,l)}=(d_{ij})\in M_{k,n}(\pm1) by

dij={−1,i=j and j∈{1,…,l},1,otherwise.d_{ij}=\begin{cases} -1, & i=j\text{ and }j\in\{1,\ldots,l\},\\ 1, & \text{otherwise.} \end{cases}

When n=kn=k, write D(n,n,l)=D(n,l)D_{(n,n,l)}=D_{(n,l)}. Kräuter's conjecture. Let A∈Mn(±1)A\in M_n(\pm1), where n≥5n\geq5 and rk⁡A=r+1\operatorname{rk} A=r+1 for some rr with 0≤r≤n−10\leq r\leq n-1. Then

∣per⁡A∣≤per⁡D(n,r).|\operatorname{per} A|\leq \operatorname{per}D_{(n,r)}.

Equality holds if and only if AA can be obtained from D(n,r)D_{(n,r)} by transposition, row or column permutations, and multiplication of rows or columns by −1-1. This conjecture would answer Wang's question by giving a sharp upper bound for the permanent of a sign matrix in terms of its rank; the stated source does not establish the claim, and its resolution status is not supplied here.

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.