Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let A=(a_ij) be an n× n matrix with nonnegative entries and total entry sum n. Define φ(A)=∏_i=1^n∑_j=1^n a_ij+∏_j=1^n∑_i=1^n a_ij-per(A). Is φ uniquely maximized by the matrix A=J_n/n, where every entry of J_n is 1?
Let k be a positive integer. Let G and H be connected graphs on the same vertex set, with G⊂ H and exactly k edges added, so that |E(H)backslash E(G)|=k. Cameron–Mol's conjecture. For every positive integer k, there exist such graphs…
Conjecture For every positive integer t, every (loopless) graph G with χ(G) ≥ t immerses K_t.
Let f(n) be the minimum, over all 3-uniform hypergraphs on n vertices in which any two edges intersect in at most one vertex, of the maximum size of a vertex set containing no edge. Determine the order of growth of f(n).
For any M≥ 1, if A⊂ N is a sufficiently large finite Sidon set then there are at least M many a∈ A+A such that a+1,a-1 ot∈ A+A.
For each n, consider the collection of graphs on n vertices and the subset consisting of graphs on which the first player has a winning strategy in Trail Trap. Asymptotic rarity conjecture. The proportion of rm P1-win graphs on n vertices…
If every member of a family F is a 2n-subset of a 4n-element set and any two members intersect in at least two elements, is |F| at most [C(4n,2n)-C(2n,n)^2]/2?
Any 2k-edge-connected (possibly infinite) multigraph admits a k-edge-connected orientation.
Let k be a nonnegative integer, and let G be a k-diregular oriented graph on at most 4k+1 vertices, where k≠ 2. Here k-diregular means that every vertex has indegree and outdegree k. Jackson's conjecture. The graph G contains a directed…
For the self-stress identities on planar K4 and wheel graphs described in the report, are the formulas (including the identity Σ_{i<j} ω_ij f_ij = 1) instances of a more general phenomenon, and what are their connections to homology and…
Let E_1,…,E_n be pairwise non isogeneous elliptic curves with modular invariants j(E_h). For h=1,…,n, let ω_1h,ω_2h be a pair of fundamental periods of wp_h with η_1h,η_2h the associated quasi-periods, P_ih points on E_h(C) and p_ih (resp.…
: Is it possible for a permutation on n symbols to contain exactly n!/(m!^(2)(n - m)!) copies of each permutation on m symbols? (Yes for m=1,2,3. Unknown for m>3.) Do infinitely many such perfectly m-symmetric permutations exist?
Consider principle evaluations of symmetric functions in the context of s-lecture hall partitions.
Does every k-regular graph on 2n vertices admit a 1-factorization when k ≥ n (or k ≥ n-1 for even n)?
Let mgeqslant 0. Consider the 4^m canonical basis matrices of the real representation of the Clifford algebra R_m,m; a pair has disjoint support when the supports of its two matrices are disjoint, and is amicable or anti-amicable according…
The basis number bn(G) of a graph G is the minimum edge-congestion of a basis of its cycle space. We prove that every finite n-vertex multigraph satisfies bn(G)=O(log n), resolving, for simple graphs, a question of Bazargani, Biedl, Bose,…
Let N≥ 1 and A⊂ 1,…,N be a Sidon set. Is it true that, for any ε>0, there exist M and B⊂ N+1,…,M (which may depend on N,A,ε) such that A∪ B⊂ 1,…,M is a Sidon set of size at least (1-ε)M^1/2?
2.3. Enter the telescope conjecture. Recall the cofiber sequence wn Σ|vn | V (n − 1) / V (n − 1) / V (n) 2.2. The chromatic filtration. Later we learned that the stable homotopy cate- gory itself is similarly organized. The key tool here…
Let G be a graph on n vertices, let δ(G) denote its minimum degree, and let a cycle of maximum order mean a cycle containing the maximum possible number of vertices in G. Harvey's conjecture. If δ(G)≥ √n, then every cycle of maximum order…
Let G ~ G_n,p with p = Θ(1)/n. For each pair of vertices at distance 2, add an edge between them with probability q. Call the resulting graph H. Is it possible to recover G from H? If G is instead drawn from the SBM, is it possible to…