A finite-certificate method for partition identities proves the three-row, level-two case of Primc’s conjecture.
Featured Problems
For certain totally real fields and non-split local conditions, modularity is proved for representations in the mixed case of the Fontaine–Mazur conjecture.
The cohomology of the odd-primary Steenrod algebra is shown to be F-isomorphic to an invariant subalgebra detected through a normal sub-Hopf algebra.
A vertexwise admissibility criterion is proved for the Farrell–Jones conjecture of graph products of pairs and related polyhedral products.
For every fixed ε>0, a deterministic O(n^{4/3})-query algorithm finds a (1−ε)-king in a tournament.
Existence of one-way permutations
Problem. Prove or disprove that one-way permutations exist.
Existence of one-way functions
Problem. Prove or disprove that one-way functions exist.
Fourier restriction conjecture for the sphere (Stein)
Conjecture. For , there is a constant such that … if and only if …
Riemann hypothesis
Riemann hypothesis. Every nontrivial zero of has real part . Equivalently, for every , …
The reconstruction conjecture for finite simple graphs
Let be a finite simple undirected graph. For each vertex , let be its card, and let … be its deck. The graph is reconstructible if every grap…
Dimension- and label-uniform stability of Gaussian propellers
Weighted capacity for four-state reconstruction with variable edge channels
Factor-count residues and Poisson-Dirichlet limits for prime predecessors
A rooted entropy bound for perfect matchings
Nonexistence of a complete mixed doubles round robin CMDRR(5,3)