paving conjecture
E1522134
UNEXPLORED
The paving conjecture is a problem in operator theory and functional analysis that asks whether every bounded linear operator with zero diagonal can be approximated by block-diagonal operators with uniformly small off-diagonal norms, and is closely connected to the Kadison–Singer problem.
All labels observed (1)
| Label | Occurrences |
|---|---|
| paving conjecture canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22150691 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: paving conjecture Context triple: [Bourgain–Tzafriri restricted invertibility principle, relatedTo, paving conjecture]
-
A.
Pólya’s conjecture
Pólya’s conjecture is a disproven hypothesis in number theory that proposed a specific long-term sign pattern for the summatory Möbius function, suggesting it would eventually remain nonpositive.
-
B.
Bunyakovsky conjecture
The Bunyakovsky conjecture is an unproven statement in number theory asserting that certain irreducible integer polynomials with positive leading coefficient take on infinitely many prime values.
-
C.
Poincaré conjecture
The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
-
D.
Mauldin’s conjecture
Mauldin’s conjecture, more commonly known as the Beal conjecture, is an unsolved problem in number theory asserting that any solution in positive integers to A^x + B^y = C^z with exponents greater than 2 must have A, B, and C sharing a common prime factor.
-
E.
Erdős–Turán conjecture
The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: paving conjecture Target entity description: The paving conjecture is a problem in operator theory and functional analysis that asks whether every bounded linear operator with zero diagonal can be approximated by block-diagonal operators with uniformly small off-diagonal norms, and is closely connected to the Kadison–Singer problem.
-
A.
Pólya’s conjecture
Pólya’s conjecture is a disproven hypothesis in number theory that proposed a specific long-term sign pattern for the summatory Möbius function, suggesting it would eventually remain nonpositive.
-
B.
Bunyakovsky conjecture
The Bunyakovsky conjecture is an unproven statement in number theory asserting that certain irreducible integer polynomials with positive leading coefficient take on infinitely many prime values.
-
C.
Poincaré conjecture
The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
-
D.
Mauldin’s conjecture
Mauldin’s conjecture, more commonly known as the Beal conjecture, is an unsolved problem in number theory asserting that any solution in positive integers to A^x + B^y = C^z with exponents greater than 2 must have A, B, and C sharing a common prime factor.
-
E.
Erdős–Turán conjecture
The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.