Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For integers a_0,…,a_2n≥ 0, let eta^⋆(s_1,…,s_r) denote the multiple zeta star value, let wt denote the total weight of the arguments, and let 2^a mean a consecutive entries equal to 2. In the first sum, permute the 2n+1 integers…
Let X∈St_C be a stack over C, and let I be a simplicial set. Define the category-theoretic moduli stack of quiver bundles by M_Vect(X),I^cat:=Map(underlineI,M_Vect(X)). Let M_Vect(X),I denote the previously constructed moduli stack of…
Let k be a field of characteristic 2, let S=k[x_1,x_2,x_3,y_1,y_2,y_3], and let I be the ideal of 2×2 minors of the generic 2×3 matrix x_1 x_2 x_3 y_1 y_2 y_3 . Does the limit lim_d→∞fracℓ (Ext^3_S(S/I^d,S))d^6 exist?
Let F be a family of L-functions over a function field F_q[x]. For each parameter D∈ F, let Λ_D denote the associated De Bruijn–Newman constant. Newman's conjecture for function fields. One has sup_D∈ FΛ_D=0. Unlike the number-field…
Let K be a knot, and let |csl|(K) denote the absolute value of its conformal linking energy. Positive lower-bound conjecture. There is a positive constant C such that, if K is a non-trivial knot, then |csl|(K)≥ C. Such a bound would…
Let X be a set of labels, and let LT(X) denote the set of labelled tree patterns on X. For a pattern P, write LT_n,no-P(X) for the labelled trees of size n avoiding P, and LT_n(X) for all labelled trees of size n. Growth-rate asymptotic…
Let G be a connected graph on n≥ 6 vertices. Write P_n-3K_4 for the kite graph consisting of a path attached to a complete graph K_4, and let c_e(G) denote the eigenvector dispersion of G. Four's a Crowd conjecture. The connected graph…
For h≥0, let f_h(φ):=∑_z∈ Z^21_[0,h](φ_z), where E_ν denotes expectation under the law ν used for the local extremal-field profile. Exponential-profile conjecture. The limit lim_h→∞ e^-α hE_ν(f_h) exists and belongs to (0,∞). The source…
For a fixed base b≥ 2, define the Nnamlerinchs constant overleftarrowK_b to be the smallest number greater than 1 such that every sufficiently large integer can be written as the sum of at most overleftarrowK_b reversed primes in base b.…
Let X^+ be the dominant weights and let lambda,mu,mu'inmathbbX^+. Write q(λ)=∑_μ∈X^+a_μ^λs(μ), where s(μ) is the Weyl-orbit sum. Use the order relation uparrow on weights. Monotonicity conjecture. If μ-ρ uparrow μ'-ρ uparrow λ-ρ, then…
A banding of the unknot is a band surgery on the unknot that produces an alternating link. An almost alternating diagram of the unknot is an alternating diagram with one dealternation crossing. The banding refinement of McCoy's conjecture.…
A graph is properly colored if adjacent vertices receive distinct colors, and a vertex-colored graph is rainbow if no two vertices have the same color. A graph is triangle-free if it contains no triangle. Aravind's conjecture. Every…
Let K be a CM field of degree 2g, and let S be a primitive CM type for K. Let L be the normal closure of K, and let r_K:L^×→ K^× be the reciprocity morphism corresponding to S. Let widetilder_K:Cl(L)→Cl(K) be the induced map on class…
Let C be a cubic category, with d, Q_i,j, P_SO(3), P_G_2, and the determinants Δ^square(7,1) and Δ^square(7,2) as defined in the paper. Beyond the preceding determinant calculations, these identities are asserted with high probability.…
Let M and N be hyperbolic 3-manifolds. Write vol_C for complex volume and β for the Bloch invariant. Ramakrishnan's conjecture. If vol_CM=vol_CN, then β(M)=β(N). The conjecture predicts that complex volume determines the Bloch invariant.…
Let G be a finitely generated acylindrically hyperbolic group, meaning a group acting non-elementarily and acylindrically by isometries on a hyperbolic space. Let G_cj, G_pc, and G_cm denote respectively the formal conjugacy, primitive…
Does every infinite-dimensional nuclear Fréchet space admit a chaotic operator?
Let T be a 2-linear tree, and let its bridge be the distinguished path joining its two linear components. Write Max(T) for the set of maximum arrangements of T, and MaxBip(T) for the set of maximal bipartite arrangements of T. Odd-bridge…
Let G=(V,E) be a finite simple undirected graph. Call a set of three edges of G a triangle if these edges form a cycle of length 3, i.e. if they are u,v,v,w,u,w for three distinct vertices u,v,w ∈ V. Two triangles are edge-disjoint if they…
Let A⊆[0,1]^n be a weak antichain, meaning that no two distinct points x,y∈ A satisfy x_i<y_i for every coordinate i. For each i∈[n], define underlineA_i=A∩(x_1,…,x_n)∈[0,1]^n:x_i=minx_1,…,x_n. Define the skewed projection…