Lih Wang and Dittert Conjectures on Permanents
Abstract
Let n denote the set of all doubly stochastic matrices of order n. Lih and Wang conjectured that for n≥3, per(tJn+(1-t)A)≤ t perJn+(1-t)perA, for all A∈n and all t ∈ [0.5,1], where Jn is the n × n matrix with each entry equal to 1n. This conjecture was proved partially for n ≤ 5. \\ ∈dent Let Kn denote the set of non-negative n× n matrices whose elements have sum n. Let φ be a real valued function defined on Kn by φ(X)=Πi=1nri+Πj=1ncj - perX for X∈ Kn with row sum vector (r1,r2,...rn) and column sum vector (c1,c2,...cn). A matrix A∈ Kn is called a φ-maximizing matrix if φ(A)≥ φ(X) for all X∈ Kn. Dittert conjectured that Jn is the unique φ-maximizing matrix on Kn. Sinkhorn proved the conjecture for n=2 and Hwang proved it for n=3. \\ ∈dent In this paper, we prove the Lih and Wang conjecture for n=6 and Dittert conjecture for n=4.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.