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.
16,859 records · Search and filter
- Math-9451 Research Problems in Function Theory — Problem 5.63
- Math-9452 Research Problems in Function Theory — Problem 5.64
- Math-9453 Research Problems in Function Theory — Problem 5.68
- Math-9454 Research Problems in Function Theory — Problem 5.69
- Math-9455 Research Problems in Function Theory — Problem 5.70
- Math-9456 Research Problems in Function Theory — Problem 5.71
- Math-9457 Research Problems in Function Theory — Problem 5.72
- Math-9458 Research Problems in Function Theory — Problem 5.73
- Math-9459 Research Problems in Function Theory — Problem 5.74
- Math-9460 10 Lectures and 42 Open Problems — The planted clique problem
- Math-9461 10 Lectures and 42 Open Problems — Hardness at the Cheeger square-root gap
- Math-9462 10 Lectures and 42 Open Problems — Deterministic Restricted Isometry Property matrices
- Math-9463 10 Lectures and 42 Open Problems — Random Partial Discrete Fourier Transform
- Math-9464 10 Lectures and 42 Open Problems — The Paley ETF Conjecture
- Math-9465 10 Lectures and 42 Open Problems — Gilbert-Varshamov bound
- Math-9466 10 Lectures and 42 Open Problems — The Deletion Channel
- Math-9467 10 Lectures and 42 Open Problems — Sum of Squares approximation ratio for Max-Cut
- Math-9468 Acyclic orientation with parity constraints
- Math-9469 Edge-covering number of 2-polymatroids
- Math-9470 Finding kernels in special digraphs
- Math-9471 Highly element-connected orientation
- Math-9472 Infinite Lucchesi-Younger
- Math-9473 Maximum weakly stable matchings in graphs without odd preference cycles
- Math-9474 Orientation of nonideal clutters
- Math-9475 Orientation-compatible w-vertex cover
- Math-9476 Polyhedral description of kernels
- Math-9477 Recognition of Seymour graphs
- Math-9478 S-T edge-connectivity augmentation
- Math-9479 Suppose a geometric graph has no pairwise k-crossing lines
- Math-9480 Suppose H is a linear 3-uniform hypergraph, i
- Math-9481 Does every thrackle have average degree at most 2
- Math-9482 What is the minimum number of n-simplexes needed to triangulate the n-cube
- Math-9483 The "cycle double cover conjecture" states that every bridgeless graph contains a set of cycles which cover each edge of
- Math-9484 "Seymour's Second Neighborhood Conjecture" Any oriented graph has a vertex whose outdegree is at most its second outdegr
- Math-9485 Suppose that G is a tree
- Math-9486 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-9487 Given a permutation σ, what is the maximum number of copies of σ that a permutation on n symbols may contain
- Math-9488 Given two permutations σ and τ, what is the expected number of copies of σ in a permutation chosen uniformly at random f
- Math-9489 Show that the inversion permutation, i
- Math-9490 What is the length of the shortest sequence in [n]* containing, as a (consecutive) subword, each permutation of [n]
- Math-9491 ("Diamond-Free Posets Problem") What is the size of the largest subset of the Boolean lattice B_(n) which includes no B_
- Math-9492 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-9493 "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-9494 Show that there exists a B so that, for every n > 0, there exists a k relatively prime to n whose continued fraction has
- Math-9495 If F is a finite field with at least 4 elements and A is an invertible n by n matrix over F, then there are vectors x, y
- Math-9496 Is x^(2)+y^(2)=z^(2) partition regular
- Math-9497 A covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one of the codewo
- Math-9498 An asymmetric covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one o
- Math-9499 An asymmetric packing code of radius R is a set of binary n-words so that no binary n-word can be reached from more than
- Math-9500 A de Bruijn covering code of radius R is a binary string so that the set of words appearing as n consecutive symbols (wi