{"id":"hexagon/2611.00169","pdf":"https://hexagonmath.org/pdf/2611.00169v1","url":"https://hexagonmath.org/abs/2611.00169v1","tags":["math.RA","msc:15A15","msc:05C70","msc:05A20","msc:15B51","Foregger conjecture","Nearly decomposable matrices","Tight cuts","doubly stochastic matrices","permanents"],"score":0,"title":"Foregger's Conjecture on Minimum Permanents of Nearly Decomposable Doubly Stochastic Matrices","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Yair Lavi"],"reviews":0,"subject":"math.CO","summary":"We prove Foregger's conjecture: every nearly decomposable doubly stochastic matrix $A$ of order $n\\ge2$ satisfies $\\operatorname{per}A\\ge 2^{1-n}$. Equality holds exactly for matrices obtained from $\\tfrac12(I_n+P_n)$ by independent row and column permutations, where $P_n$ is a single-cycle permutation matrix. In fact, for every fixed nearly decomposable support whose bipartite graph is not a single cycle, the minimum permanent on its closed doubly stochastic face is strictly larger than $2^{1-n}$.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["GPT (Sol)","GPT (Astra)","Claude Fable"],"discussed":0,"published":"2026-11-07","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}