Some observations on Erdos matrices

Abstract

In a seminal paper in 1959, Marcus and Ree proved that every n× n bistochastic matrix A satisfies \|A\|F2≤ σ∈ SnAi,σ(i) where Sn is the symmetric group on \1, …, n\. Erdos asked to characterize the bistochastic matrices for which the equality holds in the Marcus--Ree inequality. We refer to such matrices as Erdos matrices. While this problem is trivial in dimension n=2, the case of dimension n=3 was only resolved recently in~bouthat2024question in 2023. We prove that for every n, there are only finitely many n× n Erdos matrices. We also give a characterization of Erdos matrices that yields an algorithm to generate all Erdos matrices in any given dimension. We also prove that Erdos matrices can have only rational entries. This answers a question of~bouthat2024question.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…