Top Open Problems
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
15,944 records · Search and filter
- Math-5551 Research Problems in Function Theory — Problem 7.69
- Math-5552 Research Problems in Function Theory — Problem 7.77
- Math-5553 Research Problems in Function Theory — Problem 7.78
- Math-5554 Research Problems in Function Theory — Problem 8.14
- Math-5555 Research Problems in Function Theory — Problem 8.19
- Math-5556 10 Lectures and 42 Open Problems — Improvement over Non-commutative Khintchine inequality
- Math-5557 10 Lectures and 42 Open Problems — Lata $\l$ a-Riemer-Schutt
- Math-5558 10 Lectures and 42 Open Problems — OSNAP
- Math-5559 10 Lectures and 42 Open Problems — Stability conditions for tightness of k-median LP and k-means SDP
- Math-5560 10 Lectures and 42 Open Problems — Positive PCA tightness
- Math-5561 Complexity of computing a v-reduced divisor in multigraphs
- Math-5562 Extreme direction Sperner for square 0-1 matrix
- Math-5563 Making the union of two directed spanning trees strongly connected
- Math-5564 Minimum polychromatic number for plane graphs with fixed girth
- Math-5565 Rank-respecting augmentation of hypergraphs with negamodular constraints
- Math-5566 Red-blue cut problem
- Math-5567 Skew-supermodular colouring with two class sizes
- Math-5568 Smooth well-balanced orientations with prescribed in-degrees
- Math-5569 Suppose we begin with a set of points S in the plane
- Math-5570 Suppose a family V of n points are chosen in R^(3) and L is a collection of lines so that every triangle spanned by thre
- Math-5571 How many congruent regular tetrahedra can touch at a point
- Math-5572 What is the list-chromatic number of Sudoku
- Math-5573 A graph G is said to be uniquely colorable it has only one optimal coloring up to permutation of the colors
- Math-5574 What is the (homogeneous adjacency) spectrum of the Fano plane
- Math-5575 Is the poset of integer partitions ordered by refinement Sperner
- Math-5576 Show that the jump number of a random linear extension of a grid poset (i
- Math-5577 Is enumeration of pressing sequences of bicolored graphs (aka simple pseudographs) #P-hard
- Math-5578 Is the 1/3-2/3 Conjecture for Pressing Sequences true
- Math-5579 Suppose that S is a set of positive integers with the property that no element is the sum of a nonempty set of other ele
- Math-5580 What is Σ_(n≥1 )φ(n)/2^(n), where φ(n) is the Euler phi (totient) function, counting the number of integers less than n
- Math-5581 Let f be the formal power series over Z/2Z whose nth coefficient is the parity of the divisor function Ă_(0)(n)
- Math-5582 Hypotheses for analytic invariant curves
- Math-5583 A fifth-root functional equation
- Math-5584 Locally constant logarithmic potentials
- Math-5585 Rectangular-lattice Landau extremal
- Math-5586 Acute triangulation of the cube
- Math-5587 Tangent pairs of pseudocircles
- Math-5588 Visibility complex of disjoint unit spheres
- Math-5589 Complex collinearities
- Math-5590 Extreme points
- Math-5591 A dynamic-programming interval problem
- Math-5592 Shortest paths in line arrangements
- Math-5593 Straight skeleton of a simple polygon
- Math-5594 Crashing motorcycles efficiently
- Math-5595 Covering points by congruent rectangles
- Math-5596 Rationality of Hermite constants
- Math-5597 Odd rep-tiling by a 14-omino
- Math-5598 Prince Rupert ratio for tetrahedra
- Math-5599 Triangulations with many distinct areas
- Math-5600 Log-concave measures