Skip to main content

Write a PREreview

Chollet’s Permanent Conjecture Through Order Six via Border Induction

Posted
Server
Preprints.org
DOI
10.20944/preprints202608.2196.v1

Prior work established Chollet’s conjecture for arbitrary complex Hermitian positive semidefinite matrices only for orders q ≤ 4. We prove Chollet’s permanent conjecture through order six: for 1 ≤ q ≤ 6 and complex Hermitian positive semidefinite q × q matrices A, B, per(A ◦ B) ≤ per(A) per(B). After reducing to the self-conjugate formulation, we encode a normalized border by two permanent polynomials whose relevant coefficients are represented by nonnegative sums of squared norms over orthogonal symmetric-tensor sectors. Evaluating the doubled polynomial along (a, b) = (t, t²) at t = √2 closes the induction, and a permutation-monomial Cauchy–Schwarz inequality transfers the result to arbitrary pairs.

You can write a PREreview of Chollet’s Permanent Conjecture Through Order Six via Border Induction. A PREreview is a review of a preprint and can vary from a few sentences to a lengthy report, similar to a journal-organized peer-review report.

Before you start

We will ask you to log in with your ORCID iD. If you don’t have an iD, you can create one.

What is an ORCID iD?

An ORCID iD is a unique identifier that distinguishes you from everyone with the same or similar name.

Start now