On the spectral norm of Rademacher matrices

We discuss two-sided nonasymptotic bounds for the mean spectral norm of nonhomogenous weighted Rademacher matrices. We show that the recently formulated conjecture holds up to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="log log log n"> <mml:semantics> <mml:mrow> <mml:mi>log</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>log</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>log</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>n</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\log \log \log n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> factor for arbitrary <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n times n"> <mml:semantics> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo> × </mml:mo> <mml:mi>n</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">n\times n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> Rademacher matrices and the triple logarithm may be eliminated for matrices with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartSet 0 comma 1 EndSet"> <mml:semantics> <mml:mrow> <mml:mo fence="false" stretchy="false">{</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo fence="false" stretchy="false">}</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\{0,1\}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -coefficients.

Authors

Publication Details

Journal
Transactions of the American Mathematical Society
Published
2026-07-02
DOI
https://doi.org/10.1090/tran/9637
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

On the spectral norm of Rademacher matrices

Rafał Latała
Transactions of the American Mathematical Society
Matrix Theory and Algorithms
preprint

On the spectral norm of Rademacher matrices

Rafał Latała
preprint en

Abstract

We discuss two-sided nonasymptotic bounds for the mean spectral norm of nonhomogenous weighted Rademacher matrices. We show that the recently formulated conjecture holds up to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="log log log n"> <mml:semantics> <mml:mrow> <mml:mi>log</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>log</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>log</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>n</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\log \log \log n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> factor for arbitrary <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n times n"> <mml:semantics> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo> × </mml:mo> <mml:mi>n</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">n\times n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> Rademacher matrices and the triple logarithm may be eliminated for matrices with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartSet 0 comma 1 EndSet"> <mml:semantics> <mml:mrow> <mml:mo fence="false" stretchy="false">{</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo fence="false" stretchy="false">}</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\{0,1\}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -coefficients.

Transactions of the American Mathematical Society
Hausdorff Research Institute for Mathematics
Openalex Percentile: Top 99%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.