OP-9707ProbabilityStatus unassessed
Green's Open Problem 28
Green's Open Problem 28
Formal Conjectures· Specialist source · status unassessed
The index
Explore the frontier
221 entries matching the current filters. Sorted by recently added.
OP-9624ProbabilityStatus unassessed
Sharp Bounds for Graph Matrices — Problem 31
Sharp Bounds for Graph Matrices — Problem 31
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9623ProbabilityStatus unassessed
The KLS Conjecture and Implications — Problem 30
The KLS Conjecture and Implications — Problem 30
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9615ProbabilityStatus unassessed
Injectivity and Stability of Phase Retrieval — Problem 21
Injectivity and Stability of Phase Retrieval — Problem 21
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9614ProbabilityStatus unassessed
Injectivity and Stability of Phase Retrieval — Problem 20
Injectivity and Stability of Phase Retrieval — Problem 20
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9613ProbabilityStatus unassessed
Injectivity and Stability of Phase Retrieval — Problem 19
Injectivity and Stability of Phase Retrieval — Problem 19
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9610ProbabilityStatus unassessed
Tensor Concentration Inequalities — Problem 16
Tensor Concentration Inequalities — Problem 16
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9369Number theoryOpen
Erdős #1144 · number theory / probability
Let f be a random completely multiplicative function, where for each prime p we independently choose f(p) in -1,1 uniformly at random. Is it true that limsup N to infty frac sum m leq N f(m) sqrt N …
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9047Geometry and topologyOpen
Erdős #529 · geometry / probability
Let d k(n) be the expected distance from the origin after taking n random steps from the origin in mathbb Z ^k (conditional on no self intersections) - that is, a [self-avoiding walk](<https://en.wikipedia.org/wik…
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9045AnalysisOpen
Erdős #524 · analysis / probability
For any t in (0,1) let t= sum k=1 ^ infty epsilon k(t)2^ -k (where epsilon k(t) in 0,1 ). What is the correct order of magnitude (for almost all t in(0,1) ) for M n(t)= max x in [-1,1] left lvert sum…
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9044AnalysisOpen
Erdős #522 · analysis / polynomials
Let f(z)= sum 0 leq k leq n epsilon k z^k be a random polynomial, where epsilon k in -1,1 independently uniformly at random for 0 leq k leq n . Is it true that, if R n is the number of roots of f(z) in…
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9043AnalysisOpen
Erdős #521 · analysis / polynomials
Let ( epsilon k) k geq 0 be independently uniformly chosen at random from -1,1 . If R n counts the number of real roots of f n(z)= sum 0 leq k leq n epsilon k z^k then is it true that, almost surely, …
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9042Number theoryOpen
Erdős #520 · number theory / probability
Let f be a Rademacher multiplicative function: a random -1,0,1 -valued multiplicative function, where for each prime p we independently choose f(p) in -1,1 uniformly at random, and for square-free integers…
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-2993ProbabilityOpen
(2+1) -dimensional interface dynamics Mixing time, hydrodynamic limit and anisotropic KPZ growth · 2018-prob-208
Special processes · ICM 2018: (2+1) -dimensional interface dynamics Mixing time, hydrodynamic limit and anisotropic KPZ growth
ICM Conjectures· Source assessment · not reviewed· 2018
OP-2992ProbabilityOpen
Metastability a potential theoretic approach · 2006-prob-207
Markov processes · ICM 2006: Metastability a potential theoretic approach
ICM Conjectures· Source assessment · not reviewed· 2006
OP-2991ProbabilityOpen
Hard Constraints and the Bethe Lattice Adventures at the Interface of Combinatorics and Statistical Physics · 2002-prob-206
Markov processes · ICM 2002: Hard Constraints and the Bethe Lattice Adventures at the Interface of Combinatorics and Statistical Physics
ICM Conjectures· Source assessment · not reviewed· 2002
OP-2990ProbabilityOpen
Asymptotic combinatorics and algebraic analysis · 1994-prob-205
Combinatorial probability · ICM 1994: Asymptotic combinatorics and algebraic analysis
ICM Conjectures· Source assessment · not reviewed· 1994
OP-2989ProbabilityOpen
Basic properties and conjectures · 2014-prob-204
Stochastic processes · ICM 2014: Basic properties and conjectures
ICM Conjectures· Source assessment · not reviewed· 2014
OP-2988ProbabilityOpen
Matrix ansatz and large deviations of the density in exclusion processes · 2006-prob-203
Limit theorems in probability theory · ICM 2006: Matrix ansatz and large deviations of the density in exclusion processes
ICM Conjectures· Source assessment · not reviewed· 2006
OP-2987ProbabilityOpen
Huge Random Structures and Mean Field Models · 1998-prob-202
Limit theorems in probability theory · ICM 1998: Huge Random Structures and Mean Field Models
ICM Conjectures· Source assessment · not reviewed· 1998
OP-2986ProbabilityOpen
A Key Large Deviation Principle for Interacting Stochastic Systems · 2010-prob-201
Special processes · ICM 2010: A Key Large Deviation Principle for Interacting Stochastic Systems
ICM Conjectures· Source assessment · not reviewed· 2010
OP-2985ProbabilityOpen
Random Time Evolution of Infinite Particle Systems · 1974-prob-200
Special processes · ICM 1974: Random Time Evolution of Infinite Particle Systems
ICM Conjectures· Source assessment · not reviewed· 1974
OP-2984ProbabilityOpen
Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry · 2010-prob-199
Distribution theory · ICM 2010: Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry
ICM Conjectures· Source assessment · not reviewed· 2010
OP-2983ProbabilityOpen
The weak-strong survival transition on trees and nonamenable graphs · 2006-prob-198
Special processes · ICM 2006: The weak-strong survival transition on trees and nonamenable graphs
ICM Conjectures· Source assessment · not reviewed· 2006
OP-2982ProbabilityOpen
The weak-strong survival transition on trees and nonamenable graphs · 2006-prob-197
Special processes · ICM 2006: The weak-strong survival transition on trees and nonamenable graphs
ICM Conjectures· Source assessment · not reviewed· 2006
Frequent tags
theoremdb 3909historical workshop 3469aim 3469icm 2898source curated 2675source candidate 1231number theory 1007status unassessed 622specialist collection 522pde dyn 399geometry 336analysis 269algebraic geometry 257algebra 224verifiable 2026 223probability 221graph theory 200topology 199lie rep 180combinatorics 154combinatorics discrete mathematics 141mathematical physics mechanics 137numerical analysis computer science 131research 2026 126