Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Prove L^p → L^∞ estimate for Lu = f for f ∈ L^p and L a non-divergence, nonlocal form.
Let C be a generic k-tuple of semisimple conjugacy classes, let α_C be its associated dimension vector, and let H_α_C(z,w) be the rational function associated with this dimension vector. The mixed Poincaré series is denoted by…
For 1/2≤σ<1, let N(σ,T) count the zeros ρ of the Riemann zeta-function with Re(ρ)≥σ and |Im(ρ)|≤ T. Define A(σ) as the infimum of fixed exponents A such that, for infinitesimal δ>0 and unbounded T, N(σ-δ,T)≪ T^A(1-σ)+o(1). Density…
Let G be a finite undirected graph on n vertices. A dominating set is a set of vertices such that every vertex is either in the set or adjacent to a vertex in the set. For 0≤ j≤ n, let d_j(G) be the number of dominating sets of G with…
Let A be an augmentation category, and let G_n^sm(dAff) and A-G_n^sm(dAff) denote the homotopy categories of the corresponding derived Artin (A,n)-geometric stacks; likewise, let G_n^'ét(dAff) and A-G_n^'ét(dAff) denote the derived…
Let H_0=-Δ+q(x) be a Schrödinger operator with periodic potential q, let F_ λ(q) be its Fermi variety, and let the Condition mean that, for every λ in the interior of a spectral band, every irreducible component of F_ λ(q) intersects the…
Let a graph be globally synchronizing when its adjacency matrix is globally synchronizing, meaning that the only local minima of the Kuramoto energy are the global synchronized minima. Global synchronization conjecture. A uniformly random…
Let G be a compact topological group. A subgroup H≤ G is dense if its closure in G is G, and d(H) denotes the density character of H, while w(G) denotes the weight of G. Dense subgroup density conjecture. Every compact group G has a dense…
Let G errbracketR^n be a domain, and let p_G denote the point pair function. A function d is a quasi-metric if there is a constant c≥ 1 such that d(x,y)≤ c(d(x,z)+d(z,y)) for all points in its domain. The point pair function quasi-metric…
An oriented matroid is a combinatorial abstraction of the dependence relations among a set of real vectors together with their signs; a positively oriented matroid is an oriented matroid for which all bases have a positive orientation. A…
For n points in the plane, let s_i be the number of pairs at the ith distinct distance. Is Σ_i s_i^2<n^3+ε for every fixed ε>0 and all sufficiently large n?
Let K=Q(√d) be a quadratic field with d≡ 2pmod 3 and 3-class rank varrho=0. Consider 3-admissible non-split prime or prime-power conductors f=q, f=3, and f=9. Prime-power conductor frequency conjecture. The relative frequency of nilets…
Let d_k(n) be the expected distance from the origin after taking n random steps from the origin in Z^k (conditional on no self intersections) - that is, a self-avoiding walk. Is it true that lim_n→ ∞fracd_2(n)n^1/2= ∞? Is it true that…
Let e_w and E_κ denote the continuous Kirchhoff plate variables, and let e_w^h and E_κ^h be their discrete approximations. The notation alesssim b means a≤ Cb. Kirchhoff plate convergence conjecture. Assuming a smooth solution of the…
Let F be a countable field, let non(M) denote the uniformity of the meager ideal, and let a_vec,F be the least cardinality of a mad family of subspaces over F. Lower-bound conjecture. non(M)≤a_vec,F. Consequently, it is consistent that…
Let A=a,b,c with 1<a<b<c. Define integers by the division algorithm: b=qa+r, c=q_c(a+b)+r_c, r_c=q_a(2a)+r_a, c-a=q_c'(a+b)+r_c', r_c'=q_a'(2a)+r_a'. Here Per(A) and PrePer(A) denote the eventual period and preperiod. Three-element…
Let f(n,d,k) be the minimum number of hyperplanes, counted with multiplicity, needed to cover every point of the d-dimensional triangular grid T_d(n) at least k times. The parameters q,r are integers subject to the displayed decompositions…
Let N=l(w_0), let ρ∈ E(bf G^F,1), and let A_ρ and a_ρ be respectively the degree and valuation of the polynomial in q giving ρ(1). Let π denote the distinguished central element used in the source. Periodicity conjecture. For every bf w∈…
Let f(n,k) denote the maximal-clique deficiency parameter and let c(n,k) denote the layered-tree parameter for k-uniform hypergraphs, as defined in the paper. Exponential relation conjecture. For every fixed integer k≥3, f(n,k)=Θ_k…
Consider the evolution of a tree under network flow. A singular time is a time at which the flow develops a singularity, and a boundary curve is a curve of the network ending at the boundary. A minimal network is a network satisfying the…