Partial Proof of a Conjecture with Implications for Spectral Majorization

09/04/2023
by   Jeffrey Uhlmann, et al.
0

In this paper we report on new results relating to a conjecture regarding properties of n× n, n≤ 6, positive definite matrices. The conjecture has been proven for n≤ 4 using computer-assisted sum of squares (SoS) methods for proving polynomial nonnegativity. Based on these proven cases, we report on the recent identification of a new family of matrices with the property that their diagonals majorize their spectrum. We then present new results showing that this family can extended via Kronecker composition to n>6 while retaining the special majorization property. We conclude with general considerations on the future of computer-assisted and AI-based proofs.

READ FULL TEXT
research
06/21/2023

Crouzeix's conjecture for new classes of matrices

For a matrix A which satisfies Crouzeix's conjecture, we construct sever...
research
01/29/2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

Vizing's conjecture (open since 1968) relates the sizes of dominating se...
research
01/23/2018

Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture

There are several approaches for using computers in deriving mathematica...
research
07/12/2018

Gradual Parametricity, Revisited

Bringing the benefits of gradual typing to a language with parametric po...
research
01/26/2019

Beyond the Erdős Matching Conjecture

A family F⊂[n] k is U(s,q) of for any F_1,..., F_s∈ F we have |F_1∪...∪...
research
03/12/2021

Can Single-Shuffle SGD be Better than Reshuffling SGD and GD?

We propose matrix norm inequalities that extend the Recht-Ré (2012) conj...
research
06/17/2020

Computer-assisted proofs for Lyapunov stability via Sums of Squares certificates and Constructive Analysis

We provide a computer-assisted approach to ensure that a given continuou...

Please sign up or login with your details

Forgot password? Click here to reset