Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let k and m be positive integers. For variables x_1,…,x_2k+1, let CT_x_1,…,x_2k+1 denote the constant term in their Laurent expansion. Then the logarithmic odd Dyson conjecture. Up to a sign, CT_x_1,…,x_2k+1 frac1(x_1 … x_2k+1)^(2m+1)k…
Let a weighted web be a directed graph with vertex sets A and B and vertex capacities, and call it loose when it satisfies the looseness condition defined in the paper. A loose weighted web is linkable when the paper's specified family of…
Let F_h be the feedback function defined from a nonsingular function h in Equation, with n≥ m+2. An input pair consists of a rooted spanning tree and an initial state, and two input pairs are distinct when either component differs.…
For a bipartite graph G with X=[n], Y, and X_S=#{y\in Y:N(y)=S} for nonempty S\subset[n], define M by M_{ii}=\sum_{S:i\in S}|S| and M_{ij}=\sum_{S:i\in S, j\notin S}X_S/|S|. Since det(M) and det(diag(M)) are S_n-invariant polynomials in…
Let G be a possibly infinite simple graph on a vertex set V, and let A,B⊆ V be disjoint independent sets. Must there exist an index type ι, vertices a_i∈ A and b_i∈ B for each i∈ι, paths P_i in G from a_i to b_i, and a set S⊆ V such that:…
Let T_h be the complete binary tree with depth h. Veselovac's conjecture. The tree T_h is stackable for all h≥ 1. This conjecture was verified by Veselovac for h≤ 3, and for the root vertex only when h≤ 5; the general case remains open.
Let U_n be the set of Ulam words of length n, and let π interpret a binary word as an integer. For an integer N>1 and a residue class a∈Z/NZ, define the relative density ρ_a,N(n):=frac#w∈U_n| π(w)=apmod N#U_n. Equidistribution conjecture.…
Let A_n,j denote the number of alternating-sign matrices of size n whose unique 1 in the first row is in column j, and let n≥1 and i=1,…,n-1. Hole-one-descent conjecture. The identity α(n+1;1,2,…,i-1,i+1,i,i+1,…,n)=-∑_j=1^n(j-i)A_n,j…
Given k disjoint matchings in a bipartite graph, a rainbow matching is a matching that contains one edge from each of them. Is it true that any family of k disjoint matchings of size k+1 has a rainbow matching?
Give an asymptotic formula for R(3,k).
Let M=(M_n,k)_n,k≥ 0 be the array associated with the row numerators H_n(x) of the generating functions of T(n,m). Symmetry conjecture for M. For all nonnegative integers n and k, M_n,k=M_k,n. Equivalently, the array M is symmetric about…
We let Q_d denote the d-dimensional cube graph. A map φ: E(Q_d) → 0,1 is called edge-antipodal if φ(e) ≠ φ(e') whenever e,e' are antipodal edges. Conjecture If d ≥ 2 and φ: E(Q_d) → 0,1 is edge-antipodal, then there exist a pair of…
Let [n]=1,…,n, and for a code C⊆ 2^[n] write odim( C), cdim( C), and ndim( C) for its open, closed, and non-degenerate embedding dimensions. For each n, consider the maximum finite embedding dimension attained among codes on [n].…
For over-parameterized shallow neural networks, explain and prove when local-search methods such as gradient descent can reach global optimality despite high-dimensional nonconvex training, and characterize the resulting optimization…
Let G be a graph with n vertices and m edges, and let b be the number of blocks of G. Let span_0(G) denote the homological span of the degree-zero chromatic symmetric homology. Block bound conjecture. n-b≤ span_0(G)≤ n-1. The lower bound…
What is the exact value of the Ramsey number R(5,5)?
Let σ_1 and σ_2 be valence sequences with σ_1<σ_2, and let underlineλ_σ denote the lower growth-rate bound among face-homogeneous tessellations with valence sequence σ. Lower-growth monotonicity conjecture. underlineλ_σ_1≤underlineλ_σ_2.…
There is a positive function f(h,d,k) such that every graph G with h(G)>h>0 and maximum degree less than d has h(G_k)>f(h,d,k) for each k-net graph G_k. Is inf_k f(1,10,k)>0? In particular, what is the behavior of this bound for k-nets in…
For a countable 2-connected graph G, does the Freudenthal compactification |G²| contain a Hamilton circle? For a countable connected graph G, does |G³| contain a Hamilton circle? Here Gᵏ joins vertices at graph distance at most k, and a…
/Dutle : What are the (homogeneous adjacency) spectra of the ultracube and the complete hypergraph? (Ultracube = cartesian power of a hyperedge.)