Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let C_j be the Cayley polytope associated with Cayley compositions, and let its normalized volume be Vol(C_j):=(j-1)! vol(C_j), where vol(C_j) is the Euclidean volume of C_j. Cayley polytope volume conjecture. For j≥ 2, Vol(C_j) is equal…
Let A be a free hyperplane arrangement with exponents exp(A)=(d_1,d_2,…,d_ℓ)_≤, where d_1=1, and let H∈A. Write A^H for the restriction to H and set d:=|A|-|A^H|. Root-difference conjecture. Then d=d_i for some i, or d>d_ℓ. The source…
Let G(Γ) and G(Δ) be right-angled Artin groups, and let Core(Γ) denote the core graph. RAAG core classification conjecture. If Core(Γ)≃Core(Δ), then G(Γ)≡ G(Δ). Moreover, Core(Γ) is the RAAG with the smallest graph in its elementary class:…
Is it true that ex(n; K_r,r) ≫ n^2-1/r?
A Young diagram Y is wide if, for every subset S of its rows, the diagram formed by S dominates its conjugate; a filling of Y is Latin if it assigns to each row the numbers 1,…,a_i injectively and is also injective in every column.…
Let K_n,n,n be the complete tripartite graph with three parts of size n, and let P_m denote the path on m vertices. For graphs G_0,G_1,G_2, write G_0↦(G_1,G_2) if every 2-coloring of the edges of G_0 contains a copy of G_i whose edges all…
Is the shortest vector problem on ideal or cyclic lattices NP-hard, either exactly or under approximation?
Let S be a geodesic surface of genus g, and let c(S) denote its cop number. Mohar's surface conjecture. c(S)=O(√g). The paper describes this as a tough conjecture because it implies the corresponding conjecture for graphs of genus g. It is…
Conjecture Every simple graph with at least 4 edges is reconstructible from it's edge deleted subgraphs
Let ngeqslant 2 and let (α_2,…,α_n) be an (n-1)-tuple of nonnegative integers. Let Φ be the map from words to multisets of conjugacy classes of primitive words described above. Length bound conjecture. The number of distinct lengths of…
Let G be a graph with terminal set T, and let Q(G,T) denote the polytope associated with a partition T of T. A vector is T_1-T_2-feasible when it is feasible for paths between the parts prescribed by partitions T_1 and T_2 of T.…
For a graph G, let X_G,k be the number of edges induced by a uniformly random k-vertex subset, and define I(n,k,ℓ):=maxP[X_G,k=ℓ]:v(G)=n, with ind(k,ℓ):=lim_n→∞I(n,k,ℓ). Sparse-edge decay conjecture. For all k,ℓ∈N with…
Consider the decision problem sc Trail Trap rm P2-win: given a graph, determine whether the second player has a winning strategy in Trail Trap. Trail Trap PSPACE-completeness conjecture. The problem sc Trail Trap rm P2-win is…
Let G be a graph with vertex set V(G), edge set E(G), order n(G), size m(G), vertex degree d_G(v), first Zagreb index M_1(G)=∑_v∈ V(G)d_G(v)^2, and second Zagreb index M_2(G)=∑_uv∈ E(G)d_G(u)d_G(v). Zagreb index comparison conjecture. If G…
Let T^6=(R/4Z)^6=[0,4]^6/~, and partition its 4^6 subcubes into four classes. Nonexistence conjecture. No partition of the subcubes of [0,4]^6/~ gives a quadrisection of T^6. The paper explains that the symmetric construction used in odd…
\textbf{Question:} (Erd\H{o}s 1986) What is the least possible number of distinct distances among n points in the plane if every 5 of them span at least 9 distinct distances?
Conjecture There exists a fixed constant c (probably c=4 suffices) so that every embedded (loopless) graph with edge-width ≥ c has a 5-local-tension.
Problem 3.2 (J. Bourgain). Given that H ≤ F∗ p and |H| > p δ, what is the smallest k which is guaranteed to satisfy kH (= H + · · · + H) = Fp? It is known that this holds provided that log k > (1 /δ )C, but can one do better?
Work out effective zeta-function computations for nondegenerate surfaces in toric threefolds.
Let G be a finite simple graph with m=|E(G)| edges and clique number ω(G), and let λ_1(G)≥λ_2(G)≥…≥λ_n(G) be the eigenvalues of its adjacency matrix. Bollobás and Nikiforov conjectured in 2007 that every non-complete graph satisfies…