Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
(5) Lionel Levine: "How can we uniformly and efficiently sample from the set of maximal G-parking functions?" (a) Persi Diacons: "There may be a connection to my paper with Christos Athanasiadis [5]."
Let G be a graph, with vertex set V(G), minimum degree δ(G), and pebbling numbers π^*(G) and π_2^*(G) denoting its optimal and 2-restricted optimal pebbling numbers, respectively. Half-minimum-degree conjecture. If δ(G)≥ 1/2|V(G)|, then…
For all positive integers d and t, every t d(d+1)-connected graph contains t pairwise edge-disjoint spanning subgraphs, each of which is d-rigid. More generally, for all positive integers d and r, every (d(d+1)+2r)-connected graph contains…
Is there an absolute δ>0 such that every sufficiently large n-vertex graph whose edges admit a two-coloring with no monochromatic triangle has an independent set of size at least cn^1/3+δ for some absolute c>0?
Let T and T' be trees, and call them non-isomorphic when they do not become the same graph after removing vertex labels. The chromatic symmetric function of a graph G is denoted by X(G;x). Stanley–Schwartz–Zaks conjecture. If T and T' are…
Let G be a connected graph on n vertices. Its scaled Laplacian is ρ(G):=L(G)/trL(G), where L(G)=D(G)-A(G), with D(G) the diagonal degree matrix and A(G) the adjacency matrix. The von Neumann entropy of G is the Shannon entropy of the…
Ramsey number of simplices Jacob Fox Question: Estimate r_k(k+1) := r_k(k+1,k+1). Bounds: 2^Ω(k) ≤ r_k(k+1) ≤ 2^2^.^.^.^2^C, where the tower of 2's has height ≈ k. C.f. (Duffus--Lefmann--R"odl) for r_k(k+2).
Let L be a sporadic simplicial line arrangement in P^2_R, meaning a simplicial line arrangement outside the known infinite families, and let d be its number of lines. Cuntz–Geis conjecture. Then dleqslant 37. This is a stronger conjecture…
Let G be a non-trivial connected graph. The geometric-arithmetic index GA(G) and the atom-bond connectivity index ABC(G) are defined for G as the graph invariants compared in the paper. Non-equality conjecture. GA(G)≠ ABC(G). The…
Approximate Caratheodory theorem There is the following important theorem: Let A⊂ R^d be a finite set of points. Also assume that A is contained in the L^p unit Hamming ball for p≥ 2. Then any arbitrary point a in the convex hull of A can…
Let [n]=1,…,n, let I_n be the relevant coinvariant ideal, and for J⊆[n] let f_J be the polynomial and st(J) the associated J-staircase. Define the set of J-Artin monomials by A_n(J)=x_1^a_1… x_n^a_n:a_i<st(J)_i. J-Artin monomial…
Let B ⊆ N and for n ∈ N define the representation function r_B(n) = #(a_1,a_2) ∈ B^2 | a_1 + a_2 = n, where the pairs are ordered and a_1 = a_2 is allowed. Suppose that B is an additive basis of order 2, i.e. there exists n_0 such that…
Does every bridgeless graph have a collection of cycles that covers each edge exactly twice?
Let p≥ 3, let G^(p)_n+1 contain the copy AG^(p)_n, and let S_n_0 be the recursively defined border set. Let a be the vertex labeled A^n_0+1, and call a vertex special when its label has the form A^n-iX^i with X∈cal A_p∖A,B in the relevant…
Prove finiteness of the Shafarevich–Tate group of the elliptic-curve lift required by the Huang–Raskind method, in the general cases where it is not known.
Let A be a simple abelian variety over Q, exp_A:R^g→ A(R)^0 the exponential map of the Lie group A(R)^0 and Ω=Zω_1+…+Zω_g its kernel. Let u=u_1ω_1+…+u_gω_g∈R^g satisfy exp_A(u)∈ A(Q). Then 1,u_1,…,u_g are linearly independent over Q.
Let E=v_1,…,v_n be a spanning subset of a d-dimensional complex vector space V, and let w_i(E) denote the number of i-dimensional subspaces spanned by subsets of E. Dowling–Wilson top-heavy conjecture. For every i<d/2, one has w_i(E)≤…
Exhibit cyclic or ideal lattices on which LLL achieves its worst-case approximation factor.
Let λ,μ,ν,λ',μ',ν' be partitions, and define P^λ,μ,ν_λ',μ',ν'(n)=c(nλ+λ';nμ+μ',nν+ν'). Assume that f(n)=c(nλ;nμ,nν) is a polynomial of degree d, and that c(λ';μ',ν')≠ 0. Generalised stretched Littlewood–Richardson polynomiality conjecture.…
Let X be a connected, locally finite graph. The motion of X is m(X)=infm(f)| f∈Aut(X), f≠id, where m(f) is the cardinality of the set of vertices not fixed by f. The graph X has infinite motion when m(X) is infinite. Infinite motion…