Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let ψ_0 be the groundstate of the Brauer Hamiltonian, whose entries are weights of chord diagrams. For odd system size L=2n+1, a partial permutation has rank n; for even size L=2n, the relevant diagrams correspond to permutations. If π_n…
Let N be odd, and let d_M'=∑_i+j=N, i is evend^i,j_N(k,k,k;q,z) be the contribution associated with the singular point on cal M_N. Polynomiality conjecture. Then d_M'=fracP_N(q,z)∏_i=1^N(1-q^-iz^-1), where P_N(q,z) is a polynomial. This…
Problem Does every 3-connected cubic graph on 3k vertices admit a partition into k paths of length 2?
We assume all matroids are finite. A matroid M is sticky if, for every two matroids M_1 and M_2 with M=M_1|_E(M)=M_2|_E(M), there is a matroid widetildeM such that M_1=widetildeM|_E(M_1) and M_2=widetildeM|_E(M_2), where E(N) denotes the…
(7) Matt Macauley: "Consider the equivalence relation on the set of all acyclic orientations of a graph G of converting sources to sinks. This relation encodes the chip-firing game on G among a special class of divisors. In this special…
Let M=(S,r) be a loopless matroid of rank k whose ground set can be partitioned into k bases. Is it true that no matter how we partition S into sets of size k, the partition will have k-1 disjoint transversals that are bases?
For fixed d, let β(n)=o(n) be a function, and let G'_d,β be the class of graphs G whose degeneracy is at most d and whose bandwidth is at most β(|G|). A graph class is always-good when all sufficiently large members are H-good for every…
Let G be a simple graph. For graphs A and B, let Hom^surj(A,B) be the set of graph homomorphisms whose vertex maps are surjective, and write hom^surj(A,B)=|Hom^surj(A,B)|. Surjective homomorphism swapping conjecture. For every positive…
/Clark : What is the (homogeneous adjacency) spectrum of the Fano plane?
Let G be an n-vertex graph, and let wSz(G) denote its weighted Szeged index. Tree attainment conjecture. The minimum weighted Szeged index among n-vertex graphs is attained by a tree. This would reduce the problem of characterizing minimum…
Let X be a set of cardinality ℵ_ω and f be a function from the finite subsets of X to X such that f(A) ot∈ A for all A. Must there exist an infinite Y⊆ X that is independent - that is, for all finite B⊂ Y we have f(B) ot∈ Y?
Improve the running time of Coppersmith-type methods for finding small modular or integer roots.
Let Γ_≤ k denote the class of simple graphs with algebraic co-rank at most k, and let bf Forb(Γ_≤ k) be the set of graphs that do not contain a graph in Γ_≤ k as an induced subgraph. Finiteness conjecture. For all k∈N, the set bf Forb(Γ_≤…
A polynomial method proof of Frankl-Rodl theorem The Frankl-Rodl theorem is the following: let A⊂ F_2^n be so that A+A does not contain any element with hamming weight k for some k satisfying C√[]log α^-1n≤ k≤ n-C√[]log α^-1n. Then A has…
Let w be a word, let p_w(x) be its intersection polynomial, and let h(w) be the dimension of its ℓ-singular-vector space. The intersection-polynomial determination conjecture. The number h(w) depends only on p_w(x): if p_w_1(x)=p_w_2(x),…
Let K(n,k,l) be the recursively defined array of integers associated with the pascalized coupled Young graph, with n≥ 3, k,l satisfying 2k+l<n-2 and 2k+l≡ npmod 2. Monotonicity conjecture for K. One has…
Let G be a finite connected graph, let d be its diameter, let W(G) denote its Wiener index, and let C_2d+1 denote the cycle on 2d+1 vertices. DeLaViña–Waller conjecture. If d≥ 3 and |V(G)|=2d+1, then W(G)≤ W(C_2d+1). The conjecture…
Let G be a κ-connected graph on n vertices. Li et al.'s conjecture. There exists a constant C such that rc(G) < n/κ + C. This conjecture seeks a tight upper bound for the rainbow connection number in terms of vertex connectivity. The…
Let W_n be the squared cycle graph with n vertices, and let be the total cut complex of W_n. **Bayer et al.'s conjecture.** The (n-k-1)-dimensional complex is the void complex if n e 3k+i for the relevant ranges below; otherwise, it is…
It is a widely open problem to find “strict” convergent quantizations for (classes of) Poisson structures. where CΛ is a formal power series of differential operators associated to a certain graph Λ. In [BS23] we used the results of [BWa ,…