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,288 records · Search and filter
- Math-3801 10 Lectures and 42 Open Problems — Constructive Kadison-Singer
- Math-3802 10 Lectures and 42 Open Problems — Boolean classification and annulus conjecture
- Math-3803 10 Lectures and 42 Open Problems — Tightness of the Multireference Alignment SDP
- Math-3804 Betti Posets and the Stanley Depth
- Math-3805 Complexity of computing the rotor-router action
- Math-3806 Complexity of the chip-firing reachability problem for general digraphs
- Math-3807 Complexity of the halting problem for Eulerian multigraphs
- Math-3808 Complexity of the halting problem for simple digraphs
- Math-3809 Minimum k-way cut in a hypergraph
- Math-3810 Orientation conjecture of Nash-Williams
- Math-3811 Quasi-kernels and quasi-sinks
- Math-3812 Small quasi-kernels in directed graphs
- Math-3813 Strongly maximal matchings
- Math-3814 Strongly minimal edge cover
- Math-3815 Upper bound on the divisorial gonality of a graph
- Math-3816 Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n
- Math-3817 Suppose G has n vertices and no induced copy of H
- Math-3818 Show that every (1/2+ľ)|E(ő_(n))| edges of the n-cube ő_(n) contains a C_(4) when n is sufficiently large
- Math-3819 What are the (homogeneous adjacency) spectra of the ultracube and the complete hypergraph
- Math-3820 Is it true that the sum of the k largest Laplacian eigenvalues of a graph with m edges is at most k(k+1)/2+m
- Math-3821 Is it possible for a permutation on n symbols to contain exactly n
- Math-3822 A d-dimensional permutation of order n is an n-by-n-by
- Math-3823 Take any positive integer, and apply the following process: (1) divide it by two if it's even, multiply by three and add
- Math-3824 Suppose that S is a set of positive integers with the property that S+S -- that is, all sums of the form s_(1)+s_(2) for
- Math-3825 Suppose k runners having distinct constant speeds start at a common point and run laps on a unit length circular track
- Math-3826 Show that there is some B so that no integer appears more than B times among the binomial coefficients
- Math-3827 There is no n so that the only integer m with phi(n) = phi(m) is m=n
- Math-3828 Is there a dense of points in the real plane so that every two points are at a rational distance
- Math-3829 Is there a prime between n^(2)and (n+1)^(2 )for every n > 0
- Math-3830 For each k and every sufficiently large n with k dividing ((n-1) choose (k-1)), there is a universal cycle for the k-sub
- Math-3831 Let G be a bicolored graph, and let H be the graph whose vertices are the valid pressing sequences of G and whose edges
- Math-3832 Dittert–Hajek conjecture
- Math-3833 Minimum length of a superpermutation
- Math-3834 Rudin's conjecture on squares in progressions
- Math-3835 Exact Dedekind numbers
- Math-3836 Conjectural Large Genus Asymptotics of Masur–Veech Volumes
- Math-3837 Conjectural Large Genus Asymptotics of Area Siegel–Veech Constants
- Math-3838 Multiplicity-one support of area Siegel–Veech constants
- Math-3839 Bounded wandering domains of entire functions
- Math-3840 Finiteness of Newtonian equilibrium points
- Math-3841 Modified Cartan conjecture
- Math-3842 Few inflection points of holomorphic curves
- Math-3843 Point-hyperplane incidences
- Math-3844 Integer-distance point sets
- Math-3845 Packing reciprocal rectangles in a square
- Math-3846 Classification of Finite Metric Spaces and Combinatorics of Convex Polytopes
- Math-3847 N-body problem
- Math-3848 Periods of Pseudo-Integrable Billiards
- Math-3849 Pisot substitution conjecture
- Math-3850 Nivat's conjecture