The sparsity conjecture for minimally AP-irreducible sign patterns

Myeongjin Kang

Abstract

Refutes the universal sparsity assertion for minimally AP-irreducible zero-diagonal sign patterns: an explicit order5 pattern has9 nonzero entries,exceeding2*5-2=8. AP means signed support irreducible,every row and every column positive,and Aplus-transpose(Aminus) irreducible,where Aminus retains negative entries. Every single nonzero-entry deletion fails AP. This concerns arXiv2112.00442v3 Conjecture5.1,not numerical algebraic-positive realizability Conjecture5.2.

AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

1

Supplementary files

  • proof-sources.json210.4 KBOpen
  • extract_sources.py601 BOpen

Comments

Related problem 352795. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.

Version history

Discussion 0