Instant TravelLuminary Oddities — Enter the Portal
Research Archive

Research Article · Preprint Mathematics

Strong permanent inequalities for three-row bipartite and triangle-free supports

Scott Schubr

Luminary Oddities LLC

  • Mathematics
  • Linear Algebra and Matrix Inequalities
Primary subject
Mathematics
Subject subfield
Linear Algebra and Matrix Inequalities
Paper type
Research Article
Manuscript stage
Preprint
Manuscript
Archived
Edition
1 · Permanent link

Overview

Abstract

For every complex 3 × q contraction X, we prove that the permanent of [I₃ X; X* Iq] is at least the permanent of its entrywise squared modulus. The proof retains all square-minor orders and controls the coupled third-order cancellations through the row Gram matrix. It gives an explicit sum of nonnegative lower bounds and includes arbitrary phases, zero entries and singular endpoints. Combining this theorem with three pentagon blow-up cases and an exact finite graph classification proves the same strong inequality for every positive semidefinite matrix with triangle-free support on at most seven vertices, after diagonal scaling. Two previously unpublished blow-up cases are proved here, one analytically and one by an explicit positive integer polynomial certificate. Reproducibility supplements contain the certificate and finite classification verifier. The unrestricted Chollet conjecture is not settled.

Keywords permanent inequalities · positive semidefinite matrices · three-row contractions · triangle-free graphs · Chollet conjecture · polynomial certificates

Scope of the work

Proves the strong permanent inequality for complex K₃,q positive semidefinite supports, with the full contraction hypothesis, and for triangle-free positive semidefinite supports on at most seven vertices. Includes arbitrary phases, zero entries and singular endpoints. Uses the previously published three-chord theorem for the adjacent-doubled pentagon case. Does not settle K₄,₄, supports with triangles, arbitrary rank-six matrices of order seven, unrestricted Chollet, or domination with an arbitrary second positive semidefinite factor. No new equality classification is asserted.

Reproduction notes

The complete publication package includes the eight-page manuscript and LaTeX source, a 119-term positive integer polynomial certificate, its exact rational verifier, and an exhaustive triangle-free graph classification verifier. The executable supplements require only the Python standard library. The three-row theorem is analytic; finite verification concerns the stated certificate and graph enumeration.

The manuscript

Read the paper

Open PDF

The complete manuscript, as published in this edition.

If the reader is unavailable on your device, open or download the PDF directly.

Author disclosures

AI tools assisted with drafting and verification. The author is responsible for the statements, proofs, attribution and final text. This author-published preprint has not undergone formal journal peer review.

References and related publications

  1. J. Chollet, Is there a permanental analogue to Oppenheim's inequality?, American Mathematical Monthly 89 (1982), 57–58.
  2. S. W. Drury, A counterexample to a question of Bapat and Sunder, Electronic Journal of Linear Algebra 31 (2016), 69–70.
  3. P. Pant and R. Singh, Structural Classes for Chollet's Permanent Conjecture, arXiv:2604.24192v2 (2026).
  4. S. Schubr, Strong permanent inequalities for complex positive semidefinite cycle and single-chord supports, Luminary Research Archive, first edition (2026).
  5. S. Schubr, Strong permanent inequalities for complex two- and three-chord seven-cycle supports, Luminary Research Archive, first edition (2026).
  6. R. Mehatari, M. R. Kannan and A. Samanta, On the adjacency matrix of a complex unit gain graph, Linear and Multilinear Algebra 70 (2022), no. 9, 1798–1813.
  7. D. Handelman, Representing polynomials by positive linear functions on compact convex polyhedra, Pacific Journal of Mathematics 132 (1988), no. 1, 35–62.

A stable scholarly record

Cite this edition

Scott Schubr. (2026). Strong permanent inequalities for three-row bipartite and triangle-free supports (Version 1). Luminary Research Archive. https://research.luminaryoddities.com/strong-permanent-inequalities-three-row-bipartite-triangle-free-supports/v/1

BibTeX
@techreport{luminary_strong_permanent_inequalities_three_row_bipartite_triangle_free_supports_v1,
  title = {Strong permanent inequalities for three-row bipartite and triangle-free supports},
  author = {Scott Schubr},
  year = {2026},
  institution = {Luminary Research Archive},
  type = {Research Article},
  note = {Version 1},
  url = {https://research.luminaryoddities.com/strong-permanent-inequalities-three-row-bipartite-triangle-free-supports/v/1}
}

Loading discussion…