Papers
Topics
Authors
Recent
2000 character limit reached

Some observations on Erdős matrices (2410.06612v2)

Published 9 Oct 2024 in math.MG and math.PR

Abstract: In a seminal paper in 1959, Marcus and Ree proved that every $n\times n$ bistochastic matrix $A$ satisfies $|A|{\operatorname{F}}2\leq \max{\sigma\in S_n}A_{i,\sigma(i)}$ where $S_n$ is the symmetric group on ${1, \ldots, n}$. Erd\H{o}s asked to characterize the bistochastic matrices for which the equality holds in the Marcus--Ree inequality. We refer to such matrices as Erd\H{o}s matrices. While this problem is trivial in dimension $n=2$, the case of dimension $n=3$ was only resolved recently in~\cite{bouthat2024question} in 2023. We prove that for every $n$, there are only finitely many $n\times n$ Erd\H{o}s matrices. We also give a characterization of Erd\H{o}s matrices that yields an algorithm to generate all Erd\H{o}s matrices in any given dimension. We also prove that Erd\H{o}s matrices can have only rational entries. This answers a question of~\cite{bouthat2024question}.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.