Pith. sign in

REVIEW 1 cited by

The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras

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 1907.12357 v2 pith:EJT36OS5 submitted 2019-07-29 math.CO math.RA

classification math.COmath.RA
keywords algebrascliffordconjectureinducedsensitivityversionanotherargument
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We give another version of Huang's proof that an induced subgraph of the n-dimensional cube graph containing over half the vertices has maximal degree at least $\sqrt{n}$, which implies the Sensitivity Conjecture. This argument uses Clifford algebras of positive definite signature in a natural way. We also prove a weighted version of the result.

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. Majorana fermions and the Sensitivity Conjecture

    cond-mat.stat-mech 2019-08 accept novelty 2.0 of 10

    Huang's pseudo-adjacency matrix in the Sensitivity Conjecture proof is the zero-momentum Majorana operator from the Jordan-Wigner transformation.

Pith tools