Mathematics catalogue
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.
6,275 records · Search and filter
- Math-2051 Research Problems in Function Theory — Problem 5.22
- Math-2052 Research Problems in Function Theory — Problem 5.25
- Math-2053 Research Problems in Function Theory — Problem 5.48
- Math-2054 Research Problems in Function Theory — Problem 5.52
- Math-2055 Research Problems in Function Theory — Problem 5.53
- Math-2056 Research Problems in Function Theory — Problem 5.59
- Math-2057 Research Problems in Function Theory — Problem 5.63
- Math-2058 Research Problems in Function Theory — Problem 5.64
- Math-2059 Research Problems in Function Theory — Problem 5.68
- Math-2060 Research Problems in Function Theory — Problem 5.69
- Math-2061 Research Problems in Function Theory — Problem 5.70
- Math-2062 Research Problems in Function Theory — Problem 5.71
- Math-2063 Research Problems in Function Theory — Problem 5.72
- Math-2064 Research Problems in Function Theory — Problem 5.73
- Math-2065 Research Problems in Function Theory — Problem 5.74
- Math-2066 10 Lectures and 42 Open Problems — The planted clique problem
- Math-2067 10 Lectures and 42 Open Problems — Hardness at the Cheeger square-root gap
- Math-2068 10 Lectures and 42 Open Problems — Deterministic Restricted Isometry Property matrices
- Math-2069 10 Lectures and 42 Open Problems — Random Partial Discrete Fourier Transform
- Math-2070 10 Lectures and 42 Open Problems — The Paley ETF Conjecture
- Math-2071 10 Lectures and 42 Open Problems — Gilbert-Varshamov bound
- Math-2072 10 Lectures and 42 Open Problems — The Deletion Channel
- Math-2073 10 Lectures and 42 Open Problems — Sum of Squares approximation ratio for Max-Cut
- Math-2074 Acyclic orientation with parity constraints
- Math-2075 Edge-covering number of 2-polymatroids
- Math-2076 Finding kernels in special digraphs
- Math-2077 Highly element-connected orientation
- Math-2078 Infinite Lucchesi-Younger
- Math-2079 Maximum weakly stable matchings in graphs without odd preference cycles
- Math-2080 Orientation of nonideal clutters
- Math-2081 Orientation-compatible w-vertex cover
- Math-2082 Polyhedral description of kernels
- Math-2083 Recognition of Seymour graphs
- Math-2084 S-T edge-connectivity augmentation
- Math-2085 Suppose a geometric graph has no pairwise k-crossing lines
- Math-2086 Suppose H is a linear 3-uniform hypergraph, i
- Math-2087 Does every thrackle have average degree at most 2
- Math-2088 What is the minimum number of n-simplexes needed to triangulate the n-cube
- Math-2089 The "cycle double cover conjecture" states that every bridgeless graph contains a set of cycles which cover each edge of
- Math-2090 "Seymour's Second Neighborhood Conjecture" Any oriented graph has a vertex whose outdegree is at most its second outdegr
- Math-2091 Suppose that G is a tree
- Math-2092 A graph G is said to be uniquely H-saturated if it contains no H, but adding any edge to G creates exactly one copy of H
- Math-2093 Given a permutation σ, what is the maximum number of copies of σ that a permutation on n symbols may contain
- Math-2094 Given two permutations σ and τ, what is the expected number of copies of σ in a permutation chosen uniformly at random f
- Math-2095 Show that the inversion permutation, i
- Math-2096 What is the length of the shortest sequence in [n]* containing, as a (consecutive) subword, each permutation of [n]
- Math-2097 ("Diamond-Free Posets Problem") What is the size of the largest subset of the Boolean lattice B_(n) which includes no B_
- Math-2098 For any poset P, define ex(n,P) to be the size of the largest subset of the Boolean lattice B_(n) which includes no (inj
- Math-2099 "1/3 - 2/3 Conjecture" For every poset that is not a chain, there is some pair of elements x and y so that x appears abo
- Math-2100 Show that there exists a B so that, for every n > 0, there exists a k relatively prime to n whose continued fraction has