PofoliaShared via Pofolia

Bulletin of the Australian Mathematical Society· 2026Q2

A NONNEGATIVITY CRITERION FOR ERDŐS MATRICES

Frédéric Morneau-Guérin

Short summary

A new criterion, min(u_i) + min(v_j) >= 0, is proposed for identifying Erdős matrices, which are doubly stochastic matrices attaining equality in the Marcus-Ree inequality.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Erdős matrices are doubly stochastic matrices achieving equality in the Marcus-Ree inequality.
  • Every Erdős matrix is a restricted common diagonal sum matrix.
  • A criterion min(u_i) + min(v_j) >= 0 is proposed for identifying Erdős matrices.
  • This criterion relates to the additive potentials (u_i + v_j)s_ij of these matrices.

AI-generated from the title and abstract; the full text is not read.

Abstract

Abstract Let A be an n × n $n\times n$ n times n doubly stochastic matrix. The Marcus–Ree inequality asserts that ∥ A ∥ F 2 ≤ maxtrace ( A ) $\|A\|_{\mathrm F}^2\leq \mathrm {maxtrace}(A)$ StartMetric upper A EndMetric Subscript normal upper F Superscript 2 Baseline less than or equals maxtrace left parenthesis upper A right parenthesis . Matrices attaining equality are called Erdős matrices. Recent work of Karmakar et al. [‘Characterization of Erdős matrices by their zero entries’, Linear Algebra Appl. 739 (2026), 154–169] shows that every Erdős matrix is a restricted common diagonal sum matrix. By the structural theory of Brualdi and Dahl [‘Diagonal sums of doubly stochastic matrices’, Linear Multilinear Algebra 70 (2022), 4946–4972], a restricted common diagonal sum matrix with fully indecomposable skeleton S = ( s i j ) $S=(s_{ij})$ upper S equals left parenthesis s Subscript i j Baseline right parenthesis admits additive potentials satisfying a i j = ( u i + v j ) s i j $a_{ij}=(u_i+v_j)s_{ij}$ a Subscript i j Baseline equals left parenthesis u Subscript i Baseline plus v Subscript j Baseline right parenthesis s Subscript i j . Karmakar et al. observed that min i u i + min j v j ≥ 0 $\min _i u_i+\min _jv_j\geq 0$ min Underscript i Endscripts u Subscript i Baseline plus min Underscript j Endscripts v Subscript j Baseline greater than or equals 0

The authors' abstract, as published at the source. Bulletin of the Australian Mathematical Society, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computational Theory and Mathematics

Computational Theory and MathematicsComputer Science