On a question of Erdős on doubly stochastic matrices
Abstract
In a celebrated paper of Marcus and Ree (1959), it was shown that if A=[aij] is an n × n doubly stochastic matrix, then there is a permutation σ∈ Sn such that Σi,j=1n ai,j2 ≤ Σi=1n ai,σ(i). Erdős asked for which doubly stochastic matrices the inequality is saturated. Although Marcus and Ree provided some insight for the set of solutions, the question appears to have fallen into oblivion. Our goal is to provide a complete answer in the particular, yet non-trivial, case when n=3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.