Zero-sum-free subsets of the unit sphere over F_7
TheoremDB P2628 · zero sum theory
41 entries matching the current filters. Sorted by recently added.
TheoremDB P2628 · zero sum theory
TheoremDB P2516 · real analysis
TheoremDB P2572 · decision diagrams
TheoremDB P2600 · formal languages
TheoremDB P2598 · probabilistic combinatorics
TheoremDB P12749 · integer sequences
TheoremDB P2518 · real analysis
TheoremDB P2602 · circuit complexity
TheoremDB P2676 · algebraic graph theory
TheoremDB P2662 · finite fields
TheoremDB P2536 · probability
TheoremDB P2502 · computational geometry
TheoremDB P2440 · matrix theory
TheoremDB P2570 · decision tree complexity
TheoremDB P2510 · computational topology
TheoremDB P2584 · probabilistic combinatorics
TheoremDB P2448 · algebraic combinatorics
TheoremDB P10420 · background embedded json fragment
TheoremDB P2636 · additive combinatorics
TheoremDB P2 · combinatorics
TheoremDB P3062 · graph theory
TheoremDB P2556 · graph theory
Everyone expected additivity. Hastings produced a random counterexample, and the classical capacity of a quantum channel became genuinely hard.
Resolved in 2020 by a complexity-theoretic argument that nobody in operator algebras saw coming.
Noncommutative surfaces and Artin's conjecture · AIMPL workshop record