Pith. sign in

REVIEW 1 cited by

A Note on Approximate Hadamard Matrices

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.13202 v1 pith:WCIDSFQC submitted 2024-02-20 math.CO math.FA

classification math.COmath.FA
keywords hadamardmatricesexistmatrixapproximatecirculantconjecturedimensions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is that no circulant Hadamard matrices exist when $n > 4$. Recently, Dong and Rudelson proved the existence of approximate Hadamard matrices in all dimensions: there exist universal $0< c < C < \infty$ so that for all $n \geq 1$, there is a matrix $A \in \left\{-1,1\right\}^{n \times n}$ satisfying, for all $x \in \mathbb{R}^n$, $$ c \sqrt{n} \|x\|_2 \leq \|Ax\|_2 \leq C \sqrt{n} \|x\|_2.$$ We observe that, as a consequence of the existence of flat Littlewood polynomials, circulant approximate Hadamard matrices exist for all $n \geq 1$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Qrazor: Reliable and Effortless 4-bit LLM Quantization by Significant Data Razoring

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A post-training quantization scheme that uses per-group leading-one detection to keep four salient bits from an 8/16-bit integer base, achieving 4-bit weights, activations, and KV cache without fine-tuning or rotation.

Pith tools