Pith. sign in

REVIEW 1 cited by

Eigenvalues of subgraphs of the cube

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 1605.06360 v1 pith:FFL7EGES submitted 2016-05-20 math.CO

classification math.CO
keywords ballseigenvaluehamminglargestradiussubgraphsasymptoticallybelief
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider the problem of maximising the largest eigenvalue of subgraphs of the hypercube $Q_d$ of a given order. We believe that in most cases, Hamming balls are maximisers, and our results support this belief. We show that the Hamming balls of radius $o(d)$ have largest eigenvalue that is within $1 + o(1)$ of the maximum value. We also prove that Hamming balls with fixed radius maximise the largest eigenvalue exactly, rather than asymptotically, when $d$ is sufficiently large. Our proofs rely on the method of compressions.

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. Detecting high-dimensional entanglement with simple measurements

    quant-ph 2026-08 conditional novelty 7.0 of 10

    A witness method detects high-dimensional Schmidt numbers using only strings of single-qubit Pauli measurements, demonstrated up to 16-dimensional photonic entanglement.

Pith tools