Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For which values of the number of variables and even degree does Σ_n,2d∪ C_n,2d⊊ (Σ+C)_n,2d:=Σ_n,2d+C_n,2d hold? The report answers this: the strict inclusion holds exactly when n≠ 2, 2d≠ 2, and (n,2d)≠(3,4). Equivalently, Σ_n,2d∪…
Let h_t(Δ) be the smallest integer such that every graph with h_t(Δ) edges and maximum degree at most Δ contains two edges whose distance is at least t; equivalently, h_t(Δ)-1 is the largest number of edges in a graph of maximum degree at…
Let U(N) be the unitary group, let ν_N be its Haar probability measure, and let Sym^k C^N be the kth symmetric power of the standard representation. Write tr(A,Sym^k C^N) for its character at A∈ U(N). Random-matrix conjecture. Fix B>0. If…
Consider the subcategory of BayesLens spanned by finite-dimensional smooth manifolds, with morphisms generated under sequential and parallel composition by the generalized autoencoder and inference games. Sampling-algorithm cybernetics…
Let A be a complex hyperplane arrangement, let A=H^*(X( A),Bbbk) be its Orlik-Solomon algebra over a field of characteristic 0, and let E be the exterior algebra on the degree-one generators of A. Write β_i,j=dim_BbbkTor^E_i(A,Bbbk)_j and…
Let (Λ,[I],K) be the triple corresponding to a pseudo-Anosov map φ∈ Mod~(X), and let λ_φ be its dilatation. The integral order Λ has class number h_Λ=|Λ/[I]|. Class-number conjecture. The number of conjugacy classes of pseudo-Anosov…
For k≥1, let Δ_k(ε) denote the function studied in the paper, with 0≤ε≤1. Delta three and Delta four polygonal conjecture. The graph of Δ_3(ε) is the polygonal path connecting (0,0),(frac47,frac27),(frac711,frac411),(frac57,frac37),(1,1),…
Let t(d,r) be the function defined in the report’s alternative colored Tverberg problem. The Bárány–Larman conjecture asserts that t(d,r)=r for all integers d≥ 1 and r≥ 2.
Let G be a topological group. Write G^*^00_top and G^*^000_top for the topological model-theoretic connected components of G^*. Topological amenability conjecture. If G is amenable, then G^*^00_top=G^*^000_top. This is the topological…
Let P_d be the set of probability vectors in dimension d, and let x,y∈ P_d have nonzero coordinates. Write xprec y for majorization, and write xprec_M y if there exists an integer m≥ 1 such that x^⊗ mprec y^⊗ m. Define N_p(x)=∑_i=1^d…
Are there infinitely many Wagstaff primes?
A weakly recognizable language is a language recognized by a weak alternating automaton, and its weak index is the automaton index appearing in the corresponding weak index hierarchy. The Borel hierarchy is the hierarchy of classes of sets…
Let k be a field. Define s by |k|=ℵ_s if k is infinite, and let s=0 otherwise. For a non-negative integer n, set R=k[X_1,…,X_n] and let Q(R) denote its fraction field. Gruson's conjecture. One has Ext_R^i(Q(R),R)≠ 0 if and only if…
Let a be a sufficiently regular kernel, and define κ_0:=lim_σsearrowζ(σ-ζ)^-1/2widetildea_σ(0), κ_2:=lim_σsearrowζ(σ-ζ)^-1|widetildea_σ”(0)|. Let ξ_σ be the rescaled support parameter, overlinew_σ the rescaled profile, overlineχ the…
Let G be a one-ended group and let (G,P) be a relatively hyperbolic pair, with Bowditch boundary ∂(G,P). Assume that this boundary is planar and has no cut points. Virtually Kleinian conjecture. Then G is virtually a Kleinian group. This…
Determine whether the phase transition of the XY model is continuous in every dimension d≥ 3.
A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. For a graph G, a set D of vertices locates a vertex v∉ D if the neighborhood of v within D is unique among all vertices in V(G)∖ D; a…
Let p be an odd prime. For parameters a_1,,a_6 and b_1,,b_5, write the truncated hypergeometric series as _6F_5[ a_1,a_2,a_3,a_4,a_5,a_6 b_1,b_2,b_3,b_4,b_5…
Let R be a simple eigenray diagram, let M_R be the associated symplectic manifold, let Y_R be the analytification of the scheme constructed from R, and let SH^0_Vit(M_R) denote the relevant Viterbo symplectic cohomology algebra. Strongly…
A cycle double cover of a graph is a list of cycles such that every edge belongs to exactly two of them. A graph is simple if it has no loops or parallel edges, and 2-edge-connected if deleting any one edge leaves it connected. Bondy's…