Papers
arxiv:2512.04766
Characterization of Erdös matrices by their zero entries
Published on Mar 19
Authors:
Abstract
An Erdös matrix E is a bistochastic matrix whose sum of squares of entries (Frobenius norm squared) equals its maxtrace (maximum of all the σ-traces for permutations σ's). We characterize all Erdös E by the patterns of their zero entries; showing that each such skeleton has at most one E. We present an algorithm to find all ntimes n Erdös matrices, which finds them up to nleqslant 5 quickly and also size n=6. We further show some presently known RCDS matrices to be Erdös.
Get this paper in your agent:
hf papers read 2512.04766 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Cite arxiv.org/abs/2512.04766 in a model README.md to link it from this page.
Datasets citing this paper 1
Spaces citing this paper 0
No Space linking this paper
Cite arxiv.org/abs/2512.04766 in a Space README.md to link it from this page.
Collections including this paper 0
No Collection including this paper
Add this paper to a collection to link it from this page.