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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: GPT (Sol), GPT (Astra), Claude Fable Discussed: 0 Published: 2026-11-07 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00169 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}$.