Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let (X,ω) be a four-dimensional Liouville domain such that c_k(X,ω)<∞ for all k. Volume conjecture. lim_k→∞c_k(X,ω)^2/k=4vol(X,ω). Here vol(X,ω)=1/2∫_Xω∧ω is the symplectic volume. The conjecture predicts that the asymptotic ECH-capacity…
Let Z be the graph shown in Figure 6: a longer path X joins the relevant subgraphs, with vertices a,b,c,d labelled as in that figure. No-perfect-state-transfer conjecture. Perfect state transfer does not occur between a and b in Z. The…
Let F be a field containing a root of unity of order p. A Demuškin cyclotomic pro-p pair is the pair G_F(p) whose underlying maximal pro-p Galois group is Demuškin; its rank is the dimension of its first cohomology over F_p. The pair has…
Let D_4 be the graph class referenced in the paper, consisting of the relevant maximal triangle-free graphs satisfying property D_4. Finite forbidden-subgraph conjecture for D_4. There exists a finite family F of graphs such that D_4 is…
Does there exist a singular measure in Zygmund's class A^* all of whose Fourier-Stieltjes coefficients are non-negative? (F. Holland)
Let F^c and F^o be the closed and open free energies, respectively, and write τ^o=exp(F^c+F^o) for the open partition function. For a_1,…,a_l≥ 0 and k≥ 0, define ⟨ ⟨τ_a_1…τ_a_lσ^k⟩ ⟩^o:=frac∂^l+kF^o∂ t_a_1…∂ t_a_l∂ s^k, and let L_n be the…
Let cmathcal H_n be an n-dimensional Hilbert space with fixed orthonormal basis cbracee_ic_i=1^n. For a linear operator T:ℓ_2^n→ℓ_2^n, write lVert TrVert for its operator norm and Te_i for its action on the ith basis vector.…
Let C_n be the set of signed permutation matrices of size 2(n-1)×2(n-1) invariant under diagonal and anti-diagonal reflections and avoiding the pattern (-2,-1). Define the weight of c as in the source from the difference between the…
Let G be a connected graph on n≥ 2 vertices, and let k≥ 4 be an integer. The minimum semidefinite rank rm msr(G) is the smallest rank among all positive semidefinite Hermitian matrices with graph G. The girth of G is the length of its…
Let d≥ 3, and let P denote the single random-current measure on Z^d. Let β_c^perc(P) be its percolation threshold and β_c^exp(P) its exponential-decay threshold. Random-current sharp-transition conjecture. The single random current on Z^d…
Let U_n,k(t) denote the scaled fraction of queues with at least k customers, let F_n,k(0) denote the corresponding initial tail fractions, and let u_k(t) be the fluid-limit functions. Fix k≤ K, where K is defined in the paper, and suppose…
Let V be the space of n=d+1 momenta in d dimensions, with the orthogonal group O(d) acting on V, and let θ_i and α_ij be the homogeneous system of parameters given by Equation. The algebra of Lorentz-invariant polynomials is C[V]^O(d).…
Let G be a graph with no component isomorphic to K_2. An edge k-list-weighting assigns to each edge a weight from an independently assigned list of k real numbers. Let ch_Σ^e(G) be the least k such that every assignment of lists of size k…
Let G be a directed acyclic graph with skeleton G, and let i be a vertex. Define G_downarrow i by orienting every edge between i and a neighbor toward i, while leaving all other edges as in G. Write c_G and c_G_downarrow i for their…
Let q, k, p_i, s_i, and a_ij define a recursion ⟨ s_1;a_11,a_12,…,a_1p_1:s_2;a_21,a_22,…,a_2p_2:…:s_k;a_k1,a_k2,…,a_kp_k|0⟩. Suppose that k=q, p_i=q-1, and the ceiling function lceiln/q⌉ satisfies this recursion. Divisibility and sum…
Let a probabilised context tree be given, with associated square matrix Q, and let S denote the set of alpha-LIS objects. For each α s∈ S, let (κ_α s(n))_n be the associated sequence. Right-eigenvalue conjecture. If, for every α s∈ S, the…
Let S^κ_P,R,s^3 and S^κ_P,R,S denote the relaxations associated respectively with the PRs^3 and PRS formulations. Equality conjecture. S^κ_P,R,s^3=S^κ_P,R,S. The conjecture asserts that the two relaxations have exactly the same strength.…
For non-vanishing τ_r^G(M), the absolute value |τ_r^G(M)| depends only on the fundamental group π_1(M).
A planar graph is a graph that can be drawn in the plane without crossings. A graph is 4-choosable if every assignment of lists of four colors admits a proper coloring from those lists. Erdős–Rubin–Taylor's conjecture. There exists a…
Let Δ=(G,H,ι,ρ_H) be a BZSV quadruple, let L be the associated Levi subgroup, and set Δ_red=(L,H,1,ρ_H,ι). Suppose the dual of Δ_red is hatΔ_red=(hatL,hatH_L',hatι',ρ'). For a representation ρ of a Levi subgroup L of G, write (ρ)_L^G for…