Research Article · Preprint Mathematics
Asymptotically optimal bounds for permanental cofactor matrices
- Primary subject
- Mathematics
- Subject subfields
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
- Manuscript
- Archived
- Edition
- 1 · Permanent link
Overview
Abstract
For a complex correlation matrix B of order n, let C(B)ij = per B(i|j) be its raw permanental cofactor matrix. We bound the optimal constant γn in C(B) ≼ γn(per B)I. An elementary isolated-row induction and an explicit positive-definite equicorrelation family give, for every n ≥ 2, (n+1)²/(4n) < γn ≤ (n²+2n+3)/(4n). Consequently γn = n/4 + 1/2 + Θ(1/n): both the leading coefficient and the constant term are sharp. The upper estimate extends, with the necessary diagonal weights, to all Hermitian positive semidefinite matrices, including zero diagonals. We also obtain an explicit nonnegative reserve for the standard natural-representation block in order six, and give an exact order-six obstruction to the raw cofactor bound with constant two. The proof is analytic and does not require finite polynomial certificates. The exact finite-order constants and the coefficient of 1/n remain open.
Keywords permanent · permanental cofactors · positive semidefinite matrices · correlation matrices · asymptotically optimal bounds
Scope of the work
All-order raw-cofactor norm bounds on complex correlation matrices, with diagonal-weighted extension to every Hermitian positive semidefinite matrix; explicit lower family, sharp leading growth and constant term, quantified order-six natural block. Exact finite-order constants and the 1/n coefficient remain open. This does not solve Chollet’s inequality or the generic rank-six compensation gap.
Reproduction notes
The supplementary ZIP includes the complete LaTeX source, standard-library Python exact checker and output, reader/build instructions, citation metadata and a complete SHA-256 manifest. Compile main.tex with Tectonic or an ordinary LaTeX installation; run python verify.py and python -O verify.py. Finite controls corroborate the analytic proofs.
The manuscript
Read the paper
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-assisted derivation, independent internal proof checking and exact rational computational controls were used. The theorems follow from the printed analytic proofs; internal verification is not external refereeing. The isolated-row method is credited to Lavi. No exhaustive worldwide-priority claim is made.
A stable scholarly record
Cite this edition
Scott Schubr. (2026). Asymptotically optimal bounds for permanental cofactor matrices (Version 1). Luminary Research Archive. https://research.luminaryoddities.com/asymptotically-optimal-bounds-permanental-cofactor-matrices/v/1
BibTeX
@techreport{luminary_asymptotically_optimal_bounds_permanental_cofactor_matrices_v1,
title = {Asymptotically optimal bounds for permanental cofactor matrices},
author = {Scott Schubr},
year = {2026},
institution = {Luminary Research Archive},
type = {Research Article},
note = {Version 1},
url = {https://research.luminaryoddities.com/asymptotically-optimal-bounds-permanental-cofactor-matrices/v/1}
}Loading discussion…