Mathematics Problem Archive
Showing 1-15 of 15 problems
The Polynomial Hirsch Conjecture
The diameter of the graph of a $d$-dimensional polytope with $n$ facets is bounded by a polynomial in $d$ and $n$....
P vs. NP
Problem Is P = NP?...
P vs. PSPACE
Problem Is there a problem that can be computed by a Turing machine in polynomial space and unbounded time but not in polynomial time? More formally, ...
One-way functions exist
Conjecture One-way functions exist....
10 Lectures and 42 Open Problems — Random Partial Discrete Fourier Transform
v1.3 research notesConsider 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...
10 Lectures and 42 Open Problems — Sum of Squares approximation ratio for Max-Cut
v1.3 research notesWhat 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...
10 Lectures and 42 Open Problems — The Paley Clique Problem
v1.3 research notesWhat is the clique number of the Paley graph? Can the the SOS degree 4 analogue of the theta number help upper bound it?...
Point Location in 3D Subdivision
v1.3 research notesIs there an $O(n)$-space data structure that supports $O(\log n)$-time point-location queries in a three-dimensional subdivision of $n$ faces?...
Flip Graph Connectivity in 3D
v1.3 research notesIs 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 ...
Hamiltonian Tetrahedralizations
v1.3 research notesCan every convex polytope in $\mathbb{R}^3$ be partitioned into tetrahedra such that the dual graph has a Hamiltonian path?...
Compatible Triangulations
v1.3 research notesIs 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...
The Number of Pointed Pseudotriangulations
v1.3 research notesFor a planar point set $S$, is the number of pointed pseudotriangulations always at least the number of triangulations? A pseudotriangle is a planar p...
Computational Diffie–Hellman problem
v1.3 research notesGiven 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...
Hartmanis–Stearns conjecture
v1.3 research notesIf 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...
5.8 (Schleimer) — Why SnapPy works in practice
v1.3 research notesGive a rigorous explanation for why SnapPy works so well in practice....