Mathematics Problem Archive

Showing 1-15 of 15 problems

AMR-027-0601
Open

10 Lectures and 42 Open Problems — Random Partial Discrete Fourier Transform

v1.3 research notes

Consider a $A\in\mathbb{C}^{M\times N}$ obtained by sampling random rows of a Discrete Fourier Tranform. How large does $M$ need to be in order for, w...

L3
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-0802
Open

10 Lectures and 42 Open Problems — Sum of Squares approximation ratio for Max-Cut

v1.3 research notes

What is the approximation ratio (or integrality gap) for the Sum-of-Squares (SOS) relaxation of degree 4 for the Max-Cut problem? What about other con...

L3
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-027-0804
Open

10 Lectures and 42 Open Problems — The Paley Clique Problem

v1.3 research notes

What is the clique number of the Paley graph? Can the the SOS degree 4 analogue of the theta number help upper bound it?...

L3
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-0013
Open

Point Location in 3D Subdivision

v1.3 research notes

Is there an $O(n)$-space data structure that supports $O(\log n)$-time point-location queries in a three-dimensional subdivision of $n$ faces?...

L3
Computer Science
AMR-054-0028
Open

Flip Graph Connectivity in 3D

v1.3 research notes

Is the flip graph connected for general-position points in $\mathbb{R}^3$? Given a set of $n$ points in $\mathbb{R}^3$, the flip graph has a node for ...

L3
Computer Science
AMR-054-0029
Open

Hamiltonian Tetrahedralizations

v1.3 research notes

Can every convex polytope in $\mathbb{R}^3$ be partitioned into tetrahedra such that the dual graph has a Hamiltonian path?...

L3
Computer Science
AMR-054-0038
Open

Compatible Triangulations

v1.3 research notes

Is it true that every two sets of $n$ planar points in general position with the same number points on their convex hulls have compatible triangulatio...

L3
Computer Science
AMR-054-0040
Open

The Number of Pointed Pseudotriangulations

v1.3 research notes

For a planar point set $S$, is the number of pointed pseudotriangulations always at least the number of triangulations? A pseudotriangle is a planar p...

L3
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
AMR-092-0002
Open

Computational Diffie–Hellman problem

v1.3 research notes

Given a prime modulus $p$, a group generator $g$, and the public values $g^a$ and $g^b$ modulo $p$, can the shared value $g^{ab}\bmod p$ be computed e...

L3
Computer Science
AMR-093-0101
Open

Hartmanis–Stearns conjecture

v1.3 research notes

If the base-$b$ expansion of a real number can be emitted in real time by a multitape Turing machine (bounded time between successive digits), must th...

L3
Computer Science
AMR-108-0033
Open

5.8 (Schleimer) — Why SnapPy works in practice

v1.3 research notes

Give a rigorous explanation for why SnapPy works so well in practice....

L3
Computer Science