Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For partitions λ,μ,ν of n, the Kronecker coefficient g_μν^λ is defined by V_μ⊗ V_ν≅bigoplus_λ g_μν^λV_λ for irreducible symmetric-group modules V_λ. Give a combinatorial interpretation of g_μν^λ.
Let G be a simple connected graph with n vertices. A graph is non-regular if its vertices do not all have the same degree. Zhu–You–Yang's conjecture. If G is non-regular, then irr_t(G) ≥ 2n-4. This conjecture concerns the minimum total…
Let H_1,…,H_n be contextuality scenarios, let overlineH_1⊗…⊗ H_n denote the completion of their n-fold product scenario, let bar H_i denote the completion of H_i, and let ^max⊗_i=1^n H_i denote the maximal tensor product. Completion…
Let Φ(x,y) be a standard polynomial of partial degree d. Let G(Φ) be its associated polynomial digraph, and let G(Φ)^* denote the nonsingular part of this digraph. Suppose that H is a d-regular digraph isomorphic to a component of G(Φ)^*.…
Can the Picard and Brauer groups of the principal blocks for stable module categories be completely computed by a descent spectral sequence based on their associated spectral schemes? A key example of categories satisfying the above…
Let P_4 be the prefix-reversal graph on the permutations of 1,2,3,4, and let γ(P_4) denote its orientable genus. A graph is a pretzel graph if it admits the corresponding pretzel-graph embedding. Pretzel-graph conjecture. The graph P_4 is…
Let G be a graph, let a simple random walk on G have cover time t_cov, and let t_cov(k) denote the expected time for k independent walks to cover G. Define the speed-up by S^k(G)=fract_covt_cov(k). Universal speed-up conjecture. There…
Let G be a graph, and let n denote the relevant maximum tangle order. A canonical sequence of tree-decompositions is a sequence (T_i,V_i) for 1≤ i≤ n, where each (T_i,V_i) is a tree-decomposition of G, and where refinement and torsos are…
Let S⊆Z, and let r(Z⟨ S⟩) be obtained from Z⟨ S⟩ by replacing every edge, including every loop, by r parallel copies. Suppose n∈N satisfies min(widetildenδ_0^Z⟨ S⟩)<min(widetilde(n-1)δ_0^Z⟨ S⟩) and max(widetildenδ_0^Z⟨…
We assume all matroids are finite. A matroid is modular if every pair of its flats is modular, and hypermodular if every pair of its maximal proper flats is modular. A matroid is strongly embeddable in a matroid if it is a restriction of…
For a compact convex domain Ω, the values of F_Ω at the vertices of its corner locus C_Ω give complete coordinates. How are these coordinates for Ω related to those for the dual domain Ω^*?
Let M be a matroid of rank r(M), with characteristic polynomial χ_M(λ)=∑_i=0^r(M)w_i(M)λ^r(M)-i. The integers w_i(M) are the Whitney numbers of the first kind. Heron–Rota–Welsh conjecture. The sequence |w_i(M)|_i=0^r(M) of absolute values…
Let V=1,…,f, let E be the set of two-element subsets of V, and let G_f be the quotient of the real polynomial algebra in variables x_i,j by the relations x_i,j^2=x_i,j. For each graph isomorphism class [G], let p_[G] be the corresponding…
Let G be a d-regular graph with n vertices, and let i(G) denote its number of independent sets. Alon and Kahn's conjecture. One has i(G) ≤ i(K_d,d)^n/(2d)=(2^d+1-1)^n/(2d). This formalized the proposed extremal role of a disjoint union of…
For a natural number k, a graph is 2k-edge-connected if every edge cut has size at least 2k, and an orientation is k-arc-connected if every ordered pair of vertices is joined by at least k edge-disjoint directed paths. Nash-Williams'…
Let G be a graph, let D be a target, let |D| denote its total demand, and let s(D) denote the parameter used in the source. Strong Target Conjecture. Every graph G satisfies π(G,D)≤ π_|D|(G)-s(D)+1 for every target D. The source reports…
Let K_n be the complete graph on n vertices, let P be a graph, and write diam(P) for its diameter, r(P) for its radius, and A_ucg(K_n,P) for the corresponding appendage number. The uniform central graph appendage conjecture. If…
A stable set in a graph is a set of vertices no two of which are adjacent; it is maximal if it is maximal under inclusion. Let G be a finite graph with at least one edge. Graph formulation of the union-closed sets conjecture. There are two…
Given a prime p, can a quadratic nonresidue modulo p be found in deterministic polynomial time?
For positive integers n, let N_n(t) be the polynomial defined by the rational generating function H'_n(t)=fracN_n(t)(1-t)^2n, where H'_n(t)=H'_nn(t) is obtained by differentiating the bivariate generating function for the earth mover's…