Mathematics Problem Archive

Showing 1-7 of 7 problems

AMR-027-0303
Partially Solved

10 Lectures and 42 Open Problems — Open Problem 3.3

v1.3 research notes

Let ${G=(V,E,W)}$ be a graph and ${k}$ a positive integer, is the following true? $\rho_G(k) \leq \mathrm{polylog}(k) \sqrt{\lambda_k}. \ \ \ \ \ (2)$...

L4
Computer Science
AMR-027-0501
Partially Solved

10 Lectures and 42 Open Problems — Deterministic Restricted Isometry Property matrices

v1.3 research notes

Construct deterministic matrices $A\in\mathbb{C}^{M\times N}$ (or $A\in\mathbb{R}^{M\times N}$ ) satisfying the $(s,\frac13)$ -RIP for $s\approx\frac{...

L4
Computer Science
AMR-027-0602
Open

10 Lectures and 42 Open Problems — Mutually Unbiased Bases

v1.3 research notes

How many mutually unbiased bases are there in 6 dimensions?...

L4
Computer Science
AMR-027-0605
Partially Solved

10 Lectures and 42 Open Problems — Constructive Kadison-Singer

v1.3 research notes

Give a (polynomial time) construction of the tight frame partition satisfying the properties required in the Kadison-Singer problem (or the related We...

L4
Computer Science
AMR-027-0803
Open

10 Lectures and 42 Open Problems — The Grothendieck Constant

v1.3 research notes

What is the value of the (real) Grothendieck constant?...

L4
Computer Science
AMR-054-0010
Open

Simple Linear-Time Polygon Triangulation

v1.3 research notes

Is there a deterministic, linear-time polygon triangulation algorithm significantly simpler than that of Chazelle?...

L4
Computer Science
AMR-054-0041
Open

Sorting $X+Y$ (Pairwise Sums)

v1.3 research notes

Given two sets of numbers, each of size $n$, how quickly can the set of all pairwise sums be sorted? In symbols, given two sets $X$ and $Y$, our goal ...

L4
Computer Science